java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:39:07,580 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:39:07,582 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:39:07,600 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:39:07,600 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:39:07,601 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:39:07,604 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:39:07,606 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:39:07,608 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:39:07,610 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:39:07,611 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:39:07,612 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:39:07,614 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:39:07,615 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:39:07,619 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:39:07,620 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:39:07,627 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:39:07,629 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:39:07,635 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:39:07,637 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:39:07,639 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:39:07,641 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:39:07,644 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:39:07,645 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:39:07,645 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:39:07,646 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:39:07,647 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:39:07,649 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:39:07,650 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:39:07,653 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:39:07,653 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:39:07,654 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:39:07,654 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:39:07,654 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:39:07,655 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:39:07,657 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:39:07,657 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:39:07,681 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:39:07,681 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:39:07,682 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:39:07,682 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:39:07,682 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:39:07,682 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:39:07,683 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:39:07,683 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:39:07,683 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:39:07,683 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:39:07,684 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:39:07,684 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:39:07,685 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:39:07,685 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:39:07,685 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:39:07,686 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:39:07,686 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:39:07,686 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:39:07,686 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:39:07,686 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:39:07,688 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:39:07,688 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:39:07,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:39:07,689 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:39:07,689 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:39:07,689 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:39:07,689 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:39:07,690 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:39:07,690 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:39:07,690 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:39:07,690 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:39:07,691 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:39:07,691 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:39:07,692 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:39:07,692 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:39:07,692 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:39:07,692 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:39:07,693 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:39:07,693 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:39:07,693 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:39:07,693 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:39:07,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:39:07,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:39:07,765 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:39:07,767 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:39:07,768 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:39:07,768 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl [2018-12-03 16:39:07,769 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2018-12-03 16:39:07,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:39:07,836 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:39:07,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:39:07,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:39:07,837 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:39:07,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:39:07" (1/1) ... [2018-12-03 16:39:07,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:39:07" (1/1) ... [2018-12-03 16:39:07,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:39:07,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:39:07,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:39:07,884 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:39:07,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:39:07" (1/1) ... [2018-12-03 16:39:07,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:39:07" (1/1) ... [2018-12-03 16:39:07,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:39:07" (1/1) ... [2018-12-03 16:39:07,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:39:07" (1/1) ... [2018-12-03 16:39:07,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:39:07" (1/1) ... [2018-12-03 16:39:07,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:39:07" (1/1) ... [2018-12-03 16:39:07,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:39:07" (1/1) ... [2018-12-03 16:39:07,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:39:07,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:39:07,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:39:07,912 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:39:07,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:39:07" (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 16:39:07,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:39:07,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:39:08,203 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:39:08,203 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-03 16:39:08,204 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:39:08 BoogieIcfgContainer [2018-12-03 16:39:08,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:39:08,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:39:08,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:39:08,209 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:39:08,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:39:07" (1/2) ... [2018-12-03 16:39:08,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7692c125 and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:39:08, skipping insertion in model container [2018-12-03 16:39:08,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:39:08" (2/2) ... [2018-12-03 16:39:08,212 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2018-12-03 16:39:08,223 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:39:08,231 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:39:08,249 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:39:08,284 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:39:08,285 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:39:08,285 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:39:08,285 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:39:08,285 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:39:08,285 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:39:08,285 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:39:08,286 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:39:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-03 16:39:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:39:08,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:08,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:39:08,325 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:08,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:08,333 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-03 16:39:08,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:08,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:08,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:08,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:08,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:08,505 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 16:39:08,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:39:08,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:39:08,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:39:08,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:39:08,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:39:08,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:39:08,552 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-03 16:39:08,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:08,667 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2018-12-03 16:39:08,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:39:08,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-03 16:39:08,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:08,683 INFO L225 Difference]: With dead ends: 10 [2018-12-03 16:39:08,683 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:39:08,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 16:39:08,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:39:08,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:39:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:39:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-03 16:39:08,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2018-12-03 16:39:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:08,730 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-03 16:39:08,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:39:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-03 16:39:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:39:08,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:08,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:39:08,732 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:08,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:08,733 INFO L82 PathProgramCache]: Analyzing trace with hash 28791948, now seen corresponding path program 1 times [2018-12-03 16:39:08,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:08,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:08,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:08,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:08,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:08,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:39:08,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:39:08,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:39:08,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:39:08,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:39:08,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:39:08,837 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-12-03 16:39:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:08,876 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-03 16:39:08,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:39:08,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-03 16:39:08,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:08,877 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:39:08,877 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:39:08,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:39:08,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:39:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:39:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:39:08,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 16:39:08,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 16:39:08,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:08,881 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 16:39:08,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:39:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 16:39:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:39:08,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:08,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 16:39:08,882 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:08,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:08,882 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2018-12-03 16:39:08,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:08,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:08,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:08,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:08,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:09,121 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 16:39:09,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:09,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:09,123 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-03 16:39:09,125 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2018-12-03 16:39:09,167 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:39:09,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:39:16,288 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:39:16,290 INFO L272 AbstractInterpreter]: Visited 6 different actions 18 times. Merged at 2 different actions 6 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 16:39:16,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:16,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:39:16,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:16,301 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 16:39:16,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:16,312 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:16,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:16,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:39:16,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:16,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:16,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:39:16,848 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 16:39:16,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:16,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:39:16,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:16,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:16,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:39:16,988 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 16:39:17,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:17,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:39:17,009 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:17,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:39:17,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:39:17,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:39:17,010 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 10 states. [2018-12-03 16:39:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:17,209 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-12-03 16:39:17,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:39:17,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-03 16:39:17,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:17,211 INFO L225 Difference]: With dead ends: 12 [2018-12-03 16:39:17,212 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:39:17,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:39:17,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:39:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:39:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:39:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-03 16:39:17,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-12-03 16:39:17,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:17,218 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-03 16:39:17,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:39:17,218 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-03 16:39:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:39:17,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:17,219 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 16:39:17,219 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:17,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:17,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1949841836, now seen corresponding path program 2 times [2018-12-03 16:39:17,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:17,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:17,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:17,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:17,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:17,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:17,301 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:17,301 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:17,301 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:39:17,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:17,302 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 16:39:17,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:17,312 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:17,341 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:39:17,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:17,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:17,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:17,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:17,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2018-12-03 16:39:17,386 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:17,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:39:17,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:39:17,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:39:17,387 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2018-12-03 16:39:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:17,710 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-03 16:39:17,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:39:17,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-12-03 16:39:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:17,711 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:39:17,711 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:39:17,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:39:17,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:39:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 16:39:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:39:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 16:39:17,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2018-12-03 16:39:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:17,716 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 16:39:17,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:39:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 16:39:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:39:17,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:17,717 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-03 16:39:17,718 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:17,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:17,718 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 3 times [2018-12-03 16:39:17,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:17,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:17,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:17,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:17,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:17,901 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 16:39:17,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:17,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:17,903 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:17,903 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:39:17,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:17,904 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 16:39:17,912 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:17,912 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:17,921 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:17,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:17,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:17,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:39:17,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:17,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:17,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:39:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:39:18,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:18,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:39:18,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:18,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:18,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:39:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:39:18,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:18,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2018-12-03 16:39:18,227 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:18,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:39:18,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:39:18,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:39:18,229 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 11 states. [2018-12-03 16:39:18,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:18,744 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-03 16:39:18,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:39:18,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2018-12-03 16:39:18,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:18,746 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:39:18,746 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 16:39:18,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:39:18,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 16:39:18,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 16:39:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:39:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-03 16:39:18,754 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-12-03 16:39:18,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:18,754 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-03 16:39:18,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:39:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-03 16:39:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:39:18,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:18,755 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2018-12-03 16:39:18,755 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:18,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:18,756 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 4 times [2018-12-03 16:39:18,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:18,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:18,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:18,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:18,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:18,933 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 16:39:18,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:18,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:18,934 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:18,935 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:39:18,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:18,935 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 16:39:18,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:18,947 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:18,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:19,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:39:19,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:19,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:19,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:39:19,204 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 16:39:19,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:19,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:39:19,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:19,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:19,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:39:19,243 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 16:39:19,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:19,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2018-12-03 16:39:19,262 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:19,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:39:19,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:39:19,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:39:19,263 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 16 states. [2018-12-03 16:39:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:19,631 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-12-03 16:39:19,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:39:19,632 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2018-12-03 16:39:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:19,633 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:39:19,633 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 16:39:19,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:39:19,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 16:39:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 16:39:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:39:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-12-03 16:39:19,638 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-12-03 16:39:19,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:19,639 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-03 16:39:19,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:39:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-12-03 16:39:19,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:39:19,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:19,640 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-12-03 16:39:19,640 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:19,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:19,640 INFO L82 PathProgramCache]: Analyzing trace with hash 375043724, now seen corresponding path program 5 times [2018-12-03 16:39:19,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:19,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:19,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:19,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:19,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:19,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:19,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:19,785 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:19,785 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:19,785 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:39:19,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:19,786 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 16:39:19,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:19,796 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:19,810 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 16:39:19,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:19,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:19,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:19,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:19,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 16:39:19,896 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:19,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:39:19,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:39:19,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:39:19,897 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 7 states. [2018-12-03 16:39:19,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:19,981 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-03 16:39:19,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:39:19,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 16:39:19,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:19,982 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:39:19,982 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:39:19,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:39:19,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:39:19,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 16:39:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:39:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-03 16:39:19,990 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-12-03 16:39:19,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:19,991 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-03 16:39:19,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:39:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-03 16:39:19,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:39:19,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:19,992 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2018-12-03 16:39:19,992 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:19,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:19,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 6 times [2018-12-03 16:39:19,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:19,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:19,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:19,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:19,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:20,221 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 16:39:20,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:20,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:20,222 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:20,222 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:39:20,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:20,222 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 16:39:20,233 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:20,233 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:20,247 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:20,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:20,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:20,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:39:20,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:20,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:20,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:39:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 16:39:20,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:20,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:39:20,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:20,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:20,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:39:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 16:39:20,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:20,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 22 [2018-12-03 16:39:20,893 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:20,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:39:20,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:39:20,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:39:20,895 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 17 states. [2018-12-03 16:39:21,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:21,523 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-12-03 16:39:21,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:39:21,527 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2018-12-03 16:39:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:21,528 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:39:21,528 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:39:21,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:39:21,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:39:21,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 16:39:21,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:39:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-03 16:39:21,534 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-12-03 16:39:21,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:21,534 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-03 16:39:21,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:39:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-03 16:39:21,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:39:21,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:21,535 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2018-12-03 16:39:21,535 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:21,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:21,535 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 7 times [2018-12-03 16:39:21,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:21,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:21,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:21,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:21,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:21,737 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 16:39:21,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:21,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:21,738 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:21,738 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:39:21,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:21,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 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 16:39:21,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:21,748 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:21,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:21,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:39:21,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:21,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:21,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:39:21,994 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 16:39:21,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:22,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:39:22,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:22,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:22,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:39:22,050 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 16:39:22,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:22,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2018-12-03 16:39:22,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:22,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:39:22,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:39:22,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:39:22,071 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 22 states. [2018-12-03 16:39:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:22,634 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-12-03 16:39:22,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:39:22,635 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2018-12-03 16:39:22,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:22,636 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:39:22,636 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:39:22,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:39:22,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:39:22,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 16:39:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:39:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-12-03 16:39:22,643 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-12-03 16:39:22,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:22,643 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-12-03 16:39:22,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:39:22,644 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-12-03 16:39:22,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:39:22,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:22,644 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-12-03 16:39:22,645 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:22,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:22,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1662915732, now seen corresponding path program 8 times [2018-12-03 16:39:22,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:22,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:22,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:22,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:22,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:22,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:22,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:22,743 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:22,743 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:39:22,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:22,744 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 16:39:22,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:22,756 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:22,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:39:22,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:22,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:22,837 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:22,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:23,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:23,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2018-12-03 16:39:23,073 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:23,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:39:23,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:39:23,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:39:23,074 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 9 states. [2018-12-03 16:39:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:23,152 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-12-03 16:39:23,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:39:23,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-12-03 16:39:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:23,154 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:39:23,154 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:39:23,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:39:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:39:23,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 16:39:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:39:23,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-03 16:39:23,161 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2018-12-03 16:39:23,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:23,162 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-03 16:39:23,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:39:23,162 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-03 16:39:23,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:39:23,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:23,162 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2018-12-03 16:39:23,163 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:23,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:23,163 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 9 times [2018-12-03 16:39:23,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:23,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:23,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:23,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:23,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:23,470 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 16:39:23,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:23,470 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:23,470 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:23,471 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:39:23,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:23,471 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 16:39:23,483 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:23,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:23,495 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:23,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:23,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:23,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:39:23,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:23,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:23,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:39:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 16:39:23,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:24,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:39:24,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:24,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:24,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:39:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 16:39:24,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:24,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2018-12-03 16:39:24,211 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:24,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:39:24,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:39:24,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:39:24,212 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 23 states. [2018-12-03 16:39:24,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:24,972 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-12-03 16:39:24,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:39:24,973 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2018-12-03 16:39:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:24,974 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:39:24,974 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:39:24,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:39:24,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:39:24,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 16:39:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:39:24,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-03 16:39:24,981 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-12-03 16:39:24,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:24,982 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-03 16:39:24,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:39:24,982 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-03 16:39:24,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:39:24,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:24,982 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2018-12-03 16:39:24,983 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:24,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:24,983 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 10 times [2018-12-03 16:39:24,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:24,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:24,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:24,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:24,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:25,264 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 16:39:25,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:25,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:25,264 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:25,265 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:39:25,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:25,265 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 16:39:25,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:25,277 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:25,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:25,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:39:25,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:25,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:25,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:39:25,561 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 16:39:25,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:25,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:39:25,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:25,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:25,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:39:25,623 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 16:39:25,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:25,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2018-12-03 16:39:25,643 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:25,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:39:25,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:39:25,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:39:25,644 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 28 states. [2018-12-03 16:39:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:26,305 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-12-03 16:39:26,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:39:26,306 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 18 [2018-12-03 16:39:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:26,307 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:39:26,307 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:39:26,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=1238, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:39:26,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:39:26,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 16:39:26,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:39:26,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-03 16:39:26,315 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-12-03 16:39:26,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:26,315 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-03 16:39:26,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:39:26,315 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-12-03 16:39:26,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:39:26,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:26,316 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-12-03 16:39:26,316 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:26,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:26,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1547184052, now seen corresponding path program 11 times [2018-12-03 16:39:26,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:26,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:26,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:26,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:26,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:26,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:26,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:26,488 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:26,489 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:39:26,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:26,489 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 16:39:26,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:26,499 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:26,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:39:26,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:26,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:26,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:26,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:26,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2018-12-03 16:39:26,720 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:26,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:39:26,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:39:26,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:39:26,721 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2018-12-03 16:39:27,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:27,052 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-12-03 16:39:27,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:39:27,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-12-03 16:39:27,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:27,054 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:39:27,054 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:39:27,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 16 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:39:27,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:39:27,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 16:39:27,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:39:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-03 16:39:27,062 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-12-03 16:39:27,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:27,063 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-03 16:39:27,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:39:27,063 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-03 16:39:27,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:39:27,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:27,063 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2018-12-03 16:39:27,064 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:27,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:27,064 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 12 times [2018-12-03 16:39:27,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:27,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:27,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:27,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:27,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:27,444 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 16:39:27,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:27,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:27,445 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:27,445 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:39:27,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:27,446 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 16:39:27,454 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:27,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:27,466 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:27,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:27,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:27,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:39:27,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:27,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:27,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:39:27,734 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:39:27,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:27,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:39:27,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:27,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:27,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:39:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:39:28,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:28,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 38 [2018-12-03 16:39:28,311 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:28,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 16:39:28,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 16:39:28,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:39:28,312 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 29 states. [2018-12-03 16:39:29,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:29,386 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-12-03 16:39:29,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:39:29,387 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2018-12-03 16:39:29,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:29,388 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:39:29,388 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:39:29,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=403, Invalid=2147, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:39:29,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:39:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 16:39:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 16:39:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-03 16:39:29,398 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-12-03 16:39:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:29,399 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-03 16:39:29,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 16:39:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-03 16:39:29,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:39:29,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:29,400 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2018-12-03 16:39:29,400 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:29,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:29,400 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 13 times [2018-12-03 16:39:29,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:29,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:29,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:29,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:29,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:29,917 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 16:39:29,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:29,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:29,918 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:29,918 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:39:29,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:29,918 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 16:39:29,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:29,928 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:29,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:30,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:39:30,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:30,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:30,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:39:30,323 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 16:39:30,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:30,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:39:30,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:30,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:30,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:39:30,514 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 16:39:30,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:30,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2018-12-03 16:39:30,533 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:30,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:39:30,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:39:30,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:39:30,535 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 34 states. [2018-12-03 16:39:31,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:31,312 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-03 16:39:31,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:39:31,313 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2018-12-03 16:39:31,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:31,314 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:39:31,314 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:39:31,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:39:31,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:39:31,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 16:39:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:39:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-03 16:39:31,325 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-12-03 16:39:31,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:31,325 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-03 16:39:31,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:39:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-03 16:39:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:39:31,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:31,326 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2018-12-03 16:39:31,326 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:31,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:31,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1283882284, now seen corresponding path program 14 times [2018-12-03 16:39:31,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:31,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:31,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:31,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:31,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:31,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:31,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:31,472 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:31,472 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:39:31,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:31,472 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 16:39:31,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:31,480 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:31,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:39:31,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:31,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:31,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:31,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:31,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2018-12-03 16:39:31,659 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:31,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:39:31,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:39:31,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:39:31,659 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 13 states. [2018-12-03 16:39:31,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:31,919 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-03 16:39:31,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:39:31,920 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-12-03 16:39:31,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:31,920 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:39:31,920 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:39:31,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 20 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:39:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:39:31,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 16:39:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 16:39:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-03 16:39:31,931 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2018-12-03 16:39:31,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:31,931 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-03 16:39:31,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:39:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-03 16:39:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:39:31,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:31,932 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2018-12-03 16:39:31,932 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:31,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:31,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 15 times [2018-12-03 16:39:31,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:31,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:31,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:31,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:31,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:32,497 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 16:39:32,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:32,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:32,498 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:32,498 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:39:32,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:32,498 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 16:39:32,506 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:32,506 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:32,522 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:32,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:32,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:32,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:39:32,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:32,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:32,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:39:32,883 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-03 16:39:32,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:32,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:39:32,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:32,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:32,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:39:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-03 16:39:33,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:33,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 46 [2018-12-03 16:39:33,416 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:33,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 16:39:33,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 16:39:33,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:39:33,418 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 35 states. [2018-12-03 16:39:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:34,969 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-12-03 16:39:34,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:39:34,970 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 24 [2018-12-03 16:39:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:34,971 INFO L225 Difference]: With dead ends: 41 [2018-12-03 16:39:34,971 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:39:34,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=553, Invalid=3107, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:39:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:39:34,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 16:39:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 16:39:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-03 16:39:34,983 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-03 16:39:34,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:34,984 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-03 16:39:34,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 16:39:34,984 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-03 16:39:34,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:39:34,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:34,985 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2018-12-03 16:39:34,985 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:34,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:34,985 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 16 times [2018-12-03 16:39:34,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:34,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:34,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:34,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:34,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:35,539 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 16:39:35,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:35,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:35,539 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:35,540 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:39:35,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:35,540 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 16:39:35,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:35,549 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:35,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:36,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:39:36,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:36,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:36,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:39:36,091 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 16:39:36,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:36,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:39:36,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:36,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:36,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:39:36,199 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 16:39:36,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:36,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2018-12-03 16:39:36,223 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:36,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:39:36,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:39:36,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:39:36,224 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 40 states. [2018-12-03 16:39:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:37,217 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-03 16:39:37,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:39:37,218 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2018-12-03 16:39:37,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:37,219 INFO L225 Difference]: With dead ends: 42 [2018-12-03 16:39:37,219 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:39:37,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=244, Invalid=2618, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:39:37,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:39:37,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 16:39:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 16:39:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-12-03 16:39:37,228 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-12-03 16:39:37,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:37,229 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-03 16:39:37,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:39:37,229 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-12-03 16:39:37,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 16:39:37,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:37,229 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1] [2018-12-03 16:39:37,230 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:37,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:37,230 INFO L82 PathProgramCache]: Analyzing trace with hash -568862196, now seen corresponding path program 17 times [2018-12-03 16:39:37,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:37,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:37,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:37,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:37,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:37,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:37,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:37,721 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:37,721 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:39:37,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:37,721 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 16:39:37,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:37,738 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:37,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:39:37,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:37,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:37,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:38,075 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:38,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:38,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2018-12-03 16:39:38,096 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:38,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:39:38,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:39:38,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:39:38,097 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 15 states. [2018-12-03 16:39:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:38,282 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-03 16:39:38,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:39:38,282 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-12-03 16:39:38,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:38,283 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:39:38,283 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:39:38,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 24 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:39:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:39:38,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 16:39:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 16:39:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-03 16:39:38,292 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2018-12-03 16:39:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:38,293 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-03 16:39:38,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:39:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-03 16:39:38,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:39:38,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:38,293 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2018-12-03 16:39:38,294 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:38,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:38,294 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 18 times [2018-12-03 16:39:38,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:38,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:38,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:38,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:38,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:38,813 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 16:39:38,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:38,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:38,814 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:38,814 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:39:38,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:38,814 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 16:39:38,823 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:38,824 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:38,840 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:38,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:38,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:39,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:39:39,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:39,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:39,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:39:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-03 16:39:39,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:39,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:39:39,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:39,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:39,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:39:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-03 16:39:40,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:40,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 15] total 54 [2018-12-03 16:39:40,140 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:40,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 16:39:40,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 16:39:40,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=2444, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:39:40,142 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 41 states. [2018-12-03 16:39:41,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:41,836 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-12-03 16:39:41,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:39:41,843 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 28 [2018-12-03 16:39:41,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:41,843 INFO L225 Difference]: With dead ends: 47 [2018-12-03 16:39:41,843 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:39:41,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=727, Invalid=4243, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:39:41,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:39:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 16:39:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 16:39:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-03 16:39:41,857 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-12-03 16:39:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:41,857 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-03 16:39:41,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 16:39:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-03 16:39:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:39:41,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:41,858 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2018-12-03 16:39:41,859 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:41,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:41,859 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 19 times [2018-12-03 16:39:41,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:41,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:41,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:41,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:41,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:43,496 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 16:39:43,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:43,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:43,497 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:43,497 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:39:43,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:43,497 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 16:39:43,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:43,505 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:43,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:44,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:39:44,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:44,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:44,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:39:44,310 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 16:39:44,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:44,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:39:44,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:44,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:44,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:39:44,484 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 16:39:44,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:44,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2018-12-03 16:39:44,507 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:44,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:39:44,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:39:44,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:39:44,509 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 46 states. [2018-12-03 16:39:45,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:45,765 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-12-03 16:39:45,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:39:45,766 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 30 [2018-12-03 16:39:45,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:45,766 INFO L225 Difference]: With dead ends: 48 [2018-12-03 16:39:45,767 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:39:45,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:39:45,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:39:45,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 16:39:45,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 16:39:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-12-03 16:39:45,779 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-12-03 16:39:45,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:45,780 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-12-03 16:39:45,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:39:45,780 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-12-03 16:39:45,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 16:39:45,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:45,781 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1] [2018-12-03 16:39:45,781 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:45,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:45,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1693839084, now seen corresponding path program 20 times [2018-12-03 16:39:45,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:45,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:45,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:45,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:45,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:45,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:45,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:45,969 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:45,969 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:39:45,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:45,969 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 16:39:45,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:45,979 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:46,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 16:39:46,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:46,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:46,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:47,450 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:47,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:47,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2018-12-03 16:39:47,469 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:47,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:39:47,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:39:47,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:39:47,470 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 17 states. [2018-12-03 16:39:47,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:47,675 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-12-03 16:39:47,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:39:47,676 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2018-12-03 16:39:47,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:47,677 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:39:47,677 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:39:47,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 28 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:39:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:39:47,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 16:39:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 16:39:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-03 16:39:47,694 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2018-12-03 16:39:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:47,694 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-03 16:39:47,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:39:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-03 16:39:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:39:47,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:47,695 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2018-12-03 16:39:47,695 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:47,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:47,696 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 21 times [2018-12-03 16:39:47,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:47,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:47,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:47,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:47,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:48,592 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 16:39:48,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:48,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:48,592 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:48,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 16:39:48,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:48,593 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 16:39:48,611 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:48,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:48,628 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:48,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:48,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:49,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:39:49,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:49,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:49,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:39:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-03 16:39:49,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:49,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:39:49,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:49,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:49,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:39:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-03 16:39:50,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:50,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17, 17] total 62 [2018-12-03 16:39:50,152 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:50,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:39:50,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:39:50,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=3240, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:39:50,154 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 47 states. [2018-12-03 16:39:51,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:51,927 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-12-03 16:39:51,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:39:51,928 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 32 [2018-12-03 16:39:51,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:51,928 INFO L225 Difference]: With dead ends: 53 [2018-12-03 16:39:51,929 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:39:51,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=925, Invalid=5555, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 16:39:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:39:51,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 16:39:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 16:39:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-03 16:39:51,942 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-12-03 16:39:51,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:51,943 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-03 16:39:51,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:39:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-03 16:39:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:39:51,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:51,944 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2018-12-03 16:39:51,944 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:51,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:51,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 22 times [2018-12-03 16:39:51,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:51,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:51,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:51,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:51,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:52,581 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 16:39:52,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:52,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:52,581 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:52,582 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:39:52,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:52,582 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 16:39:52,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:52,590 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:52,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:53,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:39:53,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:53,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:53,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:39:53,370 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 16:39:53,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:53,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:39:53,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:53,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:53,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:39:53,612 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 16:39:53,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:53,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2018-12-03 16:39:53,631 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:53,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:39:53,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:39:53,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2501, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:53,633 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 52 states. [2018-12-03 16:39:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:55,543 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-12-03 16:39:55,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:39:55,544 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 34 [2018-12-03 16:39:55,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:55,544 INFO L225 Difference]: With dead ends: 54 [2018-12-03 16:39:55,544 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:39:55,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=320, Invalid=4510, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:39:55,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:39:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 16:39:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:39:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-03 16:39:55,559 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-12-03 16:39:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:55,559 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-03 16:39:55,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:39:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-03 16:39:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 16:39:55,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:55,560 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1] [2018-12-03 16:39:55,560 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:55,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:55,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1394260940, now seen corresponding path program 23 times [2018-12-03 16:39:55,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:55,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:55,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:55,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:55,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:55,796 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:55,796 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:39:55,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:55,796 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 16:39:55,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:55,806 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:55,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 16:39:55,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:55,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:55,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:39:56,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:56,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2018-12-03 16:39:56,110 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:56,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:39:56,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:39:56,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:39:56,110 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2018-12-03 16:39:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:56,328 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-03 16:39:56,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 16:39:56,329 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-12-03 16:39:56,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:56,330 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:39:56,330 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:39:56,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 32 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:39:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:39:56,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 16:39:56,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 16:39:56,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-03 16:39:56,349 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2018-12-03 16:39:56,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:56,349 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-03 16:39:56,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:39:56,349 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-03 16:39:56,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 16:39:56,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:56,350 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2018-12-03 16:39:56,350 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:56,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:56,350 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 24 times [2018-12-03 16:39:56,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:56,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:56,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:56,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:56,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:57,334 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 16:39:57,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:57,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:57,335 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:57,335 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:39:57,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:57,335 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 16:39:57,345 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:57,345 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:57,368 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:57,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:57,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:58,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:39:58,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:58,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:58,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:39:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-03 16:39:58,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:58,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:39:58,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:39:58,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:39:58,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:39:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-03 16:39:59,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:59,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19, 19] total 70 [2018-12-03 16:39:59,005 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:59,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:39:59,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:39:59,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=4148, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:39:59,006 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 53 states. [2018-12-03 16:40:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:01,585 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-12-03 16:40:01,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:40:01,586 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 36 [2018-12-03 16:40:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:01,586 INFO L225 Difference]: With dead ends: 59 [2018-12-03 16:40:01,586 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 16:40:01,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1147, Invalid=7043, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 16:40:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 16:40:01,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 16:40:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 16:40:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-03 16:40:01,607 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-03 16:40:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:01,608 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-03 16:40:01,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:40:01,608 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-03 16:40:01,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 16:40:01,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:01,609 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2018-12-03 16:40:01,609 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:01,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:01,609 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 25 times [2018-12-03 16:40:01,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:01,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:01,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:01,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:01,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:02,508 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 16:40:02,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:02,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:02,509 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:02,509 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:40:02,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:02,509 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 16:40:02,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:02,518 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:40:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:02,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:03,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:40:03,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:40:03,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:40:03,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:40:03,489 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 16:40:03,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:03,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:40:03,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:40:03,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:40:03,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:40:03,750 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 16:40:03,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:03,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2018-12-03 16:40:03,769 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:03,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:40:03,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:40:03,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:40:03,771 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 58 states. [2018-12-03 16:40:06,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:06,022 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-03 16:40:06,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 16:40:06,022 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 38 [2018-12-03 16:40:06,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:06,023 INFO L225 Difference]: With dead ends: 60 [2018-12-03 16:40:06,023 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 16:40:06,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:40:06,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 16:40:06,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 16:40:06,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 16:40:06,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-12-03 16:40:06,039 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-12-03 16:40:06,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:06,039 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-12-03 16:40:06,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:40:06,039 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-12-03 16:40:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 16:40:06,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:06,040 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1] [2018-12-03 16:40:06,040 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:06,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:06,040 INFO L82 PathProgramCache]: Analyzing trace with hash 536887468, now seen corresponding path program 26 times [2018-12-03 16:40:06,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:06,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:06,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:06,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:06,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:06,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:06,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:06,279 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:06,279 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:40:06,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:06,279 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 16:40:06,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:40:06,288 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:40:06,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:40:06,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:06,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:06,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:06,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:06,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2018-12-03 16:40:06,705 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:06,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:40:06,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:40:06,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:40:06,705 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 21 states. [2018-12-03 16:40:06,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:06,956 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-03 16:40:06,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:40:06,957 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2018-12-03 16:40:06,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:06,957 INFO L225 Difference]: With dead ends: 43 [2018-12-03 16:40:06,958 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 16:40:06,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 36 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 16:40:06,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 16:40:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 16:40:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 16:40:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-03 16:40:06,980 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2018-12-03 16:40:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:06,980 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-03 16:40:06,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:40:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-03 16:40:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 16:40:06,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:06,981 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2018-12-03 16:40:06,981 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:06,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:06,981 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 27 times [2018-12-03 16:40:06,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:06,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:06,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:06,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:06,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:08,140 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 16:40:08,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:08,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:08,140 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:08,141 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:40:08,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:08,141 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 16:40:08,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:40:08,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:40:08,177 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:40:08,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:08,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:09,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:40:09,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:40:09,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:40:09,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:40:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-03 16:40:09,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:09,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:40:09,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:40:09,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:40:09,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:40:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-03 16:40:10,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:10,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 21, 21] total 78 [2018-12-03 16:40:10,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:10,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 16:40:10,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 16:40:10,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=5168, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:40:10,534 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 59 states. [2018-12-03 16:40:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:13,168 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-12-03 16:40:13,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:40:13,169 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 40 [2018-12-03 16:40:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:13,170 INFO L225 Difference]: With dead ends: 65 [2018-12-03 16:40:13,170 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 16:40:13,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1393, Invalid=8707, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 16:40:13,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 16:40:13,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 16:40:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 16:40:13,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-03 16:40:13,195 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-12-03 16:40:13,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:13,196 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-03 16:40:13,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 16:40:13,196 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-03 16:40:13,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 16:40:13,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:13,196 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2018-12-03 16:40:13,197 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:13,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:13,197 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 28 times [2018-12-03 16:40:13,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:13,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:13,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:13,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:13,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:14,313 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 16:40:14,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:14,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:14,314 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:14,314 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:40:14,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:14,314 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 16:40:14,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:14,323 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:40:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:14,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:15,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:40:15,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:40:15,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:40:15,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:40:15,737 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 16:40:15,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:15,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:40:15,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:40:15,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:40:15,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:40:16,066 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 16:40:16,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:16,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2018-12-03 16:40:16,085 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:16,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:40:16,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:40:16,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3845, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:40:16,086 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 64 states. [2018-12-03 16:40:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:18,518 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-12-03 16:40:18,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:40:18,519 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 42 [2018-12-03 16:40:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:18,519 INFO L225 Difference]: With dead ends: 66 [2018-12-03 16:40:18,519 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 16:40:18,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 47 SyntacticMatches, 14 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=396, Invalid=6914, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:40:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 16:40:18,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 16:40:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 16:40:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-12-03 16:40:18,544 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2018-12-03 16:40:18,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:18,544 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-12-03 16:40:18,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:40:18,544 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-12-03 16:40:18,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 16:40:18,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:18,545 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1] [2018-12-03 16:40:18,545 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:18,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:18,545 INFO L82 PathProgramCache]: Analyzing trace with hash -392135284, now seen corresponding path program 29 times [2018-12-03 16:40:18,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:18,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:18,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:18,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:18,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:18,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:18,877 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:18,877 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:18,877 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:40:18,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:18,877 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 16:40:18,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:40:18,886 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:40:18,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 16:40:18,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:18,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:18,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:19,354 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:19,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:19,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2018-12-03 16:40:19,373 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:19,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:40:19,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:40:19,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:40:19,373 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 23 states. [2018-12-03 16:40:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:19,661 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-12-03 16:40:19,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:40:19,662 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-12-03 16:40:19,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:19,663 INFO L225 Difference]: With dead ends: 47 [2018-12-03 16:40:19,663 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 16:40:19,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 40 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 16:40:19,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 16:40:19,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 16:40:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 16:40:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-03 16:40:19,684 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2018-12-03 16:40:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:19,684 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-03 16:40:19,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:40:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-03 16:40:19,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 16:40:19,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:19,685 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2018-12-03 16:40:19,685 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:19,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:19,685 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 30 times [2018-12-03 16:40:19,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:19,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:19,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:19,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:19,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:20,985 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 16:40:20,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:20,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:20,986 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:20,986 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:40:20,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:20,986 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 16:40:20,997 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:40:20,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:40:21,022 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:40:21,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:21,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:22,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:40:22,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:40:22,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:40:22,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:40:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-03 16:40:22,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:22,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:40:22,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:40:22,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:40:22,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:40:23,444 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-03 16:40:23,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:23,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 23, 23] total 86 [2018-12-03 16:40:23,463 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:23,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 16:40:23,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 16:40:23,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1010, Invalid=6300, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:40:23,465 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 65 states. [2018-12-03 16:40:26,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:26,996 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-12-03 16:40:26,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:40:26,997 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 44 [2018-12-03 16:40:26,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:26,997 INFO L225 Difference]: With dead ends: 71 [2018-12-03 16:40:26,997 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 16:40:26,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1663, Invalid=10547, Unknown=0, NotChecked=0, Total=12210 [2018-12-03 16:40:26,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 16:40:27,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 16:40:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 16:40:27,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-03 16:40:27,017 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-12-03 16:40:27,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:27,018 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-03 16:40:27,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 16:40:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-03 16:40:27,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 16:40:27,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:27,018 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2018-12-03 16:40:27,018 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:27,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:27,019 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 31 times [2018-12-03 16:40:27,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:27,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:27,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:27,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:27,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:28,257 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 16:40:28,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:28,258 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:28,258 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:28,258 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:40:28,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:28,258 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 16:40:28,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:28,271 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:40:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:28,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:29,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:40:29,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:40:29,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:40:29,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:40:29,587 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 16:40:29,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:29,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:40:29,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:40:29,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:40:29,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:40:30,038 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 16:40:30,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:30,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2018-12-03 16:40:30,059 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:30,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:40:30,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:40:30,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:40:30,060 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 70 states. [2018-12-03 16:40:33,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:33,137 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-12-03 16:40:33,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:40:33,137 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 46 [2018-12-03 16:40:33,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:33,138 INFO L225 Difference]: With dead ends: 72 [2018-12-03 16:40:33,138 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 16:40:33,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 51 SyntacticMatches, 16 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:40:33,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 16:40:33,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 16:40:33,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 16:40:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-03 16:40:33,158 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2018-12-03 16:40:33,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:33,158 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-03 16:40:33,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:40:33,159 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-03 16:40:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 16:40:33,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:33,159 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1] [2018-12-03 16:40:33,159 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:33,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:33,159 INFO L82 PathProgramCache]: Analyzing trace with hash 259355244, now seen corresponding path program 32 times [2018-12-03 16:40:33,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:33,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:33,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:33,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:33,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:34,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:34,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:34,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:34,345 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:40:34,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:34,345 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 16:40:34,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:40:34,355 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:40:34,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 16:40:34,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:34,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:34,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:34,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:34,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2018-12-03 16:40:34,856 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:34,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:40:34,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:40:34,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:40:34,857 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 25 states. [2018-12-03 16:40:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:35,227 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-12-03 16:40:35,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:40:35,228 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-12-03 16:40:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:35,228 INFO L225 Difference]: With dead ends: 51 [2018-12-03 16:40:35,228 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 16:40:35,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 71 SyntacticMatches, 44 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:40:35,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 16:40:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 16:40:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 16:40:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-03 16:40:35,249 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2018-12-03 16:40:35,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:35,250 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-03 16:40:35,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:40:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-03 16:40:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 16:40:35,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:35,251 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2018-12-03 16:40:35,251 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:35,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:35,251 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 33 times [2018-12-03 16:40:35,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:35,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:35,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:35,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:35,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:36,639 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 16:40:36,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:36,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:36,639 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:36,640 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:40:36,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:36,640 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 16:40:36,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:40:36,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:40:36,687 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:40:36,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:36,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:37,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:40:37,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:40:37,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:40:37,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:40:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-03 16:40:38,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:38,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:40:38,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:40:38,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:40:38,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:40:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-03 16:40:39,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:39,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 25, 25] total 94 [2018-12-03 16:40:39,745 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:39,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 16:40:39,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 16:40:39,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1198, Invalid=7544, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:40:39,747 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 71 states. [2018-12-03 16:40:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:43,604 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-12-03 16:40:43,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:40:43,604 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 48 [2018-12-03 16:40:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:43,605 INFO L225 Difference]: With dead ends: 77 [2018-12-03 16:40:43,605 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 16:40:43,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1957, Invalid=12563, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 16:40:43,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 16:40:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 16:40:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 16:40:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-03 16:40:43,630 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-03 16:40:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:43,630 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-03 16:40:43,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 16:40:43,630 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-03 16:40:43,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:40:43,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:43,630 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2018-12-03 16:40:43,631 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:43,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:43,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 34 times [2018-12-03 16:40:43,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:43,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:43,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:43,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:43,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:44,954 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 16:40:44,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:44,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:44,954 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:44,954 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:40:44,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:44,955 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 16:40:44,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:44,977 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:40:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:45,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:46,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:40:46,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:40:46,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:40:46,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:40:46,740 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 16:40:46,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:46,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:40:46,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:40:46,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:40:46,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:40:47,258 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 16:40:47,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:47,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 75 [2018-12-03 16:40:47,277 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:47,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:40:47,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:40:47,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5477, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:40:47,278 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 76 states. [2018-12-03 16:40:50,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:50,305 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-12-03 16:40:50,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:40:50,305 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 50 [2018-12-03 16:40:50,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:50,306 INFO L225 Difference]: With dead ends: 78 [2018-12-03 16:40:50,306 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 16:40:50,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 55 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=472, Invalid=9830, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:50,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 16:40:50,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 16:40:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 16:40:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-12-03 16:40:50,329 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2018-12-03 16:40:50,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:50,329 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-12-03 16:40:50,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:40:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-12-03 16:40:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 16:40:50,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:50,330 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1] [2018-12-03 16:40:50,330 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:50,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:50,330 INFO L82 PathProgramCache]: Analyzing trace with hash -596041908, now seen corresponding path program 35 times [2018-12-03 16:40:50,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:50,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:50,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:50,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:50,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:50,998 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:50,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:50,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:50,999 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:50,999 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:40:51,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:51,000 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 16:40:51,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:40:51,009 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:40:51,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 16:40:51,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:51,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:51,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:51,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:51,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2018-12-03 16:40:51,599 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:51,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:40:51,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:40:51,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:40:51,600 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 27 states. [2018-12-03 16:40:51,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:51,975 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-12-03 16:40:51,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:40:51,976 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2018-12-03 16:40:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:51,976 INFO L225 Difference]: With dead ends: 55 [2018-12-03 16:40:51,976 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 16:40:51,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 77 SyntacticMatches, 48 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:40:51,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 16:40:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 16:40:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 16:40:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-03 16:40:52,001 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 51 [2018-12-03 16:40:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:52,001 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-03 16:40:52,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:40:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-03 16:40:52,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 16:40:52,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:52,002 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2018-12-03 16:40:52,002 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:52,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:52,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 36 times [2018-12-03 16:40:52,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:52,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:52,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:52,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:52,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:53,617 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 16:40:53,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:53,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:53,617 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:53,617 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:40:53,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:53,618 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 16:40:53,626 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:40:53,627 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:40:53,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:40:53,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:53,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:55,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:40:55,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:40:55,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:40:55,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:40:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-03 16:40:55,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:55,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:40:55,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:40:55,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:40:55,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:40:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-03 16:40:57,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:57,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 27, 27] total 102 [2018-12-03 16:40:57,197 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:57,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 16:40:57,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 16:40:57,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1402, Invalid=8900, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:57,198 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 77 states. [2018-12-03 16:41:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:01,589 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-12-03 16:41:01,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:41:01,589 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 52 [2018-12-03 16:41:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:01,590 INFO L225 Difference]: With dead ends: 83 [2018-12-03 16:41:01,590 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 16:41:01,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2275, Invalid=14755, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 16:41:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 16:41:01,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 16:41:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 16:41:01,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-03 16:41:01,623 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-12-03 16:41:01,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:01,623 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-03 16:41:01,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 16:41:01,623 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-03 16:41:01,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:41:01,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:01,624 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2018-12-03 16:41:01,624 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:01,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 37 times [2018-12-03 16:41:01,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:01,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:01,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:01,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:01,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:03,149 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 16:41:03,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:03,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:03,150 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:03,150 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:41:03,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:03,150 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 16:41:03,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:03,158 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:03,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:04,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:41:04,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:41:04,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:41:04,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:41:04,894 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 16:41:04,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:04,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:41:04,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:41:04,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:41:04,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:41:05,553 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 16:41:05,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:05,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 81 [2018-12-03 16:41:05,572 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:05,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 16:41:05,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 16:41:05,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:41:05,573 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 82 states. [2018-12-03 16:41:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:09,499 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-12-03 16:41:09,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:41:09,500 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 54 [2018-12-03 16:41:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:09,500 INFO L225 Difference]: With dead ends: 84 [2018-12-03 16:41:09,501 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 16:41:09,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 59 SyntacticMatches, 20 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:41:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 16:41:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 16:41:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 16:41:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-12-03 16:41:09,527 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2018-12-03 16:41:09,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:09,528 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-12-03 16:41:09,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 16:41:09,528 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-12-03 16:41:09,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 16:41:09,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:09,528 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1] [2018-12-03 16:41:09,529 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:09,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:09,529 INFO L82 PathProgramCache]: Analyzing trace with hash 488997932, now seen corresponding path program 38 times [2018-12-03 16:41:09,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:09,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:09,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:09,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:09,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:10,574 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:10,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:10,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:10,574 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:10,575 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:41:10,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:10,575 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 16:41:10,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:41:10,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:41:10,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 16:41:10,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:10,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:10,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:11,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:11,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2018-12-03 16:41:11,622 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:11,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 16:41:11,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 16:41:11,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:41:11,623 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 29 states. [2018-12-03 16:41:12,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:12,081 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-12-03 16:41:12,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:41:12,081 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2018-12-03 16:41:12,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:12,082 INFO L225 Difference]: With dead ends: 59 [2018-12-03 16:41:12,082 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 16:41:12,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 83 SyntacticMatches, 52 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 16:41:12,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 16:41:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 16:41:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 16:41:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-03 16:41:12,110 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 55 [2018-12-03 16:41:12,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:12,110 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-03 16:41:12,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 16:41:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-03 16:41:12,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 16:41:12,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:12,111 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2018-12-03 16:41:12,111 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:12,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:12,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 39 times [2018-12-03 16:41:12,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:12,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:12,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:12,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:12,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:14,012 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 16:41:14,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:14,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:14,012 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:14,012 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:41:14,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:14,012 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 16:41:14,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:41:14,021 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:41:14,057 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:41:14,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:14,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:15,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:41:15,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:41:15,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:41:15,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:41:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-03 16:41:15,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:15,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:41:15,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:41:15,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:41:15,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:41:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-03 16:41:18,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:18,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 29, 29] total 110 [2018-12-03 16:41:18,113 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:18,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 16:41:18,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 16:41:18,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1622, Invalid=10368, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:41:18,115 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 83 states. [2018-12-03 16:41:23,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:23,304 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-12-03 16:41:23,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 16:41:23,304 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 56 [2018-12-03 16:41:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:23,305 INFO L225 Difference]: With dead ends: 89 [2018-12-03 16:41:23,305 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 16:41:23,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=2617, Invalid=17123, Unknown=0, NotChecked=0, Total=19740 [2018-12-03 16:41:23,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 16:41:23,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 16:41:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 16:41:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-03 16:41:23,335 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-12-03 16:41:23,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:23,335 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-03 16:41:23,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 16:41:23,335 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-03 16:41:23,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 16:41:23,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:23,335 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2018-12-03 16:41:23,336 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:23,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:23,336 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 40 times [2018-12-03 16:41:23,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:23,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:23,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:23,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:23,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:25,568 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 16:41:25,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:25,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:25,568 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:25,568 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:41:25,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:25,568 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 16:41:25,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:25,577 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:25,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:27,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:41:27,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:41:27,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:41:27,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:41:27,872 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 16:41:27,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:27,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:41:27,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:41:27,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:41:27,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:41:28,646 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 16:41:28,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:28,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 87 [2018-12-03 16:41:28,665 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:28,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 16:41:28,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 16:41:28,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=7397, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:41:28,667 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 88 states. [2018-12-03 16:41:33,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:33,158 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-12-03 16:41:33,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 16:41:33,159 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 58 [2018-12-03 16:41:33,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:33,159 INFO L225 Difference]: With dead ends: 90 [2018-12-03 16:41:33,160 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 16:41:33,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 63 SyntacticMatches, 22 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=548, Invalid=13258, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:41:33,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 16:41:33,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 16:41:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 16:41:33,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-03 16:41:33,192 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2018-12-03 16:41:33,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:33,192 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-03 16:41:33,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 16:41:33,192 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-03 16:41:33,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 16:41:33,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:33,193 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1] [2018-12-03 16:41:33,193 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:33,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:33,193 INFO L82 PathProgramCache]: Analyzing trace with hash -998989556, now seen corresponding path program 41 times [2018-12-03 16:41:33,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:33,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:33,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:33,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:33,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:34,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:34,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:34,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:34,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 16:41:34,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:34,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 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 16:41:34,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:41:34,296 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:41:34,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 16:41:34,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:34,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:34,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:35,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:35,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2018-12-03 16:41:35,066 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:35,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:41:35,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:41:35,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:41:35,066 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 31 states. [2018-12-03 16:41:35,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:35,555 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-12-03 16:41:35,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:41:35,555 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2018-12-03 16:41:35,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:35,555 INFO L225 Difference]: With dead ends: 63 [2018-12-03 16:41:35,556 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 16:41:35,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 89 SyntacticMatches, 56 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:41:35,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 16:41:35,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 16:41:35,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 16:41:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-03 16:41:35,588 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2018-12-03 16:41:35,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:35,588 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-03 16:41:35,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:41:35,589 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-03 16:41:35,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 16:41:35,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:35,589 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2018-12-03 16:41:35,589 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:35,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:35,590 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 42 times [2018-12-03 16:41:35,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:35,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:35,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:35,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:37,899 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 16:41:37,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:37,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:37,899 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:37,900 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:41:37,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:37,900 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 16:41:37,909 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:41:37,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:41:37,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:41:37,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:37,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:39,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:41:39,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:41:39,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:41:39,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:41:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-03 16:41:40,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:40,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:41:40,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:41:40,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:41:40,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:41:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-03 16:41:42,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:42,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 31, 31] total 118 [2018-12-03 16:41:42,704 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:42,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 16:41:42,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 16:41:42,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=11948, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:41:42,705 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 89 states. [2018-12-03 16:41:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:48,223 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-12-03 16:41:48,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 16:41:48,224 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 60 [2018-12-03 16:41:48,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:48,225 INFO L225 Difference]: With dead ends: 95 [2018-12-03 16:41:48,225 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 16:41:48,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2983, Invalid=19667, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 16:41:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 16:41:48,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 16:41:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 16:41:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-03 16:41:48,259 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-12-03 16:41:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:48,259 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-03 16:41:48,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 16:41:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-03 16:41:48,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 16:41:48,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:48,260 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2018-12-03 16:41:48,260 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:48,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:48,261 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 43 times [2018-12-03 16:41:48,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:48,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:48,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:48,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:48,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:50,201 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 16:41:50,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:50,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:50,202 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:50,202 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:41:50,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:50,202 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 16:41:50,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:50,212 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:50,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:52,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:41:52,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:41:52,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:41:52,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:41:52,703 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 16:41:52,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:52,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:41:52,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:41:52,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:41:52,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:41:53,544 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 16:41:53,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:53,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 93 [2018-12-03 16:41:53,563 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:53,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 16:41:53,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 16:41:53,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=8465, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:41:53,564 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 94 states. [2018-12-03 16:41:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:58,728 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-12-03 16:41:58,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:41:58,729 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 62 [2018-12-03 16:41:58,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:58,730 INFO L225 Difference]: With dead ends: 96 [2018-12-03 16:41:58,730 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 16:41:58,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 67 SyntacticMatches, 24 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=586, Invalid=15164, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:41:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 16:41:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 16:41:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 16:41:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-12-03 16:41:58,764 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2018-12-03 16:41:58,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:58,764 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-12-03 16:41:58,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 16:41:58,764 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-12-03 16:41:58,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 16:41:58,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:58,765 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1] [2018-12-03 16:41:58,765 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:58,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:58,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1965001236, now seen corresponding path program 44 times [2018-12-03 16:41:58,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:58,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:58,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:58,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:58,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:59,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:59,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:59,380 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:59,380 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:41:59,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:59,380 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 16:41:59,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:41:59,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:41:59,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 16:41:59,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:59,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:59,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:00,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:00,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2018-12-03 16:42:00,374 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:00,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:42:00,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:42:00,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:42:00,375 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 33 states. [2018-12-03 16:42:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:00,904 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-12-03 16:42:00,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 16:42:00,905 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2018-12-03 16:42:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:00,905 INFO L225 Difference]: With dead ends: 67 [2018-12-03 16:42:00,905 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 16:42:00,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 95 SyntacticMatches, 60 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 16:42:00,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 16:42:00,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 16:42:00,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 16:42:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-12-03 16:42:00,941 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 63 [2018-12-03 16:42:00,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:00,941 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-12-03 16:42:00,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:42:00,942 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-12-03 16:42:00,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 16:42:00,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:00,942 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2018-12-03 16:42:00,942 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:00,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:00,943 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 45 times [2018-12-03 16:42:00,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:00,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:00,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:42:00,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:00,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:03,480 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 16:42:03,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:03,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:03,481 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:42:03,481 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:42:03,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:03,481 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 16:42:03,490 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:42:03,491 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:42:03,531 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:42:03,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:42:03,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:06,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:42:06,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:42:06,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:42:06,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:42:06,843 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-03 16:42:06,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:06,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:42:06,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:42:06,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:42:06,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:42:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-03 16:42:09,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:09,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 33, 33] total 126 [2018-12-03 16:42:09,712 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:09,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 16:42:09,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 16:42:09,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2110, Invalid=13640, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:42:09,713 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 95 states. [2018-12-03 16:42:15,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:15,869 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-12-03 16:42:15,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 16:42:15,869 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 64 [2018-12-03 16:42:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:15,870 INFO L225 Difference]: With dead ends: 101 [2018-12-03 16:42:15,870 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 16:42:15,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=3373, Invalid=22387, Unknown=0, NotChecked=0, Total=25760 [2018-12-03 16:42:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 16:42:15,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 16:42:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 16:42:15,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-03 16:42:15,908 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-12-03 16:42:15,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:15,908 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-03 16:42:15,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 16:42:15,909 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-03 16:42:15,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:42:15,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:15,909 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2018-12-03 16:42:15,909 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:15,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:15,909 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 46 times [2018-12-03 16:42:15,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:15,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:15,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:42:15,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:15,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:18,198 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 16:42:18,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:18,198 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:18,198 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:42:18,198 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:42:18,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:18,198 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 16:42:18,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:18,206 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:42:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:18,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:20,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:42:20,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:42:20,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:42:20,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:42:20,688 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 16:42:20,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:20,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:42:20,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:42:20,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:42:20,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:42:21,664 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 16:42:21,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:21,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 99 [2018-12-03 16:42:21,683 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:21,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 16:42:21,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 16:42:21,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:42:21,684 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 100 states. [2018-12-03 16:42:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:26,475 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-12-03 16:42:26,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:42:26,476 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 66 [2018-12-03 16:42:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:26,476 INFO L225 Difference]: With dead ends: 102 [2018-12-03 16:42:26,477 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 16:42:26,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 72 SyntacticMatches, 25 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:42:26,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 16:42:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 16:42:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 16:42:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-12-03 16:42:26,521 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2018-12-03 16:42:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:26,521 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-12-03 16:42:26,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 16:42:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-12-03 16:42:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 16:42:26,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:26,522 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1] [2018-12-03 16:42:26,522 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:26,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:26,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1906113844, now seen corresponding path program 47 times [2018-12-03 16:42:26,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:26,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:26,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:26,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:26,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:27,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:27,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:27,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:27,033 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:42:27,033 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:42:27,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:27,033 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 16:42:27,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:42:27,042 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:42:27,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 16:42:27,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:42:27,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:27,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:28,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:28,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:28,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2018-12-03 16:42:28,582 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:28,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 16:42:28,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 16:42:28,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:42:28,583 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 35 states. [2018-12-03 16:42:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:29,160 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-12-03 16:42:29,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:42:29,160 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2018-12-03 16:42:29,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:29,161 INFO L225 Difference]: With dead ends: 71 [2018-12-03 16:42:29,161 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 16:42:29,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 101 SyntacticMatches, 64 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 16:42:29,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 16:42:29,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 16:42:29,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 16:42:29,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-03 16:42:29,202 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 67 [2018-12-03 16:42:29,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:29,202 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-03 16:42:29,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 16:42:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-03 16:42:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 16:42:29,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:29,203 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2018-12-03 16:42:29,203 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:29,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:29,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 48 times [2018-12-03 16:42:29,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:29,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:29,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:42:29,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:29,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:31,773 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 16:42:31,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:31,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:31,774 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:42:31,774 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:42:31,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:31,774 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 16:42:31,783 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:42:31,784 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:42:31,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:42:31,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:42:31,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:34,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:42:34,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:42:34,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:42:34,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:42:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-03 16:42:34,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:34,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:42:34,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:42:34,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:42:34,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:42:37,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-03 16:42:37,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:37,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 35, 35] total 134 [2018-12-03 16:42:37,695 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:37,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 16:42:37,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 16:42:37,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2378, Invalid=15444, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:42:37,697 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 101 states. [2018-12-03 16:42:42,764 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-12-03 16:42:45,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:45,984 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-12-03 16:42:45,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 16:42:45,984 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 68 [2018-12-03 16:42:45,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:45,985 INFO L225 Difference]: With dead ends: 107 [2018-12-03 16:42:45,985 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 16:42:45,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=3787, Invalid=25283, Unknown=0, NotChecked=0, Total=29070 [2018-12-03 16:42:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 16:42:46,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 16:42:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 16:42:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-12-03 16:42:46,029 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2018-12-03 16:42:46,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:46,030 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-12-03 16:42:46,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 16:42:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-12-03 16:42:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 16:42:46,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:46,030 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2018-12-03 16:42:46,030 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:46,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:46,031 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 49 times [2018-12-03 16:42:46,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:46,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:46,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:42:46,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:46,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:48,784 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 16:42:48,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:48,785 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:48,785 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:42:48,785 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:42:48,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:48,785 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 16:42:48,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:48,801 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:42:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:48,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:51,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:42:51,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:42:51,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:42:51,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:42:51,597 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 16:42:51,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:51,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:42:51,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:42:51,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:42:51,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:42:52,618 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 16:42:52,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:52,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 105 [2018-12-03 16:42:52,646 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:52,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 16:42:52,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 16:42:52,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:42:52,648 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 106 states. [2018-12-03 16:42:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:59,131 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2018-12-03 16:42:59,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:42:59,131 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 70 [2018-12-03 16:42:59,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:59,132 INFO L225 Difference]: With dead ends: 108 [2018-12-03 16:42:59,132 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 16:42:59,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 78 SyntacticMatches, 25 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3274 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=662, Invalid=19360, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:42:59,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 16:42:59,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 16:42:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 16:42:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-12-03 16:42:59,177 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2018-12-03 16:42:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:59,178 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-03 16:42:59,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 16:42:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-12-03 16:42:59,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 16:42:59,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:59,178 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1] [2018-12-03 16:42:59,179 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:59,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:59,179 INFO L82 PathProgramCache]: Analyzing trace with hash -227129428, now seen corresponding path program 50 times [2018-12-03 16:42:59,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:59,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:59,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:00,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:00,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:00,444 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:43:00,444 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:43:00,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:00,444 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 16:43:00,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:43:00,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:43:00,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 16:43:00,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:43:00,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:00,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:00,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:01,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:01,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2018-12-03 16:43:01,665 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:01,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 16:43:01,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 16:43:01,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 16:43:01,666 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 37 states. [2018-12-03 16:43:02,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:02,304 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-12-03 16:43:02,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:43:02,305 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2018-12-03 16:43:02,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:02,305 INFO L225 Difference]: With dead ends: 75 [2018-12-03 16:43:02,305 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 16:43:02,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 107 SyntacticMatches, 68 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:43:02,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 16:43:02,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 16:43:02,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 16:43:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-03 16:43:02,351 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2018-12-03 16:43:02,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:02,351 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-03 16:43:02,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 16:43:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-03 16:43:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 16:43:02,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:02,352 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2018-12-03 16:43:02,352 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:02,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:02,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 51 times [2018-12-03 16:43:02,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:02,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:02,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:43:02,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:02,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:05,904 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 16:43:05,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:05,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:05,905 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:43:05,905 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:43:05,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:05,905 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 16:43:05,927 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:43:05,927 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:43:05,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:43:05,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:43:05,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:08,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:43:08,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:43:08,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:43:08,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:43:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-03 16:43:09,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:09,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:43:09,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:43:09,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:43:09,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:43:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-03 16:43:12,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:12,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 37, 37] total 142 [2018-12-03 16:43:12,567 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:12,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 16:43:12,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 16:43:12,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2662, Invalid=17360, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:43:12,569 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 107 states. [2018-12-03 16:43:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:20,498 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-12-03 16:43:20,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 16:43:20,498 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 72 [2018-12-03 16:43:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:20,499 INFO L225 Difference]: With dead ends: 113 [2018-12-03 16:43:20,499 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 16:43:20,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=4225, Invalid=28355, Unknown=0, NotChecked=0, Total=32580 [2018-12-03 16:43:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 16:43:20,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 16:43:20,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 16:43:20,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-03 16:43:20,546 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-03 16:43:20,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:20,547 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-03 16:43:20,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 16:43:20,547 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-03 16:43:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 16:43:20,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:20,547 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2018-12-03 16:43:20,547 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:20,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:20,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 52 times [2018-12-03 16:43:20,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:20,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:20,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:43:20,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:20,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:23,422 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 16:43:23,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:23,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:23,423 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:43:23,423 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:43:23,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:23,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 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 16:43:23,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:23,431 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:43:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:23,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:26,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:43:26,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:43:26,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:43:26,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:43:26,725 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 16:43:26,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:26,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:43:26,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:43:26,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:43:26,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:43:27,872 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 16:43:27,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:27,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 111 [2018-12-03 16:43:27,892 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:27,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 16:43:27,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 16:43:27,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=12101, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:43:27,893 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 112 states. [2018-12-03 16:43:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:34,589 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-12-03 16:43:34,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:43:34,589 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 74 [2018-12-03 16:43:34,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:34,590 INFO L225 Difference]: With dead ends: 114 [2018-12-03 16:43:34,590 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 16:43:34,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 83 SyntacticMatches, 26 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3645 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=700, Invalid=21650, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:43:34,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 16:43:34,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 16:43:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 16:43:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-12-03 16:43:34,639 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2018-12-03 16:43:34,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:34,640 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-12-03 16:43:34,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 16:43:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-12-03 16:43:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 16:43:34,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:34,641 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1] [2018-12-03 16:43:34,641 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:34,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:34,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2146155380, now seen corresponding path program 53 times [2018-12-03 16:43:34,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:34,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:34,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:34,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:34,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:35,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:35,770 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:35,770 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:43:35,770 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:43:35,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:35,770 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 16:43:35,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:43:35,780 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:43:35,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 16:43:35,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:43:36,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:36,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:37,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:37,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2018-12-03 16:43:37,004 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:37,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 16:43:37,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 16:43:37,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 16:43:37,005 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 39 states. [2018-12-03 16:43:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:37,685 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-12-03 16:43:37,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:43:37,685 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2018-12-03 16:43:37,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:37,686 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:43:37,686 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 16:43:37,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 113 SyntacticMatches, 72 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 16:43:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 16:43:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 16:43:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 16:43:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-12-03 16:43:37,753 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 75 [2018-12-03 16:43:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:37,753 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-12-03 16:43:37,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 16:43:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-12-03 16:43:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 16:43:37,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:37,754 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2018-12-03 16:43:37,754 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:37,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:37,754 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 54 times [2018-12-03 16:43:37,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:37,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:37,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:43:37,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:37,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:40,752 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 16:43:40,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:40,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:40,752 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:43:40,752 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:43:40,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:40,753 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 16:43:40,761 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:43:40,761 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:43:40,808 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:43:40,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:43:40,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:43,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:43:43,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:43:43,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:43:43,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:43:43,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-03 16:43:43,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:44,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:43:44,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:43:44,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:43:44,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:43:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-03 16:43:48,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:48,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 39, 39] total 150 [2018-12-03 16:43:48,031 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:48,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 16:43:48,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 16:43:48,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2962, Invalid=19388, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:43:48,033 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 113 states. [2018-12-03 16:43:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:57,380 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-12-03 16:43:57,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-12-03 16:43:57,380 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 76 [2018-12-03 16:43:57,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:57,381 INFO L225 Difference]: With dead ends: 119 [2018-12-03 16:43:57,381 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 16:43:57,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=4687, Invalid=31603, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 16:43:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 16:43:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 16:43:57,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 16:43:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-03 16:43:57,441 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-12-03 16:43:57,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:57,441 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-03 16:43:57,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 16:43:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-03 16:43:57,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 16:43:57,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:57,442 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2018-12-03 16:43:57,442 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:57,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:57,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 55 times [2018-12-03 16:43:57,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:57,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:57,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:43:57,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:57,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:01,242 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 16:44:01,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:01,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:01,242 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:01,243 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:44:01,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:01,243 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 16:44:01,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:01,252 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:44:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:01,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:04,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:44:04,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:44:04,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:44:04,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:44:04,711 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 16:44:04,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:04,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:44:04,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:44:04,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:44:04,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:44:06,262 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 16:44:06,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:06,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 117 [2018-12-03 16:44:06,282 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:06,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-03 16:44:06,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-03 16:44:06,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=13457, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:44:06,283 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 118 states. [2018-12-03 16:44:14,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:14,312 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2018-12-03 16:44:14,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:44:14,313 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 78 [2018-12-03 16:44:14,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:14,314 INFO L225 Difference]: With dead ends: 120 [2018-12-03 16:44:14,314 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 16:44:14,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 89 SyntacticMatches, 26 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3995 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=738, Invalid=24068, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:44:14,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 16:44:14,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 16:44:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 16:44:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-12-03 16:44:14,375 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2018-12-03 16:44:14,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:14,375 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-12-03 16:44:14,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-03 16:44:14,376 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-12-03 16:44:14,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 16:44:14,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:14,376 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1] [2018-12-03 16:44:14,376 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:14,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:14,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1169619308, now seen corresponding path program 56 times [2018-12-03 16:44:14,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:14,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:14,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:14,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:14,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:15,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:15,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:15,031 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:15,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 16:44:15,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:15,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 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 16:44:15,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:44:15,040 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:44:15,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 16:44:15,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:15,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:15,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:15,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:16,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:16,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2018-12-03 16:44:16,677 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:16,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 16:44:16,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 16:44:16,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:44:16,678 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 41 states. [2018-12-03 16:44:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:17,452 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-12-03 16:44:17,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:44:17,453 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2018-12-03 16:44:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:17,453 INFO L225 Difference]: With dead ends: 83 [2018-12-03 16:44:17,453 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 16:44:17,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 119 SyntacticMatches, 76 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 16:44:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 16:44:17,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 16:44:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 16:44:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-03 16:44:17,510 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 79 [2018-12-03 16:44:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:17,511 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-03 16:44:17,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 16:44:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-03 16:44:17,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 16:44:17,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:17,512 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2018-12-03 16:44:17,512 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:17,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:17,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 57 times [2018-12-03 16:44:17,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:17,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:17,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:44:17,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:17,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:21,594 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 16:44:21,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:21,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:21,594 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:21,594 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:44:21,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:21,594 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 16:44:21,604 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:44:21,604 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:44:21,651 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:44:21,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:21,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:25,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:44:25,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:44:25,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:44:25,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:44:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-03 16:44:25,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:25,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:44:25,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:44:25,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:44:25,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:44:29,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-03 16:44:29,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:29,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 41, 41] total 158 [2018-12-03 16:44:29,753 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:29,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-12-03 16:44:29,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-12-03 16:44:29,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3278, Invalid=21528, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:44:29,755 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 119 states. [2018-12-03 16:44:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:39,691 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-12-03 16:44:39,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-12-03 16:44:39,692 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 80 [2018-12-03 16:44:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:39,693 INFO L225 Difference]: With dead ends: 125 [2018-12-03 16:44:39,693 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 16:44:39,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=5173, Invalid=35027, Unknown=0, NotChecked=0, Total=40200 [2018-12-03 16:44:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 16:44:39,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 16:44:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 16:44:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-12-03 16:44:39,763 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-12-03 16:44:39,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:39,763 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-12-03 16:44:39,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-12-03 16:44:39,763 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-12-03 16:44:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 16:44:39,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:39,764 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2018-12-03 16:44:39,764 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:39,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:39,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 58 times [2018-12-03 16:44:39,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:39,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:39,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:44:39,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:39,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:43,768 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 16:44:43,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:43,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:43,769 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:43,769 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:44:43,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:43,769 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 16:44:43,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:43,780 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:44:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:43,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:48,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:44:48,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:44:48,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:44:48,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:44:48,603 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 16:44:48,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:48,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:44:48,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:44:48,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:44:48,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:44:50,011 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 16:44:50,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:50,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 123 [2018-12-03 16:44:50,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:50,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-12-03 16:44:50,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-12-03 16:44:50,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=14885, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:44:50,031 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 124 states. [2018-12-03 16:44:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:58,774 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2018-12-03 16:44:58,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 16:44:58,774 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 82 [2018-12-03 16:44:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:58,775 INFO L225 Difference]: With dead ends: 126 [2018-12-03 16:44:58,775 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 16:44:58,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 93 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4447 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=776, Invalid=26614, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:44:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 16:44:58,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 16:44:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 16:44:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-12-03 16:44:58,834 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2018-12-03 16:44:58,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:58,835 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-12-03 16:44:58,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-12-03 16:44:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-12-03 16:44:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 16:44:58,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:58,836 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1] [2018-12-03 16:44:58,836 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:58,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:58,836 INFO L82 PathProgramCache]: Analyzing trace with hash 928540236, now seen corresponding path program 59 times [2018-12-03 16:44:58,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:58,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:58,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:58,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:58,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:59,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:59,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:59,576 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:59,576 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:44:59,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:59,576 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 16:44:59,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:44:59,585 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:44:59,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 16:44:59,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:59,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:59,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:01,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:01,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:01,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2018-12-03 16:45:01,091 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:01,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:45:01,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:45:01,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 16:45:01,092 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 43 states. [2018-12-03 16:45:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:02,206 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-12-03 16:45:02,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 16:45:02,206 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2018-12-03 16:45:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:02,207 INFO L225 Difference]: With dead ends: 87 [2018-12-03 16:45:02,207 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 16:45:02,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 125 SyntacticMatches, 80 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 16:45:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 16:45:02,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 16:45:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 16:45:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-03 16:45:02,266 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2018-12-03 16:45:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:02,267 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-03 16:45:02,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:45:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-03 16:45:02,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 16:45:02,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:02,267 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2018-12-03 16:45:02,267 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:02,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:02,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 60 times [2018-12-03 16:45:02,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:02,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:02,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:45:02,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:02,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:05,610 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 16:45:05,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:05,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:05,611 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:05,611 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:45:05,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:05,611 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 16:45:05,620 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:45:05,620 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:45:05,665 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:45:05,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:45:05,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:09,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:45:09,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:45:09,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:45:09,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:45:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-03 16:45:09,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:10,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:45:10,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:45:10,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:45:10,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:45:14,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-03 16:45:14,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:14,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 43, 43] total 166 [2018-12-03 16:45:14,800 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:14,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-12-03 16:45:14,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-12-03 16:45:14,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3610, Invalid=23780, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:45:14,802 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 125 states. [2018-12-03 16:45:25,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:25,755 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-12-03 16:45:25,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-12-03 16:45:25,755 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 84 [2018-12-03 16:45:25,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:25,756 INFO L225 Difference]: With dead ends: 131 [2018-12-03 16:45:25,756 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 16:45:25,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=5683, Invalid=38627, Unknown=0, NotChecked=0, Total=44310 [2018-12-03 16:45:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 16:45:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 16:45:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 16:45:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-03 16:45:25,831 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-12-03 16:45:25,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:25,831 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-03 16:45:25,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-12-03 16:45:25,831 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-03 16:45:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 16:45:25,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:25,831 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2018-12-03 16:45:25,832 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:25,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:25,832 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 61 times [2018-12-03 16:45:25,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:25,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:25,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:45:25,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:25,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:29,680 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 16:45:29,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:29,680 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:29,681 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:29,681 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:45:29,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:29,681 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 16:45:29,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:45:29,690 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:45:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:29,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:33,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:45:33,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:45:33,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:45:33,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:45:34,056 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 16:45:34,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:34,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:45:34,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:45:34,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:45:34,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:45:35,615 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 16:45:35,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:35,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 129 [2018-12-03 16:45:35,643 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:35,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-03 16:45:35,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-03 16:45:35,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=16385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:45:35,645 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 130 states. [2018-12-03 16:45:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:45,066 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-12-03 16:45:45,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 16:45:45,066 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 86 [2018-12-03 16:45:45,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:45,067 INFO L225 Difference]: With dead ends: 132 [2018-12-03 16:45:45,067 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 16:45:45,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 97 SyntacticMatches, 30 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4923 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=814, Invalid=29288, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:45:45,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 16:45:45,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 16:45:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 16:45:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-12-03 16:45:45,134 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2018-12-03 16:45:45,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:45,134 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-12-03 16:45:45,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-03 16:45:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-12-03 16:45:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 16:45:45,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:45,135 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1] [2018-12-03 16:45:45,135 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:45,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:45,136 INFO L82 PathProgramCache]: Analyzing trace with hash -831354068, now seen corresponding path program 62 times [2018-12-03 16:45:45,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:45,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:45,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:45:45,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:45,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:46,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:46,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:46,011 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:46,011 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:45:46,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:46,011 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 16:45:46,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:45:46,020 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:45:46,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 16:45:46,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:45:46,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:46,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:47,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:47,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2018-12-03 16:45:47,930 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:47,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:45:47,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:45:47,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 16:45:47,931 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 45 states. [2018-12-03 16:45:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:48,804 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-12-03 16:45:48,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 16:45:48,804 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2018-12-03 16:45:48,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:48,805 INFO L225 Difference]: With dead ends: 91 [2018-12-03 16:45:48,805 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 16:45:48,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 131 SyntacticMatches, 84 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 16:45:48,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 16:45:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 16:45:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 16:45:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-12-03 16:45:48,901 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 87 [2018-12-03 16:45:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:48,902 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-12-03 16:45:48,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:45:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-12-03 16:45:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 16:45:48,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:48,903 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2018-12-03 16:45:48,903 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:48,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:48,903 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 63 times [2018-12-03 16:45:48,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:48,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:48,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:45:48,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:48,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:53,076 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 16:45:53,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:53,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:53,076 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:53,076 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:45:53,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:53,076 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 16:45:53,085 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:45:53,085 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:45:53,139 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:45:53,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:45:53,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:57,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:45:57,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:45:57,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:45:57,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:45:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-03 16:45:57,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:57,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:45:57,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:45:57,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:45:57,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:46:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-03 16:46:03,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:03,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 45, 45] total 174 [2018-12-03 16:46:03,236 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:03,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-12-03 16:46:03,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-12-03 16:46:03,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3958, Invalid=26144, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:46:03,238 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 131 states. [2018-12-03 16:46:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:15,320 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-12-03 16:46:15,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-12-03 16:46:15,320 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 88 [2018-12-03 16:46:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:15,321 INFO L225 Difference]: With dead ends: 137 [2018-12-03 16:46:15,321 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 16:46:15,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=6217, Invalid=42403, Unknown=0, NotChecked=0, Total=48620 [2018-12-03 16:46:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 16:46:15,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 16:46:15,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 16:46:15,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-03 16:46:15,385 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-12-03 16:46:15,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:15,385 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-03 16:46:15,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-12-03 16:46:15,385 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-03 16:46:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 16:46:15,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:15,386 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2018-12-03 16:46:15,386 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:15,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:15,387 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 64 times [2018-12-03 16:46:15,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:15,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:15,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:46:15,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:15,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:19,442 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 16:46:19,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:19,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:19,442 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:19,442 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:46:19,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:19,442 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:46:19,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:19,451 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:46:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:19,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:24,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:46:24,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:46:24,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:46:24,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:46:24,133 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 16:46:24,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:24,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:46:24,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:46:24,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:46:24,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:46:25,820 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 16:46:25,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:25,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 135 [2018-12-03 16:46:25,839 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:25,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-12-03 16:46:25,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-12-03 16:46:25,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=17957, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:46:25,841 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 136 states. [2018-12-03 16:46:36,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:36,190 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2018-12-03 16:46:36,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 16:46:36,190 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 90 [2018-12-03 16:46:36,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:36,191 INFO L225 Difference]: With dead ends: 138 [2018-12-03 16:46:36,192 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 16:46:36,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 102 SyntacticMatches, 31 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5376 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=852, Invalid=32090, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:46:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 16:46:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 16:46:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 16:46:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-12-03 16:46:36,262 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2018-12-03 16:46:36,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:36,262 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-12-03 16:46:36,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-12-03 16:46:36,262 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-12-03 16:46:36,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 16:46:36,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:36,262 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1] [2018-12-03 16:46:36,262 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:36,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:36,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1442879476, now seen corresponding path program 65 times [2018-12-03 16:46:36,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:36,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:36,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:36,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:36,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:37,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:37,071 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:37,071 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:37,071 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:46:37,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:37,071 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:46:37,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:46:37,080 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:46:37,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 16:46:37,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:46:37,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:37,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:39,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:39,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2018-12-03 16:46:39,296 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:39,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:46:39,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:46:39,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:46:39,297 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 47 states. [2018-12-03 16:46:40,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:40,252 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2018-12-03 16:46:40,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 16:46:40,252 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2018-12-03 16:46:40,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:40,253 INFO L225 Difference]: With dead ends: 95 [2018-12-03 16:46:40,253 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 16:46:40,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 137 SyntacticMatches, 88 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 16:46:40,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 16:46:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 16:46:40,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 16:46:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-03 16:46:40,325 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 91 [2018-12-03 16:46:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:40,325 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-03 16:46:40,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:46:40,325 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-03 16:46:40,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 16:46:40,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:40,326 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2018-12-03 16:46:40,326 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:40,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:40,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 66 times [2018-12-03 16:46:40,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:40,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:40,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:46:40,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:40,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:44,588 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 16:46:44,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:44,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:44,588 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:44,588 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:46:44,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:44,589 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:46:44,597 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:46:44,598 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:46:44,652 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:46:44,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:46:44,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:49,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:46:49,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:46:49,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:46:49,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:46:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 16:46:49,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:49,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:46:49,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:46:49,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:46:49,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:46:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 16:46:55,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:55,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 47, 47] total 182 [2018-12-03 16:46:55,464 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:55,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-12-03 16:46:55,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-12-03 16:46:55,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4322, Invalid=28620, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:46:55,466 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 137 states. [2018-12-03 16:47:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:47:08,355 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-12-03 16:47:08,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-12-03 16:47:08,356 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 92 [2018-12-03 16:47:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:47:08,357 INFO L225 Difference]: With dead ends: 143 [2018-12-03 16:47:08,357 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 16:47:08,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=6775, Invalid=46355, Unknown=0, NotChecked=0, Total=53130 [2018-12-03 16:47:08,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 16:47:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 16:47:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 16:47:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-12-03 16:47:08,435 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-12-03 16:47:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:47:08,435 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-12-03 16:47:08,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-12-03 16:47:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-12-03 16:47:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 16:47:08,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:47:08,436 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2018-12-03 16:47:08,436 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:47:08,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:47:08,437 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 67 times [2018-12-03 16:47:08,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:47:08,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:08,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:47:08,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:08,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:47:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:47:12,823 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 16:47:12,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:12,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:47:12,824 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:47:12,824 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:47:12,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:12,824 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:47:12,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:47:12,833 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:47:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:47:12,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:47:17,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:47:17,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:47:17,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:47:17,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:47:17,910 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 16:47:17,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:47:17,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:47:17,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:47:17,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:47:17,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:47:19,935 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 16:47:19,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:47:19,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 141 [2018-12-03 16:47:19,954 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:47:19,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-03 16:47:19,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-03 16:47:19,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=19601, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:47:19,955 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 142 states. [2018-12-03 16:47:31,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:47:31,012 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2018-12-03 16:47:31,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 16:47:31,012 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 94 [2018-12-03 16:47:31,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:47:31,013 INFO L225 Difference]: With dead ends: 144 [2018-12-03 16:47:31,014 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 16:47:31,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 106 SyntacticMatches, 33 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5898 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=890, Invalid=35020, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 16:47:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 16:47:31,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 16:47:31,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 16:47:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-12-03 16:47:31,089 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2018-12-03 16:47:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:47:31,089 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-12-03 16:47:31,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-03 16:47:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-12-03 16:47:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 16:47:31,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:47:31,090 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1] [2018-12-03 16:47:31,090 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:47:31,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:47:31,090 INFO L82 PathProgramCache]: Analyzing trace with hash 779681004, now seen corresponding path program 68 times [2018-12-03 16:47:31,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:47:31,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:31,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:47:31,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:31,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:47:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:47:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:31,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:31,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:47:31,987 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:47:31,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:47:31,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:31,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 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:47:31,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:47:31,995 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:47:32,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 16:47:32,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:47:32,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:47:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:32,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:47:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:34,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:47:34,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2018-12-03 16:47:34,054 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:47:34,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:47:34,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:47:34,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 16:47:34,055 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 49 states. [2018-12-03 16:47:35,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:47:35,133 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-12-03 16:47:35,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 16:47:35,133 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2018-12-03 16:47:35,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:47:35,134 INFO L225 Difference]: With dead ends: 99 [2018-12-03 16:47:35,134 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 16:47:35,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 143 SyntacticMatches, 92 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 16:47:35,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 16:47:35,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 16:47:35,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 16:47:35,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-03 16:47:35,205 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2018-12-03 16:47:35,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:47:35,205 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-03 16:47:35,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:47:35,205 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-03 16:47:35,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 16:47:35,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:47:35,205 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2018-12-03 16:47:35,206 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:47:35,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:47:35,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 69 times [2018-12-03 16:47:35,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:47:35,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:35,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:47:35,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:35,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:47:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:47:39,427 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 16:47:39,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:39,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:47:39,427 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:47:39,427 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:47:39,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:39,427 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:47:39,435 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:47:39,435 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:47:39,492 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:47:39,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:47:39,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:47:44,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:47:44,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:47:44,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:47:44,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:47:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-03 16:47:44,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:47:44,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:47:44,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:47:44,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:47:44,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:47:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-03 16:47:51,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:47:51,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 49, 49] total 190 [2018-12-03 16:47:51,566 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:47:51,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-12-03 16:47:51,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-12-03 16:47:51,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4702, Invalid=31208, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 16:47:51,568 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 143 states. [2018-12-03 16:48:05,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:48:05,977 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2018-12-03 16:48:05,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-12-03 16:48:05,977 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 96 [2018-12-03 16:48:05,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:48:05,977 INFO L225 Difference]: With dead ends: 149 [2018-12-03 16:48:05,977 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 16:48:05,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=7357, Invalid=50483, Unknown=0, NotChecked=0, Total=57840 [2018-12-03 16:48:05,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 16:48:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 16:48:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 16:48:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-03 16:48:06,059 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-03 16:48:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:48:06,059 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-03 16:48:06,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-12-03 16:48:06,060 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-03 16:48:06,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 16:48:06,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:48:06,060 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2018-12-03 16:48:06,060 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:48:06,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:48:06,061 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 70 times [2018-12-03 16:48:06,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:48:06,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:06,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:48:06,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:06,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:48:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:48:10,693 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 16:48:10,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:10,694 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:48:10,694 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:48:10,694 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:48:10,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:10,694 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:48:10,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:48:10,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:48:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:48:10,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:48:15,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:48:15,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:48:15,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:48:15,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:48:16,212 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 16:48:16,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:48:16,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:48:16,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:48:16,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:48:16,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:48:18,423 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 16:48:18,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:48:18,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 147 [2018-12-03 16:48:18,442 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:48:18,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-12-03 16:48:18,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-12-03 16:48:18,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=21317, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:48:18,443 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 148 states. [2018-12-03 16:48:29,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:48:29,334 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2018-12-03 16:48:29,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 16:48:29,335 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 98 [2018-12-03 16:48:29,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:48:29,335 INFO L225 Difference]: With dead ends: 150 [2018-12-03 16:48:29,336 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 16:48:29,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 110 SyntacticMatches, 35 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6444 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=928, Invalid=38078, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 16:48:29,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 16:48:29,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 16:48:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 16:48:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-12-03 16:48:29,418 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2018-12-03 16:48:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:48:29,419 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-12-03 16:48:29,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-12-03 16:48:29,419 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-12-03 16:48:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 16:48:29,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:48:29,419 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1] [2018-12-03 16:48:29,420 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:48:29,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:48:29,420 INFO L82 PathProgramCache]: Analyzing trace with hash 634997196, now seen corresponding path program 71 times [2018-12-03 16:48:29,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:48:29,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:29,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:48:29,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:29,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:48:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:48:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:30,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:30,384 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:48:30,384 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:48:30,384 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:48:30,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:30,384 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:48:30,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:48:30,392 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:48:30,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 16:48:30,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:48:30,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:48:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:30,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:48:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:32,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:48:32,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2018-12-03 16:48:32,940 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:48:32,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:48:32,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:48:32,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:48:32,941 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 51 states. [2018-12-03 16:48:34,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:48:34,046 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-12-03 16:48:34,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 16:48:34,047 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2018-12-03 16:48:34,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:48:34,047 INFO L225 Difference]: With dead ends: 103 [2018-12-03 16:48:34,047 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 16:48:34,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 149 SyntacticMatches, 96 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 16:48:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 16:48:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 16:48:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 16:48:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-12-03 16:48:34,148 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 99 [2018-12-03 16:48:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:48:34,148 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-12-03 16:48:34,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:48:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-12-03 16:48:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 16:48:34,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:48:34,149 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2018-12-03 16:48:34,149 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:48:34,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:48:34,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 72 times [2018-12-03 16:48:34,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:48:34,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:34,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:48:34,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:34,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:48:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:48:39,112 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 16:48:39,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:39,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:48:39,112 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:48:39,112 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:48:39,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:39,113 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:48:39,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:48:39,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:48:39,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:48:39,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:48:39,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:48:44,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:48:44,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:48:44,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:48:44,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:48:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-03 16:48:45,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:48:45,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:48:45,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:48:45,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:48:45,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:48:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-03 16:48:51,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:48:51,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 51, 51] total 198 [2018-12-03 16:48:51,987 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:48:51,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-12-03 16:48:51,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-12-03 16:48:51,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5098, Invalid=33908, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 16:48:51,989 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 149 states. [2018-12-03 16:49:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:07,421 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-12-03 16:49:07,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-12-03 16:49:07,421 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 100 [2018-12-03 16:49:07,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:07,422 INFO L225 Difference]: With dead ends: 155 [2018-12-03 16:49:07,422 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 16:49:07,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=7963, Invalid=54787, Unknown=0, NotChecked=0, Total=62750 [2018-12-03 16:49:07,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 16:49:07,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 16:49:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 16:49:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-03 16:49:07,506 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2018-12-03 16:49:07,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:07,506 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-03 16:49:07,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-12-03 16:49:07,506 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-03 16:49:07,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 16:49:07,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:07,506 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2018-12-03 16:49:07,507 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:07,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:07,507 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 73 times [2018-12-03 16:49:07,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:07,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:07,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:07,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:07,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:12,251 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 16:49:12,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:12,251 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:12,252 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:12,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 16:49:12,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:12,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 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:49:12,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:12,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:49:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:12,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:18,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:49:18,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:49:18,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:49:18,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:49:18,424 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 16:49:18,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:18,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:49:18,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:49:18,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:49:18,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:49:20,754 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 16:49:20,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:20,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 153 [2018-12-03 16:49:20,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:20,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-12-03 16:49:20,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-12-03 16:49:20,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=23105, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:49:20,774 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 154 states. [2018-12-03 16:49:32,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:32,594 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2018-12-03 16:49:32,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 16:49:32,595 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 102 [2018-12-03 16:49:32,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:32,596 INFO L225 Difference]: With dead ends: 156 [2018-12-03 16:49:32,596 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 16:49:32,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 114 SyntacticMatches, 37 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7014 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=966, Invalid=41264, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:49:32,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 16:49:32,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 16:49:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 16:49:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-12-03 16:49:32,684 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2018-12-03 16:49:32,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:32,685 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-12-03 16:49:32,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-12-03 16:49:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-12-03 16:49:32,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 16:49:32,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:32,685 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1] [2018-12-03 16:49:32,685 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:32,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:32,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1603948204, now seen corresponding path program 74 times [2018-12-03 16:49:32,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:32,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:32,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:32,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:32,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:33,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:33,992 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:33,992 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:33,992 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:49:33,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:33,992 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:49:34,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:49:34,000 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:49:34,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 16:49:34,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:34,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:34,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:36,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:36,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-12-03 16:49:36,590 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:36,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:49:36,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:49:36,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:49:36,591 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 53 states. [2018-12-03 16:49:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:37,764 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-12-03 16:49:37,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 16:49:37,765 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2018-12-03 16:49:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:37,765 INFO L225 Difference]: With dead ends: 107 [2018-12-03 16:49:37,765 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 16:49:37,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 155 SyntacticMatches, 100 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 16:49:37,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 16:49:37,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 16:49:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 16:49:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-03 16:49:37,861 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 103 [2018-12-03 16:49:37,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:37,862 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-03 16:49:37,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:49:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-03 16:49:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 16:49:37,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:37,862 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2018-12-03 16:49:37,863 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:37,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:37,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 75 times [2018-12-03 16:49:37,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:37,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:37,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:37,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:37,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:43,013 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 16:49:43,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:43,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:43,014 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:43,014 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:49:43,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:43,014 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:49:43,022 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:49:43,022 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:49:43,086 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:49:43,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:43,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:49,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:49:49,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:49:49,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:49:49,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:49:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-03 16:49:49,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:49,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:49:49,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:49:49,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:49:49,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:49:56,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-03 16:49:56,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:56,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 53, 53] total 206 [2018-12-03 16:49:56,991 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:56,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-12-03 16:49:56,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-12-03 16:49:56,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5510, Invalid=36720, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:49:56,992 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 155 states. [2018-12-03 16:50:12,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:12,846 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-12-03 16:50:12,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-12-03 16:50:12,847 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 104 [2018-12-03 16:50:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:12,847 INFO L225 Difference]: With dead ends: 161 [2018-12-03 16:50:12,847 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 16:50:12,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5458 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=8593, Invalid=59267, Unknown=0, NotChecked=0, Total=67860 [2018-12-03 16:50:12,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 16:50:12,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 16:50:12,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 16:50:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-12-03 16:50:12,934 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-12-03 16:50:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:12,934 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-12-03 16:50:12,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-12-03 16:50:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-12-03 16:50:12,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 16:50:12,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:12,935 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2018-12-03 16:50:12,935 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:12,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:12,935 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 76 times [2018-12-03 16:50:12,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:12,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:12,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:12,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:12,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:18,307 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 16:50:18,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:18,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:18,307 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:18,308 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:50:18,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:18,308 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:50:18,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:18,316 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:18,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:24,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:50:24,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:50:24,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:50:24,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:50:25,102 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 16:50:25,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:25,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:50:25,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:50:25,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:50:25,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:50:27,588 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 16:50:27,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:27,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 159 [2018-12-03 16:50:27,607 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:27,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-12-03 16:50:27,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-12-03 16:50:27,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=24965, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:50:27,608 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 160 states. [2018-12-03 16:50:39,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:39,829 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2018-12-03 16:50:39,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 16:50:39,830 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 106 [2018-12-03 16:50:39,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:39,830 INFO L225 Difference]: With dead ends: 162 [2018-12-03 16:50:39,831 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 16:50:39,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 118 SyntacticMatches, 39 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7608 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=1004, Invalid=44578, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 16:50:39,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 16:50:39,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 16:50:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 16:50:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-12-03 16:50:39,926 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 106 [2018-12-03 16:50:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:39,927 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-12-03 16:50:39,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-12-03 16:50:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-12-03 16:50:39,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 16:50:39,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:39,927 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1] [2018-12-03 16:50:39,927 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:39,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:39,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1354107788, now seen corresponding path program 77 times [2018-12-03 16:50:39,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:39,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:39,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:39,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:39,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:41,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:41,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:41,063 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:41,063 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:50:41,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:41,063 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:50:41,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:41,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:41,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 16:50:41,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:41,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:41,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:43,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:43,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2018-12-03 16:50:43,636 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:43,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 16:50:43,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 16:50:43,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 16:50:43,637 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 55 states. [2018-12-03 16:50:45,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:45,246 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2018-12-03 16:50:45,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 16:50:45,246 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2018-12-03 16:50:45,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:45,247 INFO L225 Difference]: With dead ends: 111 [2018-12-03 16:50:45,247 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:50:45,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 161 SyntacticMatches, 104 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 16:50:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:50:45,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 16:50:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 16:50:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-03 16:50:45,345 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2018-12-03 16:50:45,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:45,345 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-03 16:50:45,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 16:50:45,345 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-03 16:50:45,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 16:50:45,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:45,346 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2018-12-03 16:50:45,346 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:45,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:45,346 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 78 times [2018-12-03 16:50:45,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:45,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:45,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:45,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:45,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:50,941 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 16:50:50,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:50,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:50,942 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:50,942 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:50:50,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:50,942 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:50:50,962 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:50,962 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:51,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:51,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:51,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:57,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:50:57,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:50:57,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:50:57,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-03 16:50:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-03 16:50:57,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:58,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:50:58,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:50:58,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:50:58,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-03 16:51:06,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-03 16:51:06,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:06,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 55, 55] total 214 [2018-12-03 16:51:06,035 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:06,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-12-03 16:51:06,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-12-03 16:51:06,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5938, Invalid=39644, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 16:51:06,037 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 161 states. [2018-12-03 16:51:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:23,264 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2018-12-03 16:51:23,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-12-03 16:51:23,264 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 108 [2018-12-03 16:51:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:23,266 INFO L225 Difference]: With dead ends: 167 [2018-12-03 16:51:23,266 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 16:51:23,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5884 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=9247, Invalid=63923, Unknown=0, NotChecked=0, Total=73170 [2018-12-03 16:51:23,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 16:51:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 16:51:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 16:51:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-03 16:51:23,368 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-12-03 16:51:23,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:23,368 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-03 16:51:23,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-12-03 16:51:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-03 16:51:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 16:51:23,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:23,369 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2018-12-03 16:51:23,369 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:23,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:23,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 79 times [2018-12-03 16:51:23,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:23,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:23,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:23,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:23,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:29,123 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 16:51:29,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:29,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:29,124 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:29,124 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:51:29,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:29,124 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:51:29,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:29,133 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:29,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:36,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 16:51:36,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:51:36,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:51:36,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-03 16:51:36,271 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 16:51:36,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:36,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-03 16:51:36,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:51:36,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:51:36,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-03 16:51:39,020 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 16:51:39,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:39,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 165 [2018-12-03 16:51:39,039 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:39,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-12-03 16:51:39,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-12-03 16:51:39,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=26897, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:51:39,040 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 166 states. [2018-12-03 16:51:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:53,217 INFO L93 Difference]: Finished difference Result 168 states and 170 transitions. [2018-12-03 16:51:53,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 16:51:53,218 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 110 [2018-12-03 16:51:53,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:53,219 INFO L225 Difference]: With dead ends: 168 [2018-12-03 16:51:53,219 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 16:51:53,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 122 SyntacticMatches, 41 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8226 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=1042, Invalid=48020, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 16:51:53,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 16:51:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 16:51:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 16:51:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-12-03 16:51:53,322 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2018-12-03 16:51:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:53,322 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-12-03 16:51:53,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-12-03 16:51:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-12-03 16:51:53,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 16:51:53,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:53,323 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1] [2018-12-03 16:51:53,323 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:53,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:53,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1280933780, now seen corresponding path program 80 times [2018-12-03 16:51:53,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:53,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:53,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:53,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:53,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:54,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:54,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:54,546 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:54,547 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:51:54,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:54,547 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:51:54,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:54,555 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:55,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 16:51:55,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:55,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:55,245 INFO L316 TraceCheckSpWp]: Computing backward predicates...