java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/MonadicInvariant01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:55:55,713 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:55:55,716 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:55:55,734 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:55:55,734 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:55:55,736 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:55:55,737 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:55:55,739 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:55:55,742 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:55:55,742 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:55:55,745 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:55:55,745 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:55:55,746 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:55:55,747 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:55:55,753 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:55:55,754 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:55:55,755 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:55:55,762 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:55:55,765 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:55:55,770 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:55:55,774 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:55:55,775 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:55:55,782 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:55:55,782 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:55:55,782 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:55:55,784 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:55:55,785 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:55:55,789 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:55:55,790 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:55:55,791 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:55:55,791 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:55:55,792 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:55:55,792 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:55:55,794 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:55:55,795 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:55:55,796 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:55:55,796 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:55:55,818 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:55:55,820 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:55:55,821 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:55:55,821 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:55:55,822 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:55:55,822 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:55:55,822 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:55:55,822 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:55:55,822 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:55:55,823 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:55:55,823 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:55:55,823 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:55:55,823 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:55:55,823 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:55:55,824 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:55:55,827 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:55:55,827 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:55:55,828 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:55:55,828 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:55:55,828 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:55:55,830 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:55:55,830 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:55:55,831 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:55:55,831 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:55:55,831 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:55:55,831 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:55:55,832 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:55:55,832 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:55:55,832 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:55:55,832 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:55:55,832 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:55:55,833 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:55:55,833 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:55:55,833 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:55:55,833 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:55:55,834 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:55:55,834 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:55:55,834 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:55:55,834 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:55:55,834 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:55:55,834 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:55:55,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:55:55,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:55:55,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:55:55,906 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:55:55,908 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:55:55,909 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/MonadicInvariant01.bpl [2018-12-03 15:55:55,910 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/MonadicInvariant01.bpl' [2018-12-03 15:55:55,950 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:55:55,952 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:55:55,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:55:55,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:55:55,953 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:55:55,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:55:55" (1/1) ... [2018-12-03 15:55:55,983 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:55:55" (1/1) ... [2018-12-03 15:55:55,989 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:55:55,992 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:55:55,992 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:55:55,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:55:55,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:55:55,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:55:55,996 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:55:56,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:55:55" (1/1) ... [2018-12-03 15:55:56,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:55:55" (1/1) ... [2018-12-03 15:55:56,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:55:55" (1/1) ... [2018-12-03 15:55:56,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:55:55" (1/1) ... [2018-12-03 15:55:56,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:55:55" (1/1) ... [2018-12-03 15:55:56,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:55:55" (1/1) ... [2018-12-03 15:55:56,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:55:55" (1/1) ... [2018-12-03 15:55:56,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:55:56,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:55:56,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:55:56,022 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:55:56,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:55:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:55:56,089 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 15:55:56,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 15:55:56,089 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 15:55:56,271 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:55:56,271 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:55:56,271 INFO L202 PluginConnector]: Adding new model MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:55:56 BoogieIcfgContainer [2018-12-03 15:55:56,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:55:56,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:55:56,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:55:56,276 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:55:56,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:55:55" (1/2) ... [2018-12-03 15:55:56,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4ec493 and model type MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:55:56, skipping insertion in model container [2018-12-03 15:55:56,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:55:56" (2/2) ... [2018-12-03 15:55:56,280 INFO L112 eAbstractionObserver]: Analyzing ICFG MonadicInvariant01.bpl [2018-12-03 15:55:56,290 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:55:56,298 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:55:56,317 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:55:56,352 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:55:56,352 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:55:56,353 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:55:56,353 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:55:56,353 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:55:56,353 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:55:56,353 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:55:56,354 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:55:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:55:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:55:56,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:56,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:55:56,380 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:56,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:56,387 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-12-03 15:55:56,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:56,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:56,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:56,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:56,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:56,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:55:56,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 15:55:56,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:55:56,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:55:56,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:55:56,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:55:56,552 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 15:55:56,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:56,640 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 15:55:56,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:55:56,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:55:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:56,654 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:55:56,655 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 15:55:56,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:55:56,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 15:55:56,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 15:55:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:55:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 15:55:56,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-12-03 15:55:56,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:56,708 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 15:55:56,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:55:56,708 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 15:55:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:55:56,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:56,709 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 15:55:56,709 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:56,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:56,710 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-12-03 15:55:56,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:56,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:56,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:56,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:56,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:56,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:56,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:56,837 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 15:55:56,839 INFO L205 CegarAbsIntRunner]: [0], [4], [5], [6] [2018-12-03 15:55:56,880 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:55:56,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:55:57,051 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:55:57,052 INFO L272 AbstractInterpreter]: Visited 4 different actions 16 times. Merged at 3 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:55:57,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:57,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:55:57,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:57,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:57,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:57,085 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:57,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:57,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:57,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:57,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-03 15:55:57,274 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:57,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:55:57,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:55:57,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:55:57,276 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-03 15:55:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:57,319 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 15:55:57,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:55:57,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 15:55:57,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:57,320 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:55:57,320 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:55:57,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:55:57,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:55:57,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:55:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:55:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 15:55:57,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-12-03 15:55:57,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:57,325 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 15:55:57,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:55:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 15:55:57,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:55:57,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:57,326 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-12-03 15:55:57,326 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:57,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:57,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-12-03 15:55:57,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:57,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:57,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:57,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:57,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:57,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:57,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:57,421 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:57,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:57,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:57,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:57,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:57,444 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:57,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:55:57,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:57,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:57,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:57,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:57,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-03 15:55:57,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:57,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:55:57,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:55:57,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:55:57,868 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-03 15:55:57,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:57,907 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 15:55:57,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:55:57,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-03 15:55:57,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:57,908 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:55:57,909 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:55:57,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:55:57,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:55:57,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:55:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:55:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 15:55:57,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-12-03 15:55:57,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:57,917 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 15:55:57,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:55:57,917 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 15:55:57,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:55:57,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:57,918 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-12-03 15:55:57,918 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:57,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:57,919 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-12-03 15:55:57,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:57,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:57,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:57,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:57,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:58,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:58,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:58,008 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:58,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:58,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:58,009 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:58,018 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:58,018 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:58,029 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:58,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:58,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:58,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:58,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:58,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-03 15:55:58,282 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:58,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:58,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:58,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:55:58,284 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-12-03 15:55:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:58,339 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 15:55:58,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:55:58,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-03 15:55:58,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:58,342 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:55:58,342 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:55:58,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:55:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:55:58,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 15:55:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:55:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 15:55:58,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-12-03 15:55:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:58,346 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 15:55:58,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:58,347 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 15:55:58,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:58,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:58,347 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-12-03 15:55:58,348 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:58,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:58,348 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-12-03 15:55:58,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:58,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:58,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:58,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:58,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:58,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:58,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:58,469 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:58,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:58,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:58,469 INFO L192 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 [2018-12-03 15:55:58,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:58,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:58,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:58,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:59,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:59,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-03 15:55:59,103 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:59,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:55:59,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:55:59,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:55:59,105 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-12-03 15:55:59,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:59,175 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 15:55:59,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:55:59,176 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 15:55:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:59,177 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:55:59,177 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:55:59,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:55:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:55:59,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 15:55:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:55:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 15:55:59,181 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-12-03 15:55:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:59,181 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 15:55:59,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:55:59,182 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 15:55:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:55:59,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:59,183 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-12-03 15:55:59,183 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:59,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:59,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-12-03 15:55:59,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:59,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:59,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:59,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:59,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:59,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:59,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:59,284 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:59,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:59,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:59,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:59,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:59,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:59,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 15:55:59,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:59,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:59,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:59,549 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:59,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:59,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2018-12-03 15:55:59,574 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:59,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:55:59,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:55:59,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:59,575 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-12-03 15:55:59,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:59,643 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 15:55:59,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:55:59,644 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 15:55:59,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:59,644 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:55:59,645 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:55:59,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:55:59,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:55:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:55:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 15:55:59,649 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-12-03 15:55:59,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:59,649 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 15:55:59,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:55:59,650 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 15:55:59,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:55:59,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:59,651 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-12-03 15:55:59,651 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:59,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:59,651 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-12-03 15:55:59,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:59,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:59,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:59,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:59,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:59,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:59,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:59,781 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:59,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:59,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:59,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:59,794 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:59,794 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:59,820 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:59,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:59,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:59,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:00,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:00,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2018-12-03 15:56:00,104 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:00,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:56:00,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:56:00,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:56:00,105 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-12-03 15:56:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:00,167 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 15:56:00,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:56:00,167 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 15:56:00,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:00,168 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:56:00,169 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:56:00,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:56:00,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:56:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 15:56:00,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:56:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 15:56:00,174 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-12-03 15:56:00,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:00,175 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 15:56:00,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:56:00,175 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 15:56:00,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:56:00,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:00,176 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-12-03 15:56:00,176 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:00,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:00,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-12-03 15:56:00,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:00,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:00,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:00,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:00,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:00,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:00,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:00,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:00,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:00,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:00,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:00,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:00,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:00,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:00,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:00,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:00,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2018-12-03 15:56:00,678 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:00,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:56:00,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:56:00,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:56:00,681 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-12-03 15:56:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:00,731 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 15:56:00,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:56:00,733 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-12-03 15:56:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:00,734 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:56:00,734 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:56:00,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:56:00,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:56:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:56:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:56:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 15:56:00,739 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-12-03 15:56:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:00,740 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 15:56:00,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:56:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 15:56:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:56:00,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:00,741 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-12-03 15:56:00,741 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:00,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:00,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-12-03 15:56:00,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:00,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:00,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:00,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:00,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:00,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:00,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:00,871 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:00,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:00,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:00,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:00,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:00,880 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:00,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 15:56:00,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:00,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:01,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:01,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:01,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2018-12-03 15:56:01,393 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:01,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:56:01,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:56:01,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:56:01,395 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-12-03 15:56:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:01,450 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 15:56:01,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:01,450 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-12-03 15:56:01,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:01,452 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:56:01,452 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:56:01,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:56:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:56:01,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 15:56:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:56:01,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 15:56:01,456 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-12-03 15:56:01,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:01,457 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 15:56:01,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:56:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 15:56:01,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:56:01,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:01,458 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-12-03 15:56:01,458 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:01,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:01,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-12-03 15:56:01,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:01,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:01,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:01,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:01,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:01,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:01,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:01,616 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:01,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:01,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:01,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:01,626 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:01,626 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:01,634 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:01,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:01,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:01,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:02,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:02,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2018-12-03 15:56:02,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:02,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:56:02,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:56:02,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:56:02,325 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-12-03 15:56:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:02,601 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 15:56:02,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:56:02,602 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-12-03 15:56:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:02,603 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:56:02,603 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:56:02,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:56:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:56:02,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 15:56:02,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:56:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 15:56:02,608 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-12-03 15:56:02,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:02,608 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 15:56:02,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:56:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 15:56:02,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:56:02,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:02,609 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-12-03 15:56:02,609 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:02,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:02,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-12-03 15:56:02,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:02,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:02,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:02,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:02,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:02,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:02,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:02,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:02,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:02,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:02,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:02,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:02,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:02,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:03,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:03,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:03,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2018-12-03 15:56:03,537 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:03,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:56:03,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:56:03,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:56:03,539 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-12-03 15:56:03,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:03,591 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 15:56:03,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:56:03,592 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-12-03 15:56:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:03,593 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:56:03,593 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:56:03,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:56:03,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:56:03,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 15:56:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:56:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 15:56:03,599 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-12-03 15:56:03,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:03,599 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 15:56:03,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:56:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 15:56:03,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:56:03,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:03,600 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-12-03 15:56:03,600 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:03,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:03,601 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-12-03 15:56:03,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:03,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:03,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:03,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:03,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:03,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:03,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:03,802 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:03,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:03,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:03,803 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:03,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:03,811 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:03,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 15:56:03,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:03,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:04,220 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:04,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:04,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:04,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2018-12-03 15:56:04,518 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:04,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:56:04,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:56:04,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:56:04,519 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-12-03 15:56:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:04,582 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 15:56:04,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:56:04,582 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-12-03 15:56:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:04,583 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:56:04,583 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:56:04,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:56:04,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:56:04,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:56:04,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:56:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 15:56:04,589 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-12-03 15:56:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:04,589 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 15:56:04,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:56:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 15:56:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:56:04,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:04,590 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-12-03 15:56:04,590 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:04,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:04,590 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-12-03 15:56:04,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:04,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:04,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:04,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:04,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:04,731 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:04,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:04,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:04,731 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:04,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:04,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:04,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:04,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:04,741 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:04,761 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:04,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:04,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:05,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:05,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:05,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2018-12-03 15:56:05,398 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:05,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:56:05,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:56:05,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:56:05,400 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-12-03 15:56:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:05,480 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 15:56:05,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:56:05,481 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-03 15:56:05,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:05,482 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:56:05,482 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:56:05,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:56:05,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:56:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 15:56:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:56:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 15:56:05,488 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-12-03 15:56:05,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:05,489 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 15:56:05,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:56:05,489 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 15:56:05,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 15:56:05,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:05,490 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-12-03 15:56:05,490 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:05,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:05,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-12-03 15:56:05,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:05,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:05,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:05,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:05,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:05,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:05,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:05,672 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:05,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:05,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:05,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:05,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:05,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:05,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:05,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:06,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:06,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2018-12-03 15:56:06,982 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:06,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:56:06,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:56:06,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:56:06,983 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-12-03 15:56:07,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:07,056 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 15:56:07,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:56:07,057 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-12-03 15:56:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:07,058 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:56:07,058 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:56:07,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:56:07,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:56:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 15:56:07,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 15:56:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 15:56:07,066 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-12-03 15:56:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:07,066 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 15:56:07,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:56:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 15:56:07,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:56:07,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:07,067 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-12-03 15:56:07,068 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:07,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:07,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-12-03 15:56:07,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:07,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:07,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:07,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:07,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:07,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:07,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:07,298 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:07,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:07,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:07,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:07,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:07,307 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:07,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 15:56:07,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:07,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:07,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:08,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:08,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2018-12-03 15:56:08,508 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:08,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:56:08,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:56:08,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:56:08,510 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-12-03 15:56:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:08,678 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 15:56:08,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:56:08,678 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-12-03 15:56:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:08,679 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:56:08,680 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:56:08,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:56:08,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:56:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 15:56:08,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:56:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 15:56:08,685 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-12-03 15:56:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:08,685 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 15:56:08,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:56:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 15:56:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 15:56:08,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:08,686 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-12-03 15:56:08,687 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:08,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:08,687 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-12-03 15:56:08,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:08,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:08,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:08,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:08,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:08,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:08,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:08,940 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:08,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:08,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:08,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:08,949 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:08,949 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:08,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:08,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:08,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:09,401 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:09,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:09,852 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:09,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:09,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2018-12-03 15:56:09,874 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:09,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:56:09,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:56:09,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:56:09,876 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-12-03 15:56:09,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:09,964 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 15:56:09,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:56:09,965 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-12-03 15:56:09,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:09,966 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:56:09,966 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:56:09,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:56:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:56:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 15:56:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:56:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 15:56:09,972 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-12-03 15:56:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:09,973 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 15:56:09,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:56:09,973 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 15:56:09,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 15:56:09,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:09,974 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-12-03 15:56:09,974 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:09,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:09,974 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-12-03 15:56:09,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:09,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:09,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:09,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:09,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:10,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:10,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:10,366 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:10,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:10,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:10,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:10,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:10,378 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:10,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:10,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:11,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:11,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2018-12-03 15:56:11,094 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:11,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:56:11,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:56:11,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:56:11,095 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-12-03 15:56:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:11,175 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 15:56:11,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:56:11,175 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-12-03 15:56:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:11,176 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:56:11,177 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 15:56:11,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:56:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 15:56:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 15:56:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 15:56:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 15:56:11,183 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-12-03 15:56:11,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:11,183 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 15:56:11,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:56:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 15:56:11,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 15:56:11,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:11,184 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-12-03 15:56:11,184 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:11,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:11,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-12-03 15:56:11,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:11,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:11,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:11,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:11,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:11,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:11,464 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:11,464 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:11,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:11,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:11,464 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:11,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:11,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:11,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 15:56:11,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:11,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:11,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:12,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:12,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2018-12-03 15:56:12,162 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:12,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:56:12,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:56:12,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:56:12,164 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-12-03 15:56:12,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:12,400 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 15:56:12,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:56:12,401 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-12-03 15:56:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:12,402 INFO L225 Difference]: With dead ends: 41 [2018-12-03 15:56:12,402 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 15:56:12,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:56:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 15:56:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 15:56:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:56:12,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 15:56:12,408 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-12-03 15:56:12,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:12,408 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 15:56:12,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:56:12,409 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 15:56:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 15:56:12,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:12,409 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-12-03 15:56:12,410 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:12,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:12,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-12-03 15:56:12,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:12,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:12,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:12,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:12,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:13,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:13,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:13,200 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:13,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:13,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:13,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:13,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:13,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:13,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:13,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:13,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:13,513 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:13,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:14,111 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:14,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:14,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2018-12-03 15:56:14,130 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:14,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:56:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:56:14,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:56:14,132 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-12-03 15:56:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:14,293 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 15:56:14,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:56:14,293 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-12-03 15:56:14,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:14,294 INFO L225 Difference]: With dead ends: 43 [2018-12-03 15:56:14,294 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 15:56:14,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:56:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 15:56:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 15:56:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 15:56:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 15:56:14,299 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-12-03 15:56:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:14,299 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 15:56:14,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:56:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 15:56:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:56:14,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:14,300 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-12-03 15:56:14,301 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:14,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:14,301 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-12-03 15:56:14,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:14,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:14,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:14,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:14,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:14,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:14,578 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:14,578 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:14,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:14,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:14,578 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:14,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:14,587 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:14,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:14,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:15,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:15,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2018-12-03 15:56:15,690 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:15,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:56:15,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:56:15,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:56:15,693 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-12-03 15:56:15,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:15,789 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 15:56:15,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:56:15,790 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-12-03 15:56:15,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:15,791 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:56:15,791 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 15:56:15,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:56:15,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 15:56:15,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 15:56:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 15:56:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 15:56:15,798 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-12-03 15:56:15,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:15,799 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 15:56:15,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:56:15,799 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 15:56:15,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 15:56:15,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:15,800 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-12-03 15:56:15,800 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:15,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:15,801 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-12-03 15:56:15,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:15,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:15,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:15,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:15,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:16,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:16,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:16,088 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:16,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:16,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:16,089 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:16,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:16,097 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:16,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 15:56:16,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:16,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:16,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:16,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:16,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2018-12-03 15:56:16,986 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:16,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:56:16,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:56:16,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:56:16,988 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-12-03 15:56:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:17,091 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 15:56:17,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:56:17,092 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-12-03 15:56:17,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:17,092 INFO L225 Difference]: With dead ends: 47 [2018-12-03 15:56:17,092 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 15:56:17,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:56:17,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 15:56:17,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 15:56:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 15:56:17,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 15:56:17,098 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-12-03 15:56:17,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:17,099 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 15:56:17,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:56:17,099 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 15:56:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 15:56:17,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:17,100 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-12-03 15:56:17,100 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:17,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-12-03 15:56:17,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:17,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:17,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:17,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:17,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:17,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:17,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:17,931 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:17,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:17,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:17,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:17,939 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:17,940 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:17,953 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:17,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:17,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:18,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:19,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2018-12-03 15:56:19,123 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:19,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:56:19,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:56:19,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:56:19,125 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-12-03 15:56:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:19,218 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 15:56:19,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:56:19,221 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-12-03 15:56:19,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:19,222 INFO L225 Difference]: With dead ends: 49 [2018-12-03 15:56:19,222 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 15:56:19,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:56:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 15:56:19,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 15:56:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 15:56:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 15:56:19,227 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-12-03 15:56:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:19,227 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 15:56:19,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:56:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 15:56:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 15:56:19,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:19,228 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-12-03 15:56:19,228 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:19,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:19,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-12-03 15:56:19,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:19,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:19,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:19,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:19,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:19,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:19,592 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:19,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:19,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:19,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:19,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:19,601 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:19,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:21,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:21,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:21,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2018-12-03 15:56:21,936 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:21,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:56:21,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:56:21,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:56:21,938 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-12-03 15:56:22,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:22,043 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 15:56:22,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:56:22,043 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-12-03 15:56:22,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:22,044 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:56:22,044 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 15:56:22,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:56:22,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 15:56:22,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 15:56:22,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 15:56:22,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 15:56:22,049 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-12-03 15:56:22,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:22,050 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 15:56:22,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:56:22,050 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 15:56:22,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 15:56:22,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:22,050 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-12-03 15:56:22,051 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:22,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:22,051 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-12-03 15:56:22,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:22,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:22,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:22,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:22,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:22,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:22,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:22,404 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:22,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:22,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:22,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:22,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:22,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:22,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 15:56:22,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:22,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:22,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:23,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:23,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2018-12-03 15:56:23,811 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:23,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:56:23,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:56:23,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:56:23,813 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-12-03 15:56:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:23,956 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 15:56:23,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:56:23,956 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-12-03 15:56:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:23,957 INFO L225 Difference]: With dead ends: 53 [2018-12-03 15:56:23,957 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:56:23,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:56:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:56:23,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 15:56:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:56:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 15:56:23,963 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-12-03 15:56:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:23,963 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 15:56:23,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:56:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 15:56:23,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:56:23,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:23,964 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-12-03 15:56:23,965 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:23,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:23,965 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-12-03 15:56:23,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:23,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:23,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:23,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:23,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:24,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:24,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:24,430 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:24,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:24,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:24,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:24,439 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:24,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:24,452 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:24,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:24,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:24,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:25,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:25,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2018-12-03 15:56:25,698 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:25,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:56:25,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:56:25,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 15:56:25,699 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-12-03 15:56:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:25,816 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 15:56:25,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:56:25,817 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-12-03 15:56:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:25,817 INFO L225 Difference]: With dead ends: 55 [2018-12-03 15:56:25,818 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 15:56:25,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 15:56:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 15:56:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 15:56:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 15:56:25,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 15:56:25,823 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-12-03 15:56:25,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:25,824 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 15:56:25,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:56:25,824 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 15:56:25,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 15:56:25,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:25,825 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-12-03 15:56:25,825 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:25,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:25,825 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-12-03 15:56:25,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:25,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:25,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:25,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:25,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:26,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:26,252 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:26,252 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:26,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:26,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:26,252 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:26,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:26,261 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:26,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:26,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:28,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:28,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2018-12-03 15:56:28,042 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:28,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 15:56:28,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 15:56:28,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:56:28,044 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-12-03 15:56:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:28,239 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 15:56:28,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:56:28,239 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-12-03 15:56:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:28,240 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:56:28,240 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 15:56:28,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:56:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 15:56:28,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 15:56:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 15:56:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 15:56:28,245 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-12-03 15:56:28,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:28,245 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 15:56:28,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 15:56:28,246 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 15:56:28,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 15:56:28,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:28,246 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-12-03 15:56:28,247 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:28,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:28,247 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-12-03 15:56:28,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:28,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:28,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:28,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:28,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:28,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:28,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:28,901 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:28,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:28,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:28,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:28,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:28,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:28,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 15:56:28,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:28,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:29,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:30,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:30,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2018-12-03 15:56:30,312 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:30,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:56:30,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:56:30,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 15:56:30,313 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-12-03 15:56:30,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:30,423 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 15:56:30,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:56:30,424 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-12-03 15:56:30,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:30,425 INFO L225 Difference]: With dead ends: 59 [2018-12-03 15:56:30,425 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 15:56:30,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 15:56:30,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 15:56:30,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 15:56:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 15:56:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 15:56:30,429 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-12-03 15:56:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:30,429 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 15:56:30,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:56:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 15:56:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 15:56:30,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:30,430 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-12-03 15:56:30,430 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:30,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:30,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-12-03 15:56:30,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:30,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:30,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:30,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:30,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:31,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:31,086 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:31,087 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:31,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:31,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:31,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:31,095 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:31,096 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:31,109 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:31,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:31,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:31,624 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:31,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:32,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:32,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2018-12-03 15:56:32,565 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:32,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 15:56:32,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 15:56:32,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:56:32,566 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-12-03 15:56:32,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:32,709 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 15:56:32,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:56:32,718 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-12-03 15:56:32,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:32,719 INFO L225 Difference]: With dead ends: 61 [2018-12-03 15:56:32,719 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 15:56:32,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:56:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 15:56:32,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 15:56:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 15:56:32,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 15:56:32,722 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-12-03 15:56:32,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:32,723 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 15:56:32,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 15:56:32,723 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 15:56:32,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 15:56:32,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:32,724 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-12-03 15:56:32,724 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:32,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:32,724 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-12-03 15:56:32,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:32,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:32,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:32,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:32,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:33,230 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:33,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:33,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:33,230 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:33,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:33,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:33,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:33,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:33,241 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:33,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:33,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:35,058 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:35,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:35,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2018-12-03 15:56:35,076 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:35,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 15:56:35,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 15:56:35,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 15:56:35,077 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-12-03 15:56:35,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:35,329 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 15:56:35,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:56:35,330 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-12-03 15:56:35,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:35,331 INFO L225 Difference]: With dead ends: 63 [2018-12-03 15:56:35,331 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 15:56:35,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 15:56:35,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 15:56:35,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 15:56:35,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 15:56:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 15:56:35,336 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-12-03 15:56:35,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:35,336 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 15:56:35,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 15:56:35,337 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 15:56:35,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 15:56:35,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:35,337 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-12-03 15:56:35,337 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:35,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:35,338 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-12-03 15:56:35,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:35,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:35,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:35,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:35,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:35,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:35,869 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:35,869 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:35,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:35,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:35,870 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:35,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:35,878 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:35,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 15:56:35,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:35,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:36,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:37,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:37,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2018-12-03 15:56:37,628 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:37,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 15:56:37,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 15:56:37,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:56:37,630 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-12-03 15:56:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:37,805 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 15:56:37,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:56:37,806 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-12-03 15:56:37,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:37,807 INFO L225 Difference]: With dead ends: 65 [2018-12-03 15:56:37,807 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 15:56:37,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:56:37,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 15:56:37,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 15:56:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 15:56:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 15:56:37,811 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-12-03 15:56:37,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:37,812 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 15:56:37,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 15:56:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 15:56:37,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 15:56:37,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:37,812 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-12-03 15:56:37,813 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:37,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:37,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-12-03 15:56:37,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:37,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:37,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:37,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:37,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:38,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:38,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:38,378 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:38,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:38,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:38,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:38,389 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:38,389 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:38,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:38,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:38,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:39,210 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:39,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:40,448 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:40,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:40,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2018-12-03 15:56:40,466 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:40,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 15:56:40,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 15:56:40,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:56:40,468 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-12-03 15:56:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:40,607 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 15:56:40,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:56:40,608 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-12-03 15:56:40,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:40,609 INFO L225 Difference]: With dead ends: 67 [2018-12-03 15:56:40,609 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 15:56:40,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:56:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 15:56:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 15:56:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 15:56:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 15:56:40,614 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-12-03 15:56:40,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:40,615 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 15:56:40,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 15:56:40,615 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 15:56:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 15:56:40,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:40,615 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-12-03 15:56:40,616 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:40,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:40,616 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-12-03 15:56:40,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:40,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:40,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:40,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:40,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:41,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:41,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:41,371 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:41,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:41,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:41,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:41,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:41,380 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:41,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:42,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:43,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:43,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2018-12-03 15:56:43,253 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:43,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 15:56:43,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 15:56:43,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:56:43,255 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-12-03 15:56:43,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:43,404 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 15:56:43,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:56:43,404 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-12-03 15:56:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:43,405 INFO L225 Difference]: With dead ends: 69 [2018-12-03 15:56:43,406 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 15:56:43,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:56:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 15:56:43,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 15:56:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 15:56:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 15:56:43,409 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-12-03 15:56:43,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:43,410 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 15:56:43,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 15:56:43,410 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 15:56:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 15:56:43,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:43,410 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-12-03 15:56:43,411 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:43,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:43,411 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-12-03 15:56:43,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:43,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:43,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:43,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:43,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:44,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:44,233 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:44,233 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:44,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:44,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:44,233 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:44,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:44,242 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:44,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-03 15:56:44,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:44,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:45,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:45,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:46,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:46,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2018-12-03 15:56:46,465 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:46,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 15:56:46,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 15:56:46,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 15:56:46,467 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-12-03 15:56:46,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:46,598 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 15:56:46,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:56:46,598 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-12-03 15:56:46,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:46,599 INFO L225 Difference]: With dead ends: 71 [2018-12-03 15:56:46,599 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 15:56:46,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 15:56:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 15:56:46,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 15:56:46,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 15:56:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 15:56:46,605 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-12-03 15:56:46,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:46,605 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 15:56:46,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 15:56:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 15:56:46,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 15:56:46,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:46,606 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-12-03 15:56:46,606 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:46,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:46,606 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-12-03 15:56:46,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:46,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:46,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:46,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:46,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:47,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:47,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:47,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:47,212 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:47,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:47,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:47,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:47,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:47,222 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:47,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:47,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:47,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:47,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:49,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:49,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2018-12-03 15:56:49,656 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:49,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 15:56:49,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 15:56:49,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:56:49,658 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-12-03 15:56:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:49,828 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 15:56:49,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:56:49,829 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-12-03 15:56:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:49,830 INFO L225 Difference]: With dead ends: 73 [2018-12-03 15:56:49,830 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 15:56:49,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:56:49,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 15:56:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 15:56:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 15:56:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 15:56:49,834 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-12-03 15:56:49,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:49,834 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 15:56:49,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 15:56:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 15:56:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 15:56:49,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:49,835 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-12-03 15:56:49,835 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:49,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:49,835 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-12-03 15:56:49,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:49,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:49,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:49,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:49,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:50,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:50,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:50,563 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:50,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:50,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:50,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:50,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:50,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:50,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:51,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:51,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:52,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:52,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:52,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2018-12-03 15:56:52,812 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:52,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 15:56:52,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 15:56:52,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 15:56:52,813 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-12-03 15:56:52,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:52,950 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 15:56:52,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:56:52,951 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-12-03 15:56:52,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:52,952 INFO L225 Difference]: With dead ends: 75 [2018-12-03 15:56:52,952 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 15:56:52,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 15:56:52,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 15:56:52,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 15:56:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 15:56:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 15:56:52,956 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-12-03 15:56:52,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:52,957 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 15:56:52,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 15:56:52,957 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 15:56:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 15:56:52,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:52,958 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-12-03 15:56:52,958 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:52,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:52,958 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-12-03 15:56:52,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:52,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:52,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:52,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:52,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:53,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:53,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:53,737 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:53,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:53,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:53,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:53,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:53,746 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:53,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 15:56:53,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:53,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:54,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:56,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:56,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2018-12-03 15:56:56,332 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:56,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 15:56:56,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 15:56:56,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:56:56,334 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-12-03 15:56:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:56,724 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 15:56:56,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:56:56,725 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-12-03 15:56:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:56,726 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:56:56,726 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 15:56:56,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:56:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 15:56:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 15:56:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 15:56:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 15:56:56,729 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-12-03 15:56:56,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:56,729 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 15:56:56,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 15:56:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 15:56:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 15:56:56,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:56,730 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-12-03 15:56:56,731 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:56,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:56,731 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-12-03 15:56:56,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:56,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:56,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:56,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:56,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:57,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:57,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:57,378 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:57,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:57,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:57,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:57,387 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:57,387 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:57,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:57,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:57,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:58,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:00,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:00,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2018-12-03 15:57:00,093 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:00,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 15:57:00,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 15:57:00,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 15:57:00,095 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-12-03 15:57:00,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:00,240 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 15:57:00,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:57:00,241 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-12-03 15:57:00,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:00,242 INFO L225 Difference]: With dead ends: 79 [2018-12-03 15:57:00,242 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 15:57:00,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 15:57:00,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 15:57:00,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 15:57:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 15:57:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 15:57:00,246 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-12-03 15:57:00,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:00,246 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 15:57:00,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 15:57:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 15:57:00,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 15:57:00,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:00,247 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-12-03 15:57:00,247 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:00,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:00,247 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-12-03 15:57:00,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:00,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:00,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:00,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:00,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:01,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:01,220 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:01,220 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:01,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:01,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:01,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:01,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:01,231 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:01,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:02,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:02,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:04,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:04,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2018-12-03 15:57:04,128 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:04,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 15:57:04,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 15:57:04,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:57:04,130 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-12-03 15:57:04,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:04,335 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 15:57:04,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:57:04,335 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-12-03 15:57:04,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:04,336 INFO L225 Difference]: With dead ends: 81 [2018-12-03 15:57:04,336 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 15:57:04,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:57:04,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 15:57:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 15:57:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 15:57:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 15:57:04,341 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-12-03 15:57:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:04,341 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 15:57:04,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 15:57:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 15:57:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 15:57:04,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:04,342 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-12-03 15:57:04,342 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:04,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:04,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-12-03 15:57:04,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:04,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:04,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:05,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:05,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:05,733 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:05,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:05,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:05,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:05,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:05,742 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:05,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 15:57:05,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:05,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:06,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:08,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:08,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2018-12-03 15:57:08,682 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:08,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 15:57:08,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 15:57:08,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 15:57:08,684 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-12-03 15:57:08,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:08,871 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 15:57:08,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:57:08,872 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-12-03 15:57:08,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:08,873 INFO L225 Difference]: With dead ends: 83 [2018-12-03 15:57:08,873 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 15:57:08,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 15:57:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 15:57:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 15:57:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 15:57:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 15:57:08,878 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-12-03 15:57:08,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:08,878 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 15:57:08,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 15:57:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 15:57:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 15:57:08,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:08,879 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-12-03 15:57:08,879 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:08,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:08,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-12-03 15:57:08,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:08,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:08,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:08,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:08,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:10,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:10,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:10,131 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:10,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:10,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:10,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:10,141 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:10,141 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:10,163 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:10,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:10,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:11,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:11,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:13,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:13,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:13,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2018-12-03 15:57:13,061 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:13,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 15:57:13,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 15:57:13,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:57:13,064 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-12-03 15:57:13,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:13,222 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 15:57:13,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:57:13,222 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-12-03 15:57:13,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:13,223 INFO L225 Difference]: With dead ends: 85 [2018-12-03 15:57:13,223 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 15:57:13,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:57:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 15:57:13,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 15:57:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 15:57:13,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 15:57:13,227 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-12-03 15:57:13,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:13,227 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 15:57:13,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 15:57:13,228 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 15:57:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 15:57:13,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:13,228 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-12-03 15:57:13,229 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:13,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:13,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-12-03 15:57:13,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:13,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:13,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:13,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:13,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:14,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:14,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:14,106 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:14,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:14,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:14,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:14,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:14,115 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:14,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:15,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:15,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:17,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:17,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:17,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2018-12-03 15:57:17,401 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:17,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 15:57:17,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 15:57:17,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 15:57:17,402 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-12-03 15:57:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:17,595 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 15:57:17,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:57:17,595 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-12-03 15:57:17,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:17,596 INFO L225 Difference]: With dead ends: 87 [2018-12-03 15:57:17,596 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 15:57:17,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 15:57:17,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 15:57:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 15:57:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 15:57:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 15:57:17,601 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-12-03 15:57:17,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:17,602 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 15:57:17,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 15:57:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 15:57:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 15:57:17,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:17,603 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-12-03 15:57:17,603 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:17,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:17,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-12-03 15:57:17,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:17,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:17,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:17,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:17,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:18,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:18,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:18,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:18,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:18,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:18,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:18,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:18,539 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:18,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-03 15:57:18,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:18,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:19,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:21,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:21,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2018-12-03 15:57:21,953 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:21,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 15:57:21,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 15:57:21,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:57:21,956 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-12-03 15:57:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:22,157 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 15:57:22,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:57:22,158 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-12-03 15:57:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:22,159 INFO L225 Difference]: With dead ends: 89 [2018-12-03 15:57:22,159 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 15:57:22,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:57:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 15:57:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 15:57:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 15:57:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 15:57:22,165 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-12-03 15:57:22,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:22,165 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 15:57:22,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 15:57:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 15:57:22,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 15:57:22,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:22,166 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-12-03 15:57:22,167 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:22,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:22,167 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-12-03 15:57:22,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:22,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:22,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:22,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:22,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:23,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:23,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:23,134 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:23,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:23,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:23,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:23,144 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:23,144 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:23,165 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:23,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:23,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:24,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:26,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:26,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:26,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2018-12-03 15:57:26,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:26,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 15:57:26,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 15:57:26,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 15:57:26,891 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-12-03 15:57:27,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:27,109 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 15:57:27,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:57:27,109 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-12-03 15:57:27,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:27,110 INFO L225 Difference]: With dead ends: 91 [2018-12-03 15:57:27,110 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 15:57:27,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 15:57:27,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 15:57:27,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 15:57:27,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 15:57:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 15:57:27,115 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-12-03 15:57:27,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:27,115 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 15:57:27,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 15:57:27,116 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 15:57:27,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 15:57:27,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:27,116 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-12-03 15:57:27,116 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:27,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:27,117 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-12-03 15:57:27,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:27,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:27,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:27,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:27,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:28,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:28,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:28,102 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:28,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:28,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:28,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:28,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:28,111 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:28,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:29,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:31,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:31,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2018-12-03 15:57:31,853 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:31,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 15:57:31,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 15:57:31,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:57:31,855 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-12-03 15:57:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:32,115 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 15:57:32,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:57:32,116 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-12-03 15:57:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:32,117 INFO L225 Difference]: With dead ends: 93 [2018-12-03 15:57:32,117 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 15:57:32,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:57:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 15:57:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 15:57:32,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 15:57:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 15:57:32,127 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-12-03 15:57:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:32,127 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 15:57:32,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 15:57:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 15:57:32,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 15:57:32,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:32,128 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-12-03 15:57:32,128 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:32,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:32,129 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-12-03 15:57:32,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:32,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:32,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:32,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:32,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:33,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:33,167 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:33,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:33,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:33,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:33,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:33,176 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:33,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-03 15:57:33,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:33,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:34,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:37,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:37,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2018-12-03 15:57:37,049 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:37,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 15:57:37,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 15:57:37,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 15:57:37,052 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-12-03 15:57:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:37,231 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 15:57:37,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:57:37,231 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-12-03 15:57:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:37,232 INFO L225 Difference]: With dead ends: 95 [2018-12-03 15:57:37,232 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 15:57:37,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 15:57:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 15:57:37,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 15:57:37,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 15:57:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 15:57:37,238 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-12-03 15:57:37,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:37,239 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 15:57:37,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 15:57:37,239 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 15:57:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 15:57:37,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:37,239 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-12-03 15:57:37,240 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:37,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:37,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-12-03 15:57:37,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:37,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:37,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:37,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:37,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:38,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:38,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:38,197 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:38,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:38,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:38,197 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:38,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:38,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:38,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:38,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:38,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:39,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:42,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:42,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2018-12-03 15:57:42,560 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:42,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 15:57:42,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 15:57:42,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:57:42,562 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-12-03 15:57:42,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:42,790 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 15:57:42,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:57:42,790 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-12-03 15:57:42,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:42,791 INFO L225 Difference]: With dead ends: 97 [2018-12-03 15:57:42,791 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 15:57:42,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:57:42,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 15:57:42,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 15:57:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 15:57:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 15:57:42,795 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-12-03 15:57:42,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:42,795 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 15:57:42,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 15:57:42,795 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 15:57:42,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 15:57:42,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:42,796 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-12-03 15:57:42,796 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:42,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:42,796 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-12-03 15:57:42,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:42,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:42,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:42,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:42,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:43,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:43,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:43,841 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:43,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:43,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:43,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:43,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:43,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:43,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:45,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:48,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:48,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2018-12-03 15:57:48,148 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:48,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 15:57:48,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 15:57:48,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 15:57:48,150 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-12-03 15:57:48,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:48,374 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 15:57:48,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:57:48,374 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-12-03 15:57:48,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:48,376 INFO L225 Difference]: With dead ends: 99 [2018-12-03 15:57:48,376 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 15:57:48,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 15:57:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 15:57:48,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 15:57:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 15:57:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 15:57:48,381 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-12-03 15:57:48,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:48,381 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 15:57:48,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 15:57:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 15:57:48,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 15:57:48,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:48,382 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-12-03 15:57:48,383 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:48,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:48,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-12-03 15:57:48,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:48,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:48,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:48,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:48,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:49,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:49,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:49,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:49,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:49,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:49,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:49,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:49,496 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:49,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-03 15:57:49,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:49,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:51,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:54,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:54,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2018-12-03 15:57:54,218 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:54,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 15:57:54,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 15:57:54,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:57:54,221 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-12-03 15:57:54,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:54,425 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 15:57:54,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:57:54,425 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-12-03 15:57:54,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:54,426 INFO L225 Difference]: With dead ends: 101 [2018-12-03 15:57:54,426 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 15:57:54,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:57:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 15:57:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 15:57:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:57:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 15:57:54,431 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-12-03 15:57:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:54,431 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 15:57:54,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 15:57:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 15:57:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 15:57:54,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:54,432 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-12-03 15:57:54,432 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:54,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:54,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-12-03 15:57:54,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:54,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:54,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:54,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:54,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:55,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:55,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:55,909 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:55,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:55,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:55,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:55,919 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:55,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:55,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:55,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:55,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:57,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:00,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:00,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2018-12-03 15:58:00,174 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:00,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 15:58:00,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 15:58:00,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 15:58:00,177 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-12-03 15:58:00,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:00,414 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 15:58:00,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:58:00,415 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-12-03 15:58:00,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:00,415 INFO L225 Difference]: With dead ends: 103 [2018-12-03 15:58:00,415 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 15:58:00,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 15:58:00,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 15:58:00,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 15:58:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 15:58:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 15:58:00,421 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-12-03 15:58:00,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:00,421 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 15:58:00,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 15:58:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 15:58:00,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 15:58:00,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:00,422 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-12-03 15:58:00,422 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:00,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:00,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-12-03 15:58:00,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:00,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:00,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:00,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:00,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:02,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:02,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:02,069 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:02,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:02,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:02,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:02,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:02,080 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:02,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:04,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:08,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:08,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2018-12-03 15:58:08,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:08,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 15:58:08,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 15:58:08,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 15:58:08,103 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-12-03 15:58:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:08,356 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 15:58:08,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:58:08,356 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-12-03 15:58:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:08,357 INFO L225 Difference]: With dead ends: 105 [2018-12-03 15:58:08,358 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 15:58:08,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 15:58:08,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 15:58:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 15:58:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 15:58:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 15:58:08,363 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-12-03 15:58:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:08,364 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 15:58:08,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 15:58:08,364 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 15:58:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 15:58:08,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:08,364 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2018-12-03 15:58:08,365 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:08,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:08,365 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2018-12-03 15:58:08,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:08,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:08,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:08,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:08,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:09,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:09,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:09,527 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:09,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:09,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:09,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:09,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:09,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:09,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-03 15:58:09,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:09,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:11,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:14,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:14,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:14,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2018-12-03 15:58:14,385 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:14,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 15:58:14,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 15:58:14,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10660, Invalid=13210, Unknown=0, NotChecked=0, Total=23870 [2018-12-03 15:58:14,387 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2018-12-03 15:58:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:15,996 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 15:58:15,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:58:15,996 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2018-12-03 15:58:15,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:15,997 INFO L225 Difference]: With dead ends: 107 [2018-12-03 15:58:15,997 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 15:58:15,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10302 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=10660, Invalid=13210, Unknown=0, NotChecked=0, Total=23870 [2018-12-03 15:58:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 15:58:16,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 15:58:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 15:58:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 15:58:16,003 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-12-03 15:58:16,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:16,004 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 15:58:16,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 15:58:16,004 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 15:58:16,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 15:58:16,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:16,005 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2018-12-03 15:58:16,005 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:16,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:16,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2018-12-03 15:58:16,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:16,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:16,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:16,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:16,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:17,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:17,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:17,671 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:17,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:17,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:17,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:17,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:17,681 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:17,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:17,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:17,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:19,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:22,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:22,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 156 [2018-12-03 15:58:22,815 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:22,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 15:58:22,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 15:58:22,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11077, Invalid=13729, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:58:22,817 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 106 states. [2018-12-03 15:58:23,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:23,052 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 15:58:23,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 15:58:23,053 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 105 [2018-12-03 15:58:23,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:23,054 INFO L225 Difference]: With dead ends: 109 [2018-12-03 15:58:23,054 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 15:58:23,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10712 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=11077, Invalid=13729, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:58:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 15:58:23,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 15:58:23,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 15:58:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 15:58:23,060 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-12-03 15:58:23,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:23,060 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 15:58:23,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 15:58:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 15:58:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 15:58:23,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:23,061 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2018-12-03 15:58:23,061 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:23,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:23,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2018-12-03 15:58:23,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:23,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:23,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:23,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:23,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:24,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:24,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:24,505 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:24,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:24,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:24,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:24,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:24,514 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:24,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:26,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:29,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:29,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 159 [2018-12-03 15:58:29,903 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:29,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 15:58:29,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 15:58:29,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11502, Invalid=14258, Unknown=0, NotChecked=0, Total=25760 [2018-12-03 15:58:29,906 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 108 states. [2018-12-03 15:58:30,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:30,187 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 15:58:30,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:58:30,187 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 107 [2018-12-03 15:58:30,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:30,188 INFO L225 Difference]: With dead ends: 111 [2018-12-03 15:58:30,188 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 15:58:30,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11130 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=11502, Invalid=14258, Unknown=0, NotChecked=0, Total=25760 [2018-12-03 15:58:30,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 15:58:30,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 15:58:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 15:58:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 15:58:30,192 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-12-03 15:58:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:30,193 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 15:58:30,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 15:58:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 15:58:30,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 15:58:30,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:30,194 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2018-12-03 15:58:30,194 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:30,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:30,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2018-12-03 15:58:30,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:30,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:30,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:30,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:30,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:31,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:31,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:31,739 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:31,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:31,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:31,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:31,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:31,748 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:31,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-03 15:58:31,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:31,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:33,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:33,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:37,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:37,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:37,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 162 [2018-12-03 15:58:37,042 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:37,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 15:58:37,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 15:58:37,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=14797, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 15:58:37,043 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 110 states. [2018-12-03 15:58:37,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:37,260 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 15:58:37,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:58:37,261 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 109 [2018-12-03 15:58:37,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:37,262 INFO L225 Difference]: With dead ends: 113 [2018-12-03 15:58:37,262 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 15:58:37,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11556 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=11935, Invalid=14797, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 15:58:37,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 15:58:37,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 15:58:37,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 15:58:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 15:58:37,267 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-12-03 15:58:37,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:37,267 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 15:58:37,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 15:58:37,267 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 15:58:37,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 15:58:37,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:37,268 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2018-12-03 15:58:37,268 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:37,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:37,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2018-12-03 15:58:37,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:37,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:37,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:37,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:37,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:39,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:39,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:39,032 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:39,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:39,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:39,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:39,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:39,040 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:39,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:39,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:39,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:40,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:44,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:44,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 165 [2018-12-03 15:58:44,706 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:44,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 15:58:44,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 15:58:44,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12376, Invalid=15346, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 15:58:44,708 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 112 states. [2018-12-03 15:58:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:45,021 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 15:58:45,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 15:58:45,022 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 111 [2018-12-03 15:58:45,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:45,023 INFO L225 Difference]: With dead ends: 115 [2018-12-03 15:58:45,023 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 15:58:45,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11990 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=12376, Invalid=15346, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 15:58:45,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 15:58:45,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 15:58:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 15:58:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 15:58:45,029 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-12-03 15:58:45,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:45,029 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 15:58:45,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 15:58:45,030 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 15:58:45,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 15:58:45,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:45,030 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2018-12-03 15:58:45,031 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:45,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:45,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2018-12-03 15:58:45,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:45,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:45,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:45,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:45,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:46,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:46,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:46,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:46,357 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:46,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:46,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:46,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:46,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:46,367 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:46,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:48,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:52,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:52,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 168 [2018-12-03 15:58:52,335 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:52,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 15:58:52,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 15:58:52,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12825, Invalid=15905, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:58:52,337 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 114 states. [2018-12-03 15:58:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:52,871 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-03 15:58:52,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 15:58:52,871 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 113 [2018-12-03 15:58:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:52,872 INFO L225 Difference]: With dead ends: 117 [2018-12-03 15:58:52,873 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 15:58:52,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12432 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=12825, Invalid=15905, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:58:52,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 15:58:52,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 15:58:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 15:58:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-12-03 15:58:52,878 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-12-03 15:58:52,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:52,878 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-12-03 15:58:52,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 15:58:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-12-03 15:58:52,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 15:58:52,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:52,879 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2018-12-03 15:58:52,879 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:52,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:52,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2018-12-03 15:58:52,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:52,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:52,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:52,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:52,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:56,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:56,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:56,127 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:56,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:56,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:56,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:56,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:56,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:56,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-03 15:58:56,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:56,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:58,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:02,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:02,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 171 [2018-12-03 15:59:02,279 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:02,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-12-03 15:59:02,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-12-03 15:59:02,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13282, Invalid=16474, Unknown=0, NotChecked=0, Total=29756 [2018-12-03 15:59:02,281 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 116 states. [2018-12-03 15:59:02,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:02,597 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-12-03 15:59:02,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 15:59:02,598 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 115 [2018-12-03 15:59:02,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:02,599 INFO L225 Difference]: With dead ends: 119 [2018-12-03 15:59:02,599 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 15:59:02,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13282, Invalid=16474, Unknown=0, NotChecked=0, Total=29756 [2018-12-03 15:59:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 15:59:02,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 15:59:02,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 15:59:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-12-03 15:59:02,603 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2018-12-03 15:59:02,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:02,603 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-12-03 15:59:02,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-12-03 15:59:02,603 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-12-03 15:59:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 15:59:02,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:02,604 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2018-12-03 15:59:02,604 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:02,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:02,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2018-12-03 15:59:02,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:02,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:02,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:02,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:02,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:04,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:04,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:04,165 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:04,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:04,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:04,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:04,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:04,173 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:04,201 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:04,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:04,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:06,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:06,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:10,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:10,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 174 [2018-12-03 15:59:10,239 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:10,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-03 15:59:10,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-03 15:59:10,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13747, Invalid=17053, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 15:59:10,242 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 118 states. [2018-12-03 15:59:10,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:10,521 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-12-03 15:59:10,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:59:10,521 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 117 [2018-12-03 15:59:10,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:10,522 INFO L225 Difference]: With dead ends: 121 [2018-12-03 15:59:10,522 INFO L226 Difference]: Without dead ends: 120 [2018-12-03 15:59:10,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13340 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=13747, Invalid=17053, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 15:59:10,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-03 15:59:10,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-12-03 15:59:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 15:59:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-12-03 15:59:10,528 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2018-12-03 15:59:10,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:10,528 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-12-03 15:59:10,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-03 15:59:10,528 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-12-03 15:59:10,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 15:59:10,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:10,529 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2018-12-03 15:59:10,529 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:10,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:10,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2018-12-03 15:59:10,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:10,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:10,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:10,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:10,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:12,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:12,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:12,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:12,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:12,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:12,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:12,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:12,298 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:12,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:14,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:18,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:18,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 177 [2018-12-03 15:59:18,846 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:18,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-12-03 15:59:18,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-12-03 15:59:18,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14220, Invalid=17642, Unknown=0, NotChecked=0, Total=31862 [2018-12-03 15:59:18,849 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 120 states. [2018-12-03 15:59:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:19,118 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-12-03 15:59:19,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 15:59:19,118 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 119 [2018-12-03 15:59:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:19,119 INFO L225 Difference]: With dead ends: 123 [2018-12-03 15:59:19,119 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 15:59:19,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13806 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=14220, Invalid=17642, Unknown=0, NotChecked=0, Total=31862 [2018-12-03 15:59:19,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 15:59:19,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-03 15:59:19,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 15:59:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-12-03 15:59:19,124 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2018-12-03 15:59:19,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:19,124 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-12-03 15:59:19,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-12-03 15:59:19,125 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-12-03 15:59:19,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 15:59:19,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:19,125 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2018-12-03 15:59:19,126 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:19,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:19,126 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2018-12-03 15:59:19,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:19,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:19,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:19,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:19,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:20,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:20,741 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:20,741 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:20,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:20,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:20,741 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:20,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:20,750 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:20,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-03 15:59:20,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:20,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:23,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:27,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:27,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 180 [2018-12-03 15:59:27,399 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:27,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-12-03 15:59:27,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-12-03 15:59:27,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14701, Invalid=18241, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 15:59:27,401 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 122 states. [2018-12-03 15:59:27,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:27,809 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-12-03 15:59:27,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 15:59:27,809 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 121 [2018-12-03 15:59:27,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:27,810 INFO L225 Difference]: With dead ends: 125 [2018-12-03 15:59:27,810 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 15:59:27,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14280 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=14701, Invalid=18241, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 15:59:27,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 15:59:27,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 15:59:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 15:59:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-12-03 15:59:27,816 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2018-12-03 15:59:27,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:27,816 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-12-03 15:59:27,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-12-03 15:59:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-12-03 15:59:27,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 15:59:27,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:27,817 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2018-12-03 15:59:27,818 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:27,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:27,818 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2018-12-03 15:59:27,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:27,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:27,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:27,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:27,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:29,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:29,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:29,456 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:29,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:29,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:29,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:29,465 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:29,465 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:29,499 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:29,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:29,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:31,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:36,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:36,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 183 [2018-12-03 15:59:36,163 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:36,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-12-03 15:59:36,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-12-03 15:59:36,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15190, Invalid=18850, Unknown=0, NotChecked=0, Total=34040 [2018-12-03 15:59:36,165 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 124 states. [2018-12-03 15:59:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:36,439 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-12-03 15:59:36,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 15:59:36,440 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 123 [2018-12-03 15:59:36,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:36,441 INFO L225 Difference]: With dead ends: 127 [2018-12-03 15:59:36,441 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 15:59:36,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14762 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=15190, Invalid=18850, Unknown=0, NotChecked=0, Total=34040 [2018-12-03 15:59:36,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 15:59:36,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-12-03 15:59:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 15:59:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-12-03 15:59:36,445 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2018-12-03 15:59:36,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:36,445 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-12-03 15:59:36,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-12-03 15:59:36,445 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-12-03 15:59:36,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 15:59:36,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:36,446 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2018-12-03 15:59:36,446 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:36,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:36,446 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2018-12-03 15:59:36,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:36,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:36,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:36,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:36,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:39,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:39,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:39,170 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:39,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:39,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:39,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:39,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:39,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:39,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:41,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:46,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:46,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 186 [2018-12-03 15:59:46,089 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:46,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-12-03 15:59:46,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-12-03 15:59:46,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15687, Invalid=19469, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 15:59:46,092 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 126 states. [2018-12-03 15:59:46,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:46,381 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-12-03 15:59:46,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 15:59:46,381 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 125 [2018-12-03 15:59:46,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:46,382 INFO L225 Difference]: With dead ends: 129 [2018-12-03 15:59:46,382 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 15:59:46,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15252 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=15687, Invalid=19469, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 15:59:46,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 15:59:46,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-12-03 15:59:46,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 15:59:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-12-03 15:59:46,386 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2018-12-03 15:59:46,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:46,387 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-12-03 15:59:46,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-12-03 15:59:46,387 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-12-03 15:59:46,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 15:59:46,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:46,387 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2018-12-03 15:59:46,388 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:46,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:46,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2018-12-03 15:59:46,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:46,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:46,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:46,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:46,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:49,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:49,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:49,004 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:49,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:49,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:49,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:49,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:49,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:49,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-03 15:59:49,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:49,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:51,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:56,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:56,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 189 [2018-12-03 15:59:56,234 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:56,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-12-03 15:59:56,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-12-03 15:59:56,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16192, Invalid=20098, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 15:59:56,237 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 128 states. [2018-12-03 15:59:56,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:56,549 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-12-03 15:59:56,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 15:59:56,549 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 127 [2018-12-03 15:59:56,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:56,550 INFO L225 Difference]: With dead ends: 131 [2018-12-03 15:59:56,550 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 15:59:56,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15750 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=16192, Invalid=20098, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 15:59:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 15:59:56,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 15:59:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 15:59:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-12-03 15:59:56,555 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2018-12-03 15:59:56,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:56,555 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-12-03 15:59:56,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-12-03 15:59:56,555 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-12-03 15:59:56,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 15:59:56,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:56,555 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2018-12-03 15:59:56,556 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:56,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:56,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2018-12-03 15:59:56,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:56,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:56,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:56,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:56,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:58,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:58,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:58,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:58,553 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:58,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:58,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:58,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:58,564 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:58,564 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:58,596 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:58,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:58,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:00,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:05,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:05,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 192 [2018-12-03 16:00:05,858 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:05,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-03 16:00:05,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-03 16:00:05,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16705, Invalid=20737, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:00:05,861 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 130 states. [2018-12-03 16:00:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:06,221 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-12-03 16:00:06,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:00:06,221 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 129 [2018-12-03 16:00:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:06,222 INFO L225 Difference]: With dead ends: 133 [2018-12-03 16:00:06,222 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 16:00:06,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16256 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=16705, Invalid=20737, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:00:06,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 16:00:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 16:00:06,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 16:00:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-12-03 16:00:06,228 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2018-12-03 16:00:06,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:06,228 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-12-03 16:00:06,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-03 16:00:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-12-03 16:00:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 16:00:06,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:06,229 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2018-12-03 16:00:06,229 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:06,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:06,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2018-12-03 16:00:06,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:06,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:06,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:06,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:06,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:08,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:08,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:08,095 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:08,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:08,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:08,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:08,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:08,105 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:08,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:10,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:15,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:15,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:15,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 195 [2018-12-03 16:00:15,951 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:15,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-12-03 16:00:15,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-12-03 16:00:15,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17226, Invalid=21386, Unknown=0, NotChecked=0, Total=38612 [2018-12-03 16:00:15,955 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 132 states. [2018-12-03 16:00:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:16,244 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-12-03 16:00:16,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:00:16,245 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 131 [2018-12-03 16:00:16,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:16,245 INFO L225 Difference]: With dead ends: 135 [2018-12-03 16:00:16,245 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 16:00:16,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16770 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=17226, Invalid=21386, Unknown=0, NotChecked=0, Total=38612 [2018-12-03 16:00:16,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 16:00:16,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-03 16:00:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 16:00:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-12-03 16:00:16,250 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2018-12-03 16:00:16,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:16,251 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-12-03 16:00:16,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-12-03 16:00:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-12-03 16:00:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-03 16:00:16,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:16,251 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2018-12-03 16:00:16,252 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:16,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:16,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2018-12-03 16:00:16,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:16,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:16,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:16,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:16,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:18,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:18,322 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:18,322 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:18,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:18,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:18,322 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:18,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:18,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:18,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-03 16:00:18,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:18,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:22,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:28,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:28,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 198 [2018-12-03 16:00:28,337 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:28,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-03 16:00:28,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-03 16:00:28,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17755, Invalid=22045, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:00:28,340 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 134 states. [2018-12-03 16:00:28,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:28,672 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-12-03 16:00:28,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:00:28,672 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 133 [2018-12-03 16:00:28,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:28,673 INFO L225 Difference]: With dead ends: 137 [2018-12-03 16:00:28,673 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 16:00:28,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17292 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=17755, Invalid=22045, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:00:28,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 16:00:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-03 16:00:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 16:00:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-12-03 16:00:28,680 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2018-12-03 16:00:28,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:28,680 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-12-03 16:00:28,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-03 16:00:28,680 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-12-03 16:00:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 16:00:28,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:28,681 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2018-12-03 16:00:28,681 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:28,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:28,681 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2018-12-03 16:00:28,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:28,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:28,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:28,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:28,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:30,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:30,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:30,915 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:30,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:30,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:30,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:30,925 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:30,925 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:30,963 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:30,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:30,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:33,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:38,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:38,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 201 [2018-12-03 16:00:38,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:38,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-12-03 16:00:38,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-12-03 16:00:38,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18292, Invalid=22714, Unknown=0, NotChecked=0, Total=41006 [2018-12-03 16:00:38,966 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 136 states. [2018-12-03 16:00:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:39,457 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-12-03 16:00:39,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:00:39,458 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 135 [2018-12-03 16:00:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:39,459 INFO L225 Difference]: With dead ends: 139 [2018-12-03 16:00:39,459 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 16:00:39,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17822 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=18292, Invalid=22714, Unknown=0, NotChecked=0, Total=41006 [2018-12-03 16:00:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 16:00:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-03 16:00:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 16:00:39,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-12-03 16:00:39,463 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2018-12-03 16:00:39,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:39,463 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-12-03 16:00:39,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-12-03 16:00:39,463 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-12-03 16:00:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 16:00:39,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:39,464 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2018-12-03 16:00:39,464 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:39,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:39,464 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2018-12-03 16:00:39,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:39,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:39,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:39,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:39,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:41,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:41,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:41,479 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:41,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:41,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:41,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:41,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:41,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:41,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:44,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:49,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:49,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 204 [2018-12-03 16:00:49,962 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:49,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-12-03 16:00:49,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-12-03 16:00:49,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18837, Invalid=23393, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:00:49,965 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 138 states. [2018-12-03 16:00:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:50,312 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-12-03 16:00:50,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:00:50,312 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 137 [2018-12-03 16:00:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:50,313 INFO L225 Difference]: With dead ends: 141 [2018-12-03 16:00:50,313 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 16:00:50,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18360 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=18837, Invalid=23393, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:00:50,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 16:00:50,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 16:00:50,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 16:00:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-12-03 16:00:50,318 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2018-12-03 16:00:50,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:50,319 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-12-03 16:00:50,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-12-03 16:00:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-12-03 16:00:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 16:00:50,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:50,319 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 1, 1] [2018-12-03 16:00:50,320 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:50,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:50,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1829081960, now seen corresponding path program 68 times [2018-12-03 16:00:50,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:50,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:50,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:50,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:50,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:52,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:52,377 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:52,377 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:52,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:52,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:52,377 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:52,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:52,385 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:52,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-12-03 16:00:52,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:52,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:55,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:01,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:01,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 207 [2018-12-03 16:01:01,050 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:01,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-12-03 16:01:01,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-12-03 16:01:01,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19390, Invalid=24082, Unknown=0, NotChecked=0, Total=43472 [2018-12-03 16:01:01,052 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 140 states. [2018-12-03 16:01:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:01,373 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-12-03 16:01:01,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:01:01,373 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 139 [2018-12-03 16:01:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:01,374 INFO L225 Difference]: With dead ends: 143 [2018-12-03 16:01:01,374 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 16:01:01,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18906 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=19390, Invalid=24082, Unknown=0, NotChecked=0, Total=43472 [2018-12-03 16:01:01,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 16:01:01,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-03 16:01:01,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 16:01:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-12-03 16:01:01,380 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2018-12-03 16:01:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:01,380 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-12-03 16:01:01,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-12-03 16:01:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-12-03 16:01:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 16:01:01,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:01,381 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 1, 1] [2018-12-03 16:01:01,381 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:01,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:01,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1106140586, now seen corresponding path program 69 times [2018-12-03 16:01:01,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:01,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:01,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:01,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:01,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:03,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:03,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:03,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:03,563 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:03,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:03,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:03,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:03,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:03,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:03,611 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:03,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:03,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:06,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:06,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:12,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:12,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 210 [2018-12-03 16:01:12,312 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:12,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-03 16:01:12,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-03 16:01:12,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19951, Invalid=24781, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:01:12,315 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 142 states. [2018-12-03 16:01:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:12,718 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-12-03 16:01:12,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:01:12,719 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 141 [2018-12-03 16:01:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:12,719 INFO L225 Difference]: With dead ends: 145 [2018-12-03 16:01:12,720 INFO L226 Difference]: Without dead ends: 144 [2018-12-03 16:01:12,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19460 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=19951, Invalid=24781, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:01:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-03 16:01:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-12-03 16:01:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 16:01:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-12-03 16:01:12,725 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2018-12-03 16:01:12,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:12,725 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-12-03 16:01:12,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-03 16:01:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-12-03 16:01:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 16:01:12,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:12,726 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 1, 1] [2018-12-03 16:01:12,726 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:12,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:12,727 INFO L82 PathProgramCache]: Analyzing trace with hash 2144182124, now seen corresponding path program 70 times [2018-12-03 16:01:12,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:12,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:12,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:12,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:12,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:15,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:15,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:15,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:15,044 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:15,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:15,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:15,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:15,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:15,056 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:15,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:17,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:24,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:24,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 213 [2018-12-03 16:01:24,189 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:24,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-12-03 16:01:24,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-12-03 16:01:24,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20520, Invalid=25490, Unknown=0, NotChecked=0, Total=46010 [2018-12-03 16:01:24,193 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 144 states. [2018-12-03 16:01:24,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:24,623 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-12-03 16:01:24,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:01:24,623 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 143 [2018-12-03 16:01:24,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:24,624 INFO L225 Difference]: With dead ends: 147 [2018-12-03 16:01:24,625 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 16:01:24,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20022 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=20520, Invalid=25490, Unknown=0, NotChecked=0, Total=46010 [2018-12-03 16:01:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 16:01:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-03 16:01:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 16:01:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-12-03 16:01:24,631 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2018-12-03 16:01:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:24,631 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-12-03 16:01:24,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-12-03 16:01:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-12-03 16:01:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 16:01:24,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:24,632 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 1, 1] [2018-12-03 16:01:24,632 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:24,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:24,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1025279826, now seen corresponding path program 71 times [2018-12-03 16:01:24,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:24,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:24,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:24,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:24,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:27,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:27,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:27,143 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:27,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:27,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:27,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:27,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:27,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:27,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2018-12-03 16:01:27,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:27,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:30,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:36,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:36,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 216 [2018-12-03 16:01:36,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:36,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-12-03 16:01:36,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-12-03 16:01:36,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21097, Invalid=26209, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 16:01:36,758 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 146 states. [2018-12-03 16:01:37,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:37,195 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-12-03 16:01:37,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:01:37,196 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 145 [2018-12-03 16:01:37,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:37,197 INFO L225 Difference]: With dead ends: 149 [2018-12-03 16:01:37,197 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 16:01:37,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20592 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=21097, Invalid=26209, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 16:01:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 16:01:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-12-03 16:01:37,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 16:01:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-12-03 16:01:37,204 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2018-12-03 16:01:37,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:37,204 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-12-03 16:01:37,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-12-03 16:01:37,204 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-12-03 16:01:37,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 16:01:37,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:37,205 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 1, 1] [2018-12-03 16:01:37,205 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:37,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:37,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1746400912, now seen corresponding path program 72 times [2018-12-03 16:01:37,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:37,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:37,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:37,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:37,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:39,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:39,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:39,429 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:39,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:39,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:39,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:39,437 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:39,438 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:39,474 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:39,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:39,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:42,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:42,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:49,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:49,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 219 [2018-12-03 16:01:49,012 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:49,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-12-03 16:01:49,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-12-03 16:01:49,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21682, Invalid=26938, Unknown=0, NotChecked=0, Total=48620 [2018-12-03 16:01:49,015 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 148 states. [2018-12-03 16:01:49,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:49,402 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-12-03 16:01:49,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:01:49,402 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 147 [2018-12-03 16:01:49,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:49,404 INFO L225 Difference]: With dead ends: 151 [2018-12-03 16:01:49,404 INFO L226 Difference]: Without dead ends: 150 [2018-12-03 16:01:49,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21170 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=21682, Invalid=26938, Unknown=0, NotChecked=0, Total=48620 [2018-12-03 16:01:49,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-03 16:01:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-12-03 16:01:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 16:01:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-12-03 16:01:49,410 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2018-12-03 16:01:49,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:49,411 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-12-03 16:01:49,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-12-03 16:01:49,411 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-12-03 16:01:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 16:01:49,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:49,412 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 1, 1] [2018-12-03 16:01:49,412 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:49,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:49,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1040937394, now seen corresponding path program 73 times [2018-12-03 16:01:49,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:49,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:49,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:49,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:49,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:51,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:51,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:51,997 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:51,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:51,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:51,998 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:52,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:52,006 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:52,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:54,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:01,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:01,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 222 [2018-12-03 16:02:01,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:01,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-12-03 16:02:01,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-12-03 16:02:01,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22275, Invalid=27677, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 16:02:01,758 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 150 states. [2018-12-03 16:02:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:02,141 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-12-03 16:02:02,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:02:02,141 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 149 [2018-12-03 16:02:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:02,143 INFO L225 Difference]: With dead ends: 153 [2018-12-03 16:02:02,143 INFO L226 Difference]: Without dead ends: 152 [2018-12-03 16:02:02,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21756 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=22275, Invalid=27677, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 16:02:02,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-03 16:02:02,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-12-03 16:02:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 16:02:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-12-03 16:02:02,149 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2018-12-03 16:02:02,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:02,150 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-12-03 16:02:02,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-12-03 16:02:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-12-03 16:02:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 16:02:02,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:02,151 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 1, 1] [2018-12-03 16:02:02,151 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:02,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:02,151 INFO L82 PathProgramCache]: Analyzing trace with hash -386543244, now seen corresponding path program 74 times [2018-12-03 16:02:02,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:02,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:02,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:02,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:02,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:04,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:04,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:04,478 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:04,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:04,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:04,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:04,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:02:04,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:02:04,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2018-12-03 16:02:04,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:04,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:07,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:14,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:14,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 225 [2018-12-03 16:02:14,542 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:14,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-12-03 16:02:14,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-12-03 16:02:14,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22876, Invalid=28426, Unknown=0, NotChecked=0, Total=51302 [2018-12-03 16:02:14,544 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 152 states. [2018-12-03 16:02:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:14,937 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-12-03 16:02:14,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:02:14,937 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 151 [2018-12-03 16:02:14,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:14,938 INFO L225 Difference]: With dead ends: 155 [2018-12-03 16:02:14,938 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 16:02:14,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22350 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=22876, Invalid=28426, Unknown=0, NotChecked=0, Total=51302 [2018-12-03 16:02:14,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 16:02:14,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-12-03 16:02:14,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 16:02:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-12-03 16:02:14,943 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2018-12-03 16:02:14,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:14,944 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-12-03 16:02:14,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-12-03 16:02:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-12-03 16:02:14,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 16:02:14,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:14,944 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 1, 1] [2018-12-03 16:02:14,945 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:14,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:14,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2100868938, now seen corresponding path program 75 times [2018-12-03 16:02:14,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:14,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:14,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:14,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:14,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:17,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:17,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:17,449 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:17,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:17,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:17,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:17,457 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:17,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:17,498 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:17,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:17,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:20,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:20,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:27,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:27,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 228 [2018-12-03 16:02:27,162 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:27,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-12-03 16:02:27,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-12-03 16:02:27,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23485, Invalid=29185, Unknown=0, NotChecked=0, Total=52670 [2018-12-03 16:02:27,165 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 154 states. [2018-12-03 16:02:27,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:27,603 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-12-03 16:02:27,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 16:02:27,603 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 153 [2018-12-03 16:02:27,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:27,604 INFO L225 Difference]: With dead ends: 157 [2018-12-03 16:02:27,604 INFO L226 Difference]: Without dead ends: 156 [2018-12-03 16:02:27,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22952 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=23485, Invalid=29185, Unknown=0, NotChecked=0, Total=52670 [2018-12-03 16:02:27,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-03 16:02:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-12-03 16:02:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 16:02:27,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-12-03 16:02:27,608 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2018-12-03 16:02:27,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:27,609 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-12-03 16:02:27,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-12-03 16:02:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-12-03 16:02:27,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 16:02:27,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:27,609 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 1, 1] [2018-12-03 16:02:27,610 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:27,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:27,610 INFO L82 PathProgramCache]: Analyzing trace with hash -300419208, now seen corresponding path program 76 times [2018-12-03 16:02:27,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:27,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:27,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:27,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:27,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:30,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:30,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:30,039 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:30,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:30,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:30,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:30,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:30,048 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:02:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:30,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:33,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:40,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:40,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 231 [2018-12-03 16:02:40,100 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:40,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-12-03 16:02:40,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-12-03 16:02:40,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24102, Invalid=29954, Unknown=0, NotChecked=0, Total=54056 [2018-12-03 16:02:40,103 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 156 states. [2018-12-03 16:02:40,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:40,464 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-12-03 16:02:40,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:02:40,465 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 155 [2018-12-03 16:02:40,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:40,466 INFO L225 Difference]: With dead ends: 159 [2018-12-03 16:02:40,466 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 16:02:40,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23562 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=24102, Invalid=29954, Unknown=0, NotChecked=0, Total=54056 [2018-12-03 16:02:40,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 16:02:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-12-03 16:02:40,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 16:02:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-12-03 16:02:40,471 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2018-12-03 16:02:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:40,471 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-12-03 16:02:40,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-12-03 16:02:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-12-03 16:02:40,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 16:02:40,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:40,472 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 1, 1] [2018-12-03 16:02:40,472 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:40,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:40,472 INFO L82 PathProgramCache]: Analyzing trace with hash -940048966, now seen corresponding path program 77 times [2018-12-03 16:02:40,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:40,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:40,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:40,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:40,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:43,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:43,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:43,021 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:43,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:43,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:43,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:43,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:02:43,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:02:43,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2018-12-03 16:02:43,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:43,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:46,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:53,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:53,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 234 [2018-12-03 16:02:53,310 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:53,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-12-03 16:02:53,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-12-03 16:02:53,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24727, Invalid=30733, Unknown=0, NotChecked=0, Total=55460 [2018-12-03 16:02:53,313 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 158 states. [2018-12-03 16:02:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:53,728 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-12-03 16:02:53,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:02:53,728 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 157 [2018-12-03 16:02:53,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:53,729 INFO L225 Difference]: With dead ends: 161 [2018-12-03 16:02:53,729 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 16:02:53,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24180 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=24727, Invalid=30733, Unknown=0, NotChecked=0, Total=55460 [2018-12-03 16:02:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 16:02:53,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-12-03 16:02:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 16:02:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-12-03 16:02:53,735 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2018-12-03 16:02:53,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:53,736 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-12-03 16:02:53,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-12-03 16:02:53,736 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-12-03 16:02:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 16:02:53,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:53,737 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 1, 1] [2018-12-03 16:02:53,737 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:53,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:53,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1443923076, now seen corresponding path program 78 times [2018-12-03 16:02:53,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:53,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:53,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:53,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:53,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:56,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:56,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:56,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:56,316 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:56,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:56,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:56,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:56,325 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:56,325 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:56,368 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:56,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:56,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:59,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:06,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:06,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 237 [2018-12-03 16:03:06,887 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:06,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-12-03 16:03:06,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-12-03 16:03:06,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25360, Invalid=31522, Unknown=0, NotChecked=0, Total=56882 [2018-12-03 16:03:06,890 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 160 states. [2018-12-03 16:03:07,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:07,336 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-12-03 16:03:07,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:03:07,336 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 159 [2018-12-03 16:03:07,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:07,337 INFO L225 Difference]: With dead ends: 163 [2018-12-03 16:03:07,337 INFO L226 Difference]: Without dead ends: 162 [2018-12-03 16:03:07,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24806 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=25360, Invalid=31522, Unknown=0, NotChecked=0, Total=56882 [2018-12-03 16:03:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-03 16:03:07,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-12-03 16:03:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 16:03:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-12-03 16:03:07,344 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2018-12-03 16:03:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:07,344 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-12-03 16:03:07,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-12-03 16:03:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-12-03 16:03:07,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-03 16:03:07,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:07,346 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 1, 1] [2018-12-03 16:03:07,346 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:07,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:07,346 INFO L82 PathProgramCache]: Analyzing trace with hash -335638338, now seen corresponding path program 79 times [2018-12-03 16:03:07,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:07,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:07,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:07,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:07,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:10,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:10,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:10,151 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:10,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:10,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:10,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:10,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:10,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:03:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:10,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:13,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:20,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:20,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 240 [2018-12-03 16:03:20,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:20,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-12-03 16:03:20,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-12-03 16:03:20,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26001, Invalid=32321, Unknown=0, NotChecked=0, Total=58322 [2018-12-03 16:03:20,846 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 162 states. [2018-12-03 16:03:21,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:21,246 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-12-03 16:03:21,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 16:03:21,246 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 161 [2018-12-03 16:03:21,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:21,247 INFO L225 Difference]: With dead ends: 165 [2018-12-03 16:03:21,247 INFO L226 Difference]: Without dead ends: 164 [2018-12-03 16:03:21,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25440 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=26001, Invalid=32321, Unknown=0, NotChecked=0, Total=58322 [2018-12-03 16:03:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-03 16:03:21,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-12-03 16:03:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 16:03:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-12-03 16:03:21,255 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2018-12-03 16:03:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:21,255 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-12-03 16:03:21,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-12-03 16:03:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-12-03 16:03:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 16:03:21,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:21,256 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 1, 1] [2018-12-03 16:03:21,256 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:21,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:21,257 INFO L82 PathProgramCache]: Analyzing trace with hash -425894528, now seen corresponding path program 80 times [2018-12-03 16:03:21,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:21,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:21,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:21,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:21,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:24,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:24,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:24,069 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:24,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:24,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:24,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:24,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:03:24,080 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:03:24,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2018-12-03 16:03:24,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:24,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:27,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:27,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:35,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:35,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 243 [2018-12-03 16:03:35,200 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:35,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-12-03 16:03:35,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-12-03 16:03:35,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26650, Invalid=33130, Unknown=0, NotChecked=0, Total=59780 [2018-12-03 16:03:35,204 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 164 states. [2018-12-03 16:03:35,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:35,586 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-12-03 16:03:35,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 16:03:35,586 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 163 [2018-12-03 16:03:35,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:35,587 INFO L225 Difference]: With dead ends: 167 [2018-12-03 16:03:35,587 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 16:03:35,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26082 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=26650, Invalid=33130, Unknown=0, NotChecked=0, Total=59780 [2018-12-03 16:03:35,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 16:03:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-12-03 16:03:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 16:03:35,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-12-03 16:03:35,592 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2018-12-03 16:03:35,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:35,592 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-12-03 16:03:35,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-12-03 16:03:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-12-03 16:03:35,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-03 16:03:35,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:35,593 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 1, 1] [2018-12-03 16:03:35,593 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:35,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:35,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1262747198, now seen corresponding path program 81 times [2018-12-03 16:03:35,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:35,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:35,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:35,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:35,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:38,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:38,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:38,515 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:38,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:38,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:38,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:38,523 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:03:38,523 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:03:38,566 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:03:38,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:38,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:42,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:49,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:49,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 246 [2018-12-03 16:03:49,793 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:49,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-12-03 16:03:49,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-12-03 16:03:49,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27307, Invalid=33949, Unknown=0, NotChecked=0, Total=61256 [2018-12-03 16:03:49,796 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 166 states. [2018-12-03 16:03:50,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:50,240 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-12-03 16:03:50,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 16:03:50,241 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 165 [2018-12-03 16:03:50,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:50,242 INFO L225 Difference]: With dead ends: 169 [2018-12-03 16:03:50,242 INFO L226 Difference]: Without dead ends: 168 [2018-12-03 16:03:50,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26732 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=27307, Invalid=33949, Unknown=0, NotChecked=0, Total=61256 [2018-12-03 16:03:50,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-03 16:03:50,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-12-03 16:03:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 16:03:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-12-03 16:03:50,248 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2018-12-03 16:03:50,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:50,248 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-12-03 16:03:50,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-12-03 16:03:50,248 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-12-03 16:03:50,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 16:03:50,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:50,249 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 1, 1] [2018-12-03 16:03:50,249 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:50,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:50,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1975688580, now seen corresponding path program 82 times [2018-12-03 16:03:50,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:50,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:50,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:50,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:50,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:53,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:53,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:53,040 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:53,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:53,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:53,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:53,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:53,051 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:03:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:53,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:56,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:04,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:04,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:04,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 249 [2018-12-03 16:04:04,521 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:04,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-12-03 16:04:04,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-12-03 16:04:04,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27972, Invalid=34778, Unknown=0, NotChecked=0, Total=62750 [2018-12-03 16:04:04,524 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 168 states. [2018-12-03 16:04:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:05,196 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-12-03 16:04:05,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 16:04:05,196 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 167 [2018-12-03 16:04:05,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:05,197 INFO L225 Difference]: With dead ends: 171 [2018-12-03 16:04:05,197 INFO L226 Difference]: Without dead ends: 170 [2018-12-03 16:04:05,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27390 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=27972, Invalid=34778, Unknown=0, NotChecked=0, Total=62750 [2018-12-03 16:04:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-03 16:04:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-12-03 16:04:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-03 16:04:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-12-03 16:04:05,202 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2018-12-03 16:04:05,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:05,202 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-12-03 16:04:05,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-12-03 16:04:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-12-03 16:04:05,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 16:04:05,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:05,203 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 1, 1] [2018-12-03 16:04:05,203 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:05,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:05,204 INFO L82 PathProgramCache]: Analyzing trace with hash 261181638, now seen corresponding path program 83 times [2018-12-03 16:04:05,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:05,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:05,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:05,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:05,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:08,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:08,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:08,065 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:08,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:08,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:08,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:08,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:04:08,091 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:04:08,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2018-12-03 16:04:08,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:08,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:11,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:19,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:19,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 252 [2018-12-03 16:04:19,855 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:19,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-12-03 16:04:19,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-12-03 16:04:19,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28645, Invalid=35617, Unknown=0, NotChecked=0, Total=64262 [2018-12-03 16:04:19,859 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 170 states. [2018-12-03 16:04:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:20,281 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-12-03 16:04:20,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 16:04:20,281 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 169 [2018-12-03 16:04:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:20,282 INFO L225 Difference]: With dead ends: 173 [2018-12-03 16:04:20,282 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 16:04:20,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28056 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=28645, Invalid=35617, Unknown=0, NotChecked=0, Total=64262 [2018-12-03 16:04:20,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 16:04:20,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-12-03 16:04:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 16:04:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-12-03 16:04:20,287 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2018-12-03 16:04:20,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:20,288 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-12-03 16:04:20,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-12-03 16:04:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-12-03 16:04:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 16:04:20,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:20,288 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 1, 1] [2018-12-03 16:04:20,289 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:20,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:20,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1887452040, now seen corresponding path program 84 times [2018-12-03 16:04:20,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:20,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:20,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:20,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:20,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:23,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:23,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:23,225 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:23,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:23,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:23,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:23,235 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:04:23,235 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:04:23,282 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:04:23,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:23,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:26,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:35,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:35,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 255 [2018-12-03 16:04:35,202 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:35,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-12-03 16:04:35,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-12-03 16:04:35,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29326, Invalid=36466, Unknown=0, NotChecked=0, Total=65792 [2018-12-03 16:04:35,206 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 172 states. [2018-12-03 16:04:35,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:35,636 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-12-03 16:04:35,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 16:04:35,636 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 171 [2018-12-03 16:04:35,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:35,637 INFO L225 Difference]: With dead ends: 175 [2018-12-03 16:04:35,637 INFO L226 Difference]: Without dead ends: 174 [2018-12-03 16:04:35,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28730 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=29326, Invalid=36466, Unknown=0, NotChecked=0, Total=65792 [2018-12-03 16:04:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-03 16:04:35,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-12-03 16:04:35,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 16:04:35,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-12-03 16:04:35,643 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2018-12-03 16:04:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:35,644 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-12-03 16:04:35,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-12-03 16:04:35,644 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-12-03 16:04:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-03 16:04:35,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:35,645 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 1, 1] [2018-12-03 16:04:35,648 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:35,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:35,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1365212618, now seen corresponding path program 85 times [2018-12-03 16:04:35,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:35,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:35,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:35,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:35,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:38,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:38,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:38,650 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:38,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:38,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:38,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:38,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:38,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:04:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:38,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:42,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:50,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:50,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 258 [2018-12-03 16:04:50,877 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:50,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-12-03 16:04:50,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-12-03 16:04:50,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30015, Invalid=37325, Unknown=0, NotChecked=0, Total=67340 [2018-12-03 16:04:50,880 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 174 states. [2018-12-03 16:04:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:51,325 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-12-03 16:04:51,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 16:04:51,326 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 173 [2018-12-03 16:04:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:51,327 INFO L225 Difference]: With dead ends: 177 [2018-12-03 16:04:51,327 INFO L226 Difference]: Without dead ends: 176 [2018-12-03 16:04:51,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29412 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=30015, Invalid=37325, Unknown=0, NotChecked=0, Total=67340 [2018-12-03 16:04:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-03 16:04:51,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-12-03 16:04:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-03 16:04:51,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-12-03 16:04:51,334 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2018-12-03 16:04:51,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:51,334 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-12-03 16:04:51,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-12-03 16:04:51,334 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-12-03 16:04:51,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 16:04:51,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:51,335 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 1, 1] [2018-12-03 16:04:51,336 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:51,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:51,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2004301708, now seen corresponding path program 86 times [2018-12-03 16:04:51,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:51,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:51,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:51,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:51,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:54,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:54,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:54,395 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:54,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:54,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:54,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:54,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:04:54,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:04:54,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2018-12-03 16:04:54,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:54,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:58,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:58,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:06,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:06,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 261 [2018-12-03 16:05:06,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:06,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-12-03 16:05:06,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-12-03 16:05:06,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30712, Invalid=38194, Unknown=0, NotChecked=0, Total=68906 [2018-12-03 16:05:06,939 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 176 states. [2018-12-03 16:05:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:07,421 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-12-03 16:05:07,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 16:05:07,421 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 175 [2018-12-03 16:05:07,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:07,422 INFO L225 Difference]: With dead ends: 179 [2018-12-03 16:05:07,422 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 16:05:07,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30102 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=30712, Invalid=38194, Unknown=0, NotChecked=0, Total=68906 [2018-12-03 16:05:07,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 16:05:07,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-12-03 16:05:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 16:05:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-12-03 16:05:07,428 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2018-12-03 16:05:07,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:07,428 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-12-03 16:05:07,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-12-03 16:05:07,429 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-12-03 16:05:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-03 16:05:07,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:07,429 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 1, 1] [2018-12-03 16:05:07,429 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:07,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:07,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1988593870, now seen corresponding path program 87 times [2018-12-03 16:05:07,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:07,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:07,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:07,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:07,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:10,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:10,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:10,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:10,541 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:10,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:10,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:10,542 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:10,570 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:05:10,571 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:05:10,618 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:05:10,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:10,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:14,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:23,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:23,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 264 [2018-12-03 16:05:23,446 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:23,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-12-03 16:05:23,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-12-03 16:05:23,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31417, Invalid=39073, Unknown=0, NotChecked=0, Total=70490 [2018-12-03 16:05:23,450 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 178 states. [2018-12-03 16:05:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:23,938 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-12-03 16:05:23,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 16:05:23,938 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 177 [2018-12-03 16:05:23,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:23,939 INFO L225 Difference]: With dead ends: 181 [2018-12-03 16:05:23,939 INFO L226 Difference]: Without dead ends: 180 [2018-12-03 16:05:23,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30800 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=31417, Invalid=39073, Unknown=0, NotChecked=0, Total=70490 [2018-12-03 16:05:23,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-03 16:05:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-12-03 16:05:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 16:05:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-12-03 16:05:23,944 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2018-12-03 16:05:23,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:23,944 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-12-03 16:05:23,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-12-03 16:05:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-12-03 16:05:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-03 16:05:23,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:23,945 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 1, 1] [2018-12-03 16:05:23,945 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:23,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:23,946 INFO L82 PathProgramCache]: Analyzing trace with hash -221736560, now seen corresponding path program 88 times [2018-12-03 16:05:23,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:23,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:23,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:23,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:23,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:27,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:27,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:27,194 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:27,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:27,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:27,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:27,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:27,202 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:05:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:27,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:31,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:31,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:40,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:40,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 267 [2018-12-03 16:05:40,189 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:40,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-12-03 16:05:40,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-12-03 16:05:40,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32130, Invalid=39962, Unknown=0, NotChecked=0, Total=72092 [2018-12-03 16:05:40,193 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 180 states. [2018-12-03 16:05:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:40,715 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-12-03 16:05:40,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 16:05:40,715 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 179 [2018-12-03 16:05:40,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:40,716 INFO L225 Difference]: With dead ends: 183 [2018-12-03 16:05:40,716 INFO L226 Difference]: Without dead ends: 182 [2018-12-03 16:05:40,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31506 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=32130, Invalid=39962, Unknown=0, NotChecked=0, Total=72092 [2018-12-03 16:05:40,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-03 16:05:40,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-12-03 16:05:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 16:05:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-12-03 16:05:40,722 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2018-12-03 16:05:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:40,722 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-12-03 16:05:40,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-12-03 16:05:40,722 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-12-03 16:05:40,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-03 16:05:40,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:40,723 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 1, 1] [2018-12-03 16:05:40,723 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:40,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:40,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1659531730, now seen corresponding path program 89 times [2018-12-03 16:05:40,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:40,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:40,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:40,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:40,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:44,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:44,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:44,007 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:44,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:44,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:44,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:44,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:05:44,016 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:05:44,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2018-12-03 16:05:44,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:44,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:48,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:57,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:57,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 270 [2018-12-03 16:05:57,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:57,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-12-03 16:05:57,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-12-03 16:05:57,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32851, Invalid=40861, Unknown=0, NotChecked=0, Total=73712 [2018-12-03 16:05:57,310 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 182 states. [2018-12-03 16:05:57,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:57,765 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-12-03 16:05:57,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 16:05:57,765 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 181 [2018-12-03 16:05:57,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:57,767 INFO L225 Difference]: With dead ends: 185 [2018-12-03 16:05:57,767 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 16:05:57,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32220 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=32851, Invalid=40861, Unknown=0, NotChecked=0, Total=73712 [2018-12-03 16:05:57,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 16:05:57,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-12-03 16:05:57,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 16:05:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-12-03 16:05:57,772 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2018-12-03 16:05:57,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:57,772 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-12-03 16:05:57,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-12-03 16:05:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-12-03 16:05:57,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-03 16:05:57,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:57,773 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 1, 1] [2018-12-03 16:05:57,773 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:57,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:57,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1377126804, now seen corresponding path program 90 times [2018-12-03 16:05:57,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:57,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:57,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:57,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:57,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:01,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:01,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:01,062 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:01,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:01,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:01,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:01,070 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:06:01,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:06:01,119 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:06:01,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:01,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:05,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:14,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:14,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 273 [2018-12-03 16:06:14,547 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:14,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-12-03 16:06:14,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-12-03 16:06:14,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33580, Invalid=41770, Unknown=0, NotChecked=0, Total=75350 [2018-12-03 16:06:14,550 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 184 states. [2018-12-03 16:06:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:15,074 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-12-03 16:06:15,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 16:06:15,075 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 183 [2018-12-03 16:06:15,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:15,075 INFO L225 Difference]: With dead ends: 187 [2018-12-03 16:06:15,075 INFO L226 Difference]: Without dead ends: 186 [2018-12-03 16:06:15,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32942 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=33580, Invalid=41770, Unknown=0, NotChecked=0, Total=75350 [2018-12-03 16:06:15,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-03 16:06:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-12-03 16:06:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-03 16:06:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-12-03 16:06:15,082 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2018-12-03 16:06:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:15,082 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-12-03 16:06:15,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-12-03 16:06:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-12-03 16:06:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-03 16:06:15,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:15,084 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 1, 1] [2018-12-03 16:06:15,084 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:15,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:15,084 INFO L82 PathProgramCache]: Analyzing trace with hash 568932566, now seen corresponding path program 91 times [2018-12-03 16:06:15,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:15,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:15,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:15,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:15,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:18,481 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:18,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:18,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:18,482 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:18,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:18,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:18,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:18,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:18,493 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:06:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:18,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:22,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:32,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:32,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 276 [2018-12-03 16:06:32,236 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:32,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-12-03 16:06:32,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-12-03 16:06:32,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34317, Invalid=42689, Unknown=0, NotChecked=0, Total=77006 [2018-12-03 16:06:32,240 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 186 states. [2018-12-03 16:06:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:32,728 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-12-03 16:06:32,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 16:06:32,729 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 185 [2018-12-03 16:06:32,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:32,730 INFO L225 Difference]: With dead ends: 189 [2018-12-03 16:06:32,730 INFO L226 Difference]: Without dead ends: 188 [2018-12-03 16:06:32,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33672 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=34317, Invalid=42689, Unknown=0, NotChecked=0, Total=77006 [2018-12-03 16:06:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-03 16:06:32,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-12-03 16:06:32,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-03 16:06:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-12-03 16:06:32,737 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2018-12-03 16:06:32,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:32,737 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-12-03 16:06:32,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-12-03 16:06:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-12-03 16:06:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 16:06:32,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:32,738 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 1, 1] [2018-12-03 16:06:32,738 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:32,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:32,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1283350424, now seen corresponding path program 92 times [2018-12-03 16:06:32,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:32,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:32,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:32,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:32,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:36,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:36,215 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:36,215 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:36,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:36,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:36,215 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:36,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:06:36,223 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:06:36,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2018-12-03 16:06:36,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:36,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:40,606 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:40,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:50,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:50,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 279 [2018-12-03 16:06:50,350 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:50,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-12-03 16:06:50,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-12-03 16:06:50,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35062, Invalid=43618, Unknown=0, NotChecked=0, Total=78680 [2018-12-03 16:06:50,354 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 188 states. [2018-12-03 16:06:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:51,003 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-12-03 16:06:51,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 16:06:51,003 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 187 [2018-12-03 16:06:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:51,004 INFO L225 Difference]: With dead ends: 191 [2018-12-03 16:06:51,004 INFO L226 Difference]: Without dead ends: 190 [2018-12-03 16:06:51,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34410 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=35062, Invalid=43618, Unknown=0, NotChecked=0, Total=78680 [2018-12-03 16:06:51,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-03 16:06:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-12-03 16:06:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 16:06:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-12-03 16:06:51,010 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2018-12-03 16:06:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:51,010 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-12-03 16:06:51,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-12-03 16:06:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-12-03 16:06:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-03 16:06:51,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:51,012 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 1, 1] [2018-12-03 16:06:51,012 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:51,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:51,012 INFO L82 PathProgramCache]: Analyzing trace with hash 644144602, now seen corresponding path program 93 times [2018-12-03 16:06:51,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:51,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:51,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:51,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:51,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:54,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:54,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:54,534 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:54,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:54,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:54,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:54,543 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:06:54,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:06:54,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:06:54,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:54,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:58,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:07:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:08,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:07:08,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 282 [2018-12-03 16:07:08,890 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:07:08,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-12-03 16:07:08,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-12-03 16:07:08,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35815, Invalid=44557, Unknown=0, NotChecked=0, Total=80372 [2018-12-03 16:07:08,894 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 190 states. [2018-12-03 16:07:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:07:09,463 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-12-03 16:07:09,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 16:07:09,464 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 189 [2018-12-03 16:07:09,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:07:09,465 INFO L225 Difference]: With dead ends: 193 [2018-12-03 16:07:09,465 INFO L226 Difference]: Without dead ends: 192 [2018-12-03 16:07:09,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35156 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=35815, Invalid=44557, Unknown=0, NotChecked=0, Total=80372 [2018-12-03 16:07:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-03 16:07:09,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-12-03 16:07:09,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-12-03 16:07:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-12-03 16:07:09,470 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2018-12-03 16:07:09,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:07:09,470 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-12-03 16:07:09,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-12-03 16:07:09,470 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-12-03 16:07:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-03 16:07:09,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:07:09,471 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 1, 1] [2018-12-03 16:07:09,471 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:07:09,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:07:09,471 INFO L82 PathProgramCache]: Analyzing trace with hash 547672988, now seen corresponding path program 94 times [2018-12-03 16:07:09,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:07:09,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:09,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:07:09,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:09,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:07:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:13,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:13,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:07:13,054 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:07:13,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:07:13,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:13,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:07:13,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:07:13,066 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:07:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:13,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:07:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:17,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:07:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:27,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:07:27,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 285 [2018-12-03 16:07:27,663 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:07:27,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-12-03 16:07:27,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-12-03 16:07:27,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36576, Invalid=45506, Unknown=0, NotChecked=0, Total=82082 [2018-12-03 16:07:27,667 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 192 states. [2018-12-03 16:07:28,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:07:28,188 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-12-03 16:07:28,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 16:07:28,189 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 191 [2018-12-03 16:07:28,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:07:28,190 INFO L225 Difference]: With dead ends: 195 [2018-12-03 16:07:28,190 INFO L226 Difference]: Without dead ends: 194 [2018-12-03 16:07:28,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35910 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=36576, Invalid=45506, Unknown=0, NotChecked=0, Total=82082 [2018-12-03 16:07:28,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-03 16:07:28,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-12-03 16:07:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 16:07:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-12-03 16:07:28,196 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2018-12-03 16:07:28,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:07:28,196 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-12-03 16:07:28,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-12-03 16:07:28,196 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-12-03 16:07:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-03 16:07:28,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:07:28,197 INFO L402 BasicCegarLoop]: trace histogram [96, 95, 1, 1] [2018-12-03 16:07:28,197 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:07:28,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:07:28,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1967234850, now seen corresponding path program 95 times [2018-12-03 16:07:28,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:07:28,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:28,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:07:28,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:28,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:07:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:31,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:31,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:07:31,887 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:07:31,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:07:31,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:31,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:07:31,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:07:31,898 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:07:32,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2018-12-03 16:07:32,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:07:32,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:07:36,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:36,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:07:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:46,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:07:46,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 288 [2018-12-03 16:07:46,887 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:07:46,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-12-03 16:07:46,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-12-03 16:07:46,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37345, Invalid=46465, Unknown=0, NotChecked=0, Total=83810 [2018-12-03 16:07:46,891 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 194 states. [2018-12-03 16:07:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:07:47,403 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-12-03 16:07:47,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 16:07:47,403 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 193 [2018-12-03 16:07:47,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:07:47,404 INFO L225 Difference]: With dead ends: 197 [2018-12-03 16:07:47,404 INFO L226 Difference]: Without dead ends: 196 [2018-12-03 16:07:47,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36672 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=37345, Invalid=46465, Unknown=0, NotChecked=0, Total=83810 [2018-12-03 16:07:47,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-03 16:07:47,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-12-03 16:07:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 16:07:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-12-03 16:07:47,409 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2018-12-03 16:07:47,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:07:47,410 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-12-03 16:07:47,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-12-03 16:07:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-12-03 16:07:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 16:07:47,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:07:47,411 INFO L402 BasicCegarLoop]: trace histogram [97, 96, 1, 1] [2018-12-03 16:07:47,411 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:07:47,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:07:47,412 INFO L82 PathProgramCache]: Analyzing trace with hash -727079520, now seen corresponding path program 96 times [2018-12-03 16:07:47,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:07:47,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:47,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:07:47,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:47,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:07:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:51,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:51,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:07:51,209 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:07:51,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:07:51,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:51,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:07:51,218 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:07:51,218 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:07:51,271 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:07:51,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:07:51,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:07:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:55,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:08:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:06,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:08:06,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 291 [2018-12-03 16:08:06,552 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:08:06,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-12-03 16:08:06,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-12-03 16:08:06,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38122, Invalid=47434, Unknown=0, NotChecked=0, Total=85556 [2018-12-03 16:08:06,556 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 196 states. [2018-12-03 16:08:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:08:07,137 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-12-03 16:08:07,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 16:08:07,137 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 195 [2018-12-03 16:08:07,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:08:07,138 INFO L225 Difference]: With dead ends: 199 [2018-12-03 16:08:07,138 INFO L226 Difference]: Without dead ends: 198 [2018-12-03 16:08:07,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37442 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=38122, Invalid=47434, Unknown=0, NotChecked=0, Total=85556 [2018-12-03 16:08:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-03 16:08:07,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-12-03 16:08:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-12-03 16:08:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-12-03 16:08:07,143 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2018-12-03 16:08:07,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:08:07,144 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-12-03 16:08:07,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-12-03 16:08:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-12-03 16:08:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-03 16:08:07,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:08:07,145 INFO L402 BasicCegarLoop]: trace histogram [98, 97, 1, 1] [2018-12-03 16:08:07,145 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:08:07,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:08:07,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1356251618, now seen corresponding path program 97 times [2018-12-03 16:08:07,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:08:07,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:07,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:08:07,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:07,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:08:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:10,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:10,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:08:10,975 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:08:10,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:08:10,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:10,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:08:10,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:08:10,984 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:08:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:11,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:08:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:15,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:08:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:26,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:08:26,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 294 [2018-12-03 16:08:26,519 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:08:26,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-12-03 16:08:26,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-12-03 16:08:26,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38907, Invalid=48413, Unknown=0, NotChecked=0, Total=87320 [2018-12-03 16:08:26,522 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 198 states. [2018-12-03 16:08:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:08:27,118 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-12-03 16:08:27,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 16:08:27,119 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 197 [2018-12-03 16:08:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:08:27,119 INFO L225 Difference]: With dead ends: 201 [2018-12-03 16:08:27,119 INFO L226 Difference]: Without dead ends: 200 [2018-12-03 16:08:27,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38220 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=38907, Invalid=48413, Unknown=0, NotChecked=0, Total=87320 [2018-12-03 16:08:27,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-03 16:08:27,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-12-03 16:08:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-03 16:08:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-12-03 16:08:27,124 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2018-12-03 16:08:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:08:27,124 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-12-03 16:08:27,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-12-03 16:08:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-12-03 16:08:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-03 16:08:27,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:08:27,125 INFO L402 BasicCegarLoop]: trace histogram [99, 98, 1, 1] [2018-12-03 16:08:27,125 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:08:27,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:08:27,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1982715300, now seen corresponding path program 98 times [2018-12-03 16:08:27,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:08:27,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:27,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:08:27,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:27,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:08:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:30,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:30,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:08:30,987 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:08:30,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:08:30,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:30,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:08:30,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:08:30,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:08:31,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2018-12-03 16:08:31,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:08:31,121 INFO L273 TraceCheckSpWp]: Computing forward predicates...