java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --rcfgbuilder.command.for.external.solver 'z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000' -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --rcfgbuilder.size.of.a.code.block SingleStatement -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-7aa59a0 [2019-05-23 09:22:05,435 INFO L146 ILogger]: Resetting all preferences to default values... [2019-05-23 09:22:05,437 INFO L146 ILogger]: Resetting UltimateCore preferences to default values [2019-05-23 09:22:05,456 INFO L146 ILogger]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-23 09:22:05,456 INFO L146 ILogger]: Resetting Boogie Preprocessor preferences to default values [2019-05-23 09:22:05,458 INFO L146 ILogger]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-23 09:22:05,460 INFO L146 ILogger]: Resetting Abstract Interpretation preferences to default values [2019-05-23 09:22:05,463 INFO L146 ILogger]: Resetting LassoRanker preferences to default values [2019-05-23 09:22:05,466 INFO L146 ILogger]: Resetting Reaching Definitions preferences to default values [2019-05-23 09:22:05,467 INFO L146 ILogger]: Resetting SyntaxChecker preferences to default values [2019-05-23 09:22:05,469 INFO L146 ILogger]: Büchi Program Product provides no preferences, ignoring... [2019-05-23 09:22:05,470 INFO L146 ILogger]: Resetting LTL2Aut preferences to default values [2019-05-23 09:22:05,472 INFO L146 ILogger]: Resetting PEA to Boogie preferences to default values [2019-05-23 09:22:05,474 INFO L146 ILogger]: Resetting BlockEncodingV2 preferences to default values [2019-05-23 09:22:05,483 INFO L146 ILogger]: Resetting ChcToBoogie preferences to default values [2019-05-23 09:22:05,484 INFO L146 ILogger]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-23 09:22:05,485 INFO L146 ILogger]: Resetting BuchiAutomizer preferences to default values [2019-05-23 09:22:05,487 INFO L146 ILogger]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-23 09:22:05,492 INFO L146 ILogger]: Resetting CodeCheck preferences to default values [2019-05-23 09:22:05,494 INFO L146 ILogger]: Resetting InvariantSynthesis preferences to default values [2019-05-23 09:22:05,495 INFO L146 ILogger]: Resetting RCFGBuilder preferences to default values [2019-05-23 09:22:05,498 INFO L146 ILogger]: Resetting TraceAbstraction preferences to default values [2019-05-23 09:22:05,501 INFO L146 ILogger]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-23 09:22:05,502 INFO L146 ILogger]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-23 09:22:05,502 INFO L146 ILogger]: Resetting TreeAutomizer preferences to default values [2019-05-23 09:22:05,503 INFO L146 ILogger]: Resetting IcfgToChc preferences to default values [2019-05-23 09:22:05,503 INFO L146 ILogger]: Resetting IcfgTransformer preferences to default values [2019-05-23 09:22:05,504 INFO L146 ILogger]: ReqToTest provides no preferences, ignoring... [2019-05-23 09:22:05,506 INFO L146 ILogger]: Resetting Boogie Printer preferences to default values [2019-05-23 09:22:05,507 INFO L146 ILogger]: Resetting ChcSmtPrinter preferences to default values [2019-05-23 09:22:05,507 INFO L146 ILogger]: Resetting ReqPrinter preferences to default values [2019-05-23 09:22:05,510 INFO L146 ILogger]: Resetting Witness Printer preferences to default values [2019-05-23 09:22:05,511 INFO L146 ILogger]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-23 09:22:05,511 INFO L146 ILogger]: Resetting CDTParser preferences to default values [2019-05-23 09:22:05,512 INFO L146 ILogger]: AutomataScriptParser provides no preferences, ignoring... [2019-05-23 09:22:05,512 INFO L146 ILogger]: ReqParser provides no preferences, ignoring... [2019-05-23 09:22:05,513 INFO L146 ILogger]: Resetting SmtParser preferences to default values [2019-05-23 09:22:05,514 INFO L146 ILogger]: Resetting Witness Parser preferences to default values [2019-05-23 09:22:05,517 INFO L146 ILogger]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Command for external solver -> z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-23 09:22:05,559 INFO L146 ILogger]: Repository-Root is: /tmp [2019-05-23 09:22:05,574 INFO L146 ILogger]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-23 09:22:05,578 INFO L146 ILogger]: [Toolchain 1]: Toolchain selected. [2019-05-23 09:22:05,580 INFO L146 ILogger]: Initializing Boogie PL CUP Parser... [2019-05-23 09:22:05,580 INFO L146 ILogger]: Boogie PL CUP Parser initialized [2019-05-23 09:22:05,581 INFO L146 ILogger]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2019-05-23 09:22:05,581 INFO L146 ILogger]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2019-05-23 09:22:05,629 INFO L146 ILogger]: ####################### [Toolchain 1] ####################### [2019-05-23 09:22:05,631 INFO L146 ILogger]: Walking toolchain with 4 elements. [2019-05-23 09:22:05,631 INFO L146 ILogger]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-23 09:22:05,632 INFO L146 ILogger]: Initializing Boogie Procedure Inliner... [2019-05-23 09:22:05,632 INFO L146 ILogger]: Boogie Procedure Inliner initialized [2019-05-23 09:22:05,648 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,665 INFO L146 ILogger]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,674 WARN L146 ILogger]: Program contained no entry procedure! [2019-05-23 09:22:05,674 WARN L146 ILogger]: Missing entry procedures: [ULTIMATE.start] [2019-05-23 09:22:05,674 WARN L146 ILogger]: Fallback enabled. All procedures will be processed. [2019-05-23 09:22:05,678 INFO L146 ILogger]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-23 09:22:05,679 INFO L146 ILogger]: ------------------------Boogie Preprocessor---------------------------- [2019-05-23 09:22:05,679 INFO L146 ILogger]: Initializing Boogie Preprocessor... [2019-05-23 09:22:05,679 INFO L146 ILogger]: Boogie Preprocessor initialized [2019-05-23 09:22:05,691 INFO L146 ILogger]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,691 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,692 INFO L146 ILogger]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,693 INFO L146 ILogger]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,700 INFO L146 ILogger]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,705 INFO L146 ILogger]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,706 INFO L146 ILogger]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,707 INFO L146 ILogger]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-23 09:22:05,708 INFO L146 ILogger]: ------------------------RCFGBuilder---------------------------- [2019-05-23 09:22:05,708 INFO L146 ILogger]: Initializing RCFGBuilder... [2019-05-23 09:22:05,708 INFO L146 ILogger]: RCFGBuilder initialized [2019-05-23 09:22:05,709 INFO L146 ILogger]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (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:4096 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 [2019-05-23 09:22:05,780 INFO L146 ILogger]: Found specification of procedure main [2019-05-23 09:22:05,780 INFO L146 ILogger]: Found implementation of procedure main [2019-05-23 09:22:05,780 INFO L146 ILogger]: Found specification of procedure ~malloc [2019-05-23 09:22:06,006 INFO L146 ILogger]: Using library mode [2019-05-23 09:22:06,007 INFO L146 ILogger]: Removed 1 assume(true) statements. [2019-05-23 09:22:06,008 INFO L146 ILogger]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:22:06 BoogieIcfgContainer [2019-05-23 09:22:06,008 INFO L146 ILogger]: ------------------------ END RCFGBuilder---------------------------- [2019-05-23 09:22:06,010 INFO L146 ILogger]: ------------------------TraceAbstraction---------------------------- [2019-05-23 09:22:06,010 INFO L146 ILogger]: Initializing TraceAbstraction... [2019-05-23 09:22:06,013 INFO L146 ILogger]: TraceAbstraction initialized [2019-05-23 09:22:06,013 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/2) ... [2019-05-23 09:22:06,015 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6d028f and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.05 09:22:06, skipping insertion in model container [2019-05-23 09:22:06,015 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:22:06" (2/2) ... [2019-05-23 09:22:06,017 INFO L146 ILogger]: Analyzing ICFG PointerIncrement-simplified03.bpl [2019-05-23 09:22:06,026 INFO L146 ILogger]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-23 09:22:06,034 INFO L146 ILogger]: Appying trace abstraction to program that has 1 error locations. [2019-05-23 09:22:06,051 INFO L146 ILogger]: Starting to check reachability of 1 error locations. [2019-05-23 09:22:06,078 INFO L146 ILogger]: Using default assertion order modulation [2019-05-23 09:22:06,079 INFO L146 ILogger]: Interprodecural is true [2019-05-23 09:22:06,079 INFO L146 ILogger]: Hoare is false [2019-05-23 09:22:06,079 INFO L146 ILogger]: Compute interpolants for ForwardPredicates [2019-05-23 09:22:06,080 INFO L146 ILogger]: Backedges is STRAIGHT_LINE [2019-05-23 09:22:06,080 INFO L146 ILogger]: Determinization is PREDICATE_ABSTRACTION [2019-05-23 09:22:06,080 INFO L146 ILogger]: Difference is false [2019-05-23 09:22:06,080 INFO L146 ILogger]: Minimize is MINIMIZE_SEVPA [2019-05-23 09:22:06,080 INFO L146 ILogger]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-23 09:22:06,094 INFO L146 ILogger]: Start isEmpty. Operand 8 states. [2019-05-23 09:22:06,102 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 5 [2019-05-23 09:22:06,103 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:06,104 INFO L146 ILogger]: trace histogram [1, 1, 1, 1] [2019-05-23 09:22:06,106 INFO L146 ILogger]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:06,112 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:06,115 INFO L146 ILogger]: Analyzing trace with hash 924707, now seen corresponding path program 1 times [2019-05-23 09:22:06,166 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:06,215 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:06,219 INFO L146 ILogger]: Trace formula consists of 14 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 09:22:06,224 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:06,311 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:06,312 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:06,400 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:06,401 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:06,401 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:06,504 INFO L146 ILogger]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:06,507 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:22:06,507 INFO L146 ILogger]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-23 09:22:06,511 INFO L146 ILogger]: Interpolant automaton has 4 states [2019-05-23 09:22:06,524 INFO L146 ILogger]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-23 09:22:06,525 INFO L146 ILogger]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-23 09:22:06,528 INFO L146 ILogger]: Start difference. First operand 8 states. Second operand 4 states. [2019-05-23 09:22:06,633 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:06,633 INFO L146 ILogger]: Finished difference Result 13 states and 13 transitions. [2019-05-23 09:22:06,634 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-23 09:22:06,635 INFO L146 ILogger]: Start accepts. Automaton has 4 states. Word has length 4 [2019-05-23 09:22:06,636 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:06,646 INFO L146 ILogger]: With dead ends: 13 [2019-05-23 09:22:06,646 INFO L146 ILogger]: Without dead ends: 9 [2019-05-23 09:22:06,649 INFO L146 ILogger]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:22:06,663 INFO L146 ILogger]: Start minimizeSevpa. Operand 9 states. [2019-05-23 09:22:06,676 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-05-23 09:22:06,677 INFO L146 ILogger]: Start removeUnreachable. Operand 8 states. [2019-05-23 09:22:06,678 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-05-23 09:22:06,679 INFO L146 ILogger]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2019-05-23 09:22:06,679 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:06,680 INFO L146 ILogger]: Abstraction has 8 states and 8 transitions. [2019-05-23 09:22:06,680 INFO L146 ILogger]: Interpolant automaton has 4 states. [2019-05-23 09:22:06,680 INFO L146 ILogger]: Start isEmpty. Operand 8 states and 8 transitions. [2019-05-23 09:22:06,681 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 8 [2019-05-23 09:22:06,681 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:06,681 INFO L146 ILogger]: trace histogram [2, 1, 1, 1, 1, 1] [2019-05-23 09:22:06,681 INFO L146 ILogger]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:06,682 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:06,682 INFO L146 ILogger]: Analyzing trace with hash 1778184970, now seen corresponding path program 1 times [2019-05-23 09:22:06,684 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:06,700 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:06,702 INFO L146 ILogger]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-05-23 09:22:06,703 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:06,748 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:06,748 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:06,770 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:06,770 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:06,770 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:06,872 INFO L146 ILogger]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:06,873 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:06,873 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-05-23 09:22:06,875 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 09:22:06,875 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 09:22:06,875 INFO L146 ILogger]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:22:06,876 INFO L146 ILogger]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2019-05-23 09:22:07,080 WARN L146 ILogger]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-23 09:22:07,159 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:07,159 INFO L146 ILogger]: Finished difference Result 12 states and 12 transitions. [2019-05-23 09:22:07,160 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-23 09:22:07,160 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 7 [2019-05-23 09:22:07,160 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:07,161 INFO L146 ILogger]: With dead ends: 12 [2019-05-23 09:22:07,161 INFO L146 ILogger]: Without dead ends: 12 [2019-05-23 09:22:07,162 INFO L146 ILogger]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:22:07,162 INFO L146 ILogger]: Start minimizeSevpa. Operand 12 states. [2019-05-23 09:22:07,164 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-05-23 09:22:07,164 INFO L146 ILogger]: Start removeUnreachable. Operand 11 states. [2019-05-23 09:22:07,165 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-05-23 09:22:07,165 INFO L146 ILogger]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2019-05-23 09:22:07,165 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:07,165 INFO L146 ILogger]: Abstraction has 11 states and 11 transitions. [2019-05-23 09:22:07,166 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 09:22:07,166 INFO L146 ILogger]: Start isEmpty. Operand 11 states and 11 transitions. [2019-05-23 09:22:07,166 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 11 [2019-05-23 09:22:07,166 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:07,167 INFO L146 ILogger]: trace histogram [3, 2, 2, 1, 1, 1] [2019-05-23 09:22:07,167 INFO L146 ILogger]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:07,167 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:07,167 INFO L146 ILogger]: Analyzing trace with hash -218145085, now seen corresponding path program 2 times [2019-05-23 09:22:07,168 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:07,187 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:07,189 INFO L146 ILogger]: Trace formula consists of 26 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-23 09:22:07,191 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:07,218 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:07,218 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:07,239 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:07,240 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:07,240 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:07,328 INFO L146 ILogger]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:07,329 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:07,329 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-05-23 09:22:07,330 INFO L146 ILogger]: Interpolant automaton has 6 states [2019-05-23 09:22:07,330 INFO L146 ILogger]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-23 09:22:07,331 INFO L146 ILogger]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-05-23 09:22:07,331 INFO L146 ILogger]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2019-05-23 09:22:07,579 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:07,579 INFO L146 ILogger]: Finished difference Result 15 states and 15 transitions. [2019-05-23 09:22:07,579 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 09:22:07,579 INFO L146 ILogger]: Start accepts. Automaton has 6 states. Word has length 10 [2019-05-23 09:22:07,580 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:07,580 INFO L146 ILogger]: With dead ends: 15 [2019-05-23 09:22:07,580 INFO L146 ILogger]: Without dead ends: 15 [2019-05-23 09:22:07,582 INFO L146 ILogger]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:22:07,582 INFO L146 ILogger]: Start minimizeSevpa. Operand 15 states. [2019-05-23 09:22:07,584 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-05-23 09:22:07,585 INFO L146 ILogger]: Start removeUnreachable. Operand 14 states. [2019-05-23 09:22:07,585 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-05-23 09:22:07,585 INFO L146 ILogger]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2019-05-23 09:22:07,586 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:07,586 INFO L146 ILogger]: Abstraction has 14 states and 14 transitions. [2019-05-23 09:22:07,586 INFO L146 ILogger]: Interpolant automaton has 6 states. [2019-05-23 09:22:07,586 INFO L146 ILogger]: Start isEmpty. Operand 14 states and 14 transitions. [2019-05-23 09:22:07,587 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 14 [2019-05-23 09:22:07,587 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:07,587 INFO L146 ILogger]: trace histogram [4, 3, 3, 1, 1, 1] [2019-05-23 09:22:07,588 INFO L146 ILogger]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:07,588 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:07,588 INFO L146 ILogger]: Analyzing trace with hash -474665878, now seen corresponding path program 3 times [2019-05-23 09:22:07,589 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:07,611 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:07,614 INFO L146 ILogger]: Trace formula consists of 32 conjuncts, 15 conjunts are in the unsatisfiable core [2019-05-23 09:22:07,616 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:07,629 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:07,630 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:07,639 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:07,640 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:07,640 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:07,773 INFO L146 ILogger]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:07,774 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:07,774 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-23 09:22:07,774 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 09:22:07,775 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 09:22:07,776 INFO L146 ILogger]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:22:07,776 INFO L146 ILogger]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-05-23 09:22:08,097 WARN L146 ILogger]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-23 09:22:08,169 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:08,170 INFO L146 ILogger]: Finished difference Result 18 states and 18 transitions. [2019-05-23 09:22:08,170 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-05-23 09:22:08,170 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 13 [2019-05-23 09:22:08,171 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:08,171 INFO L146 ILogger]: With dead ends: 18 [2019-05-23 09:22:08,172 INFO L146 ILogger]: Without dead ends: 18 [2019-05-23 09:22:08,172 INFO L146 ILogger]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:08,173 INFO L146 ILogger]: Start minimizeSevpa. Operand 18 states. [2019-05-23 09:22:08,174 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-05-23 09:22:08,175 INFO L146 ILogger]: Start removeUnreachable. Operand 17 states. [2019-05-23 09:22:08,175 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-05-23 09:22:08,176 INFO L146 ILogger]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2019-05-23 09:22:08,176 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:08,176 INFO L146 ILogger]: Abstraction has 17 states and 17 transitions. [2019-05-23 09:22:08,176 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 09:22:08,176 INFO L146 ILogger]: Start isEmpty. Operand 17 states and 17 transitions. [2019-05-23 09:22:08,177 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 17 [2019-05-23 09:22:08,177 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:08,177 INFO L146 ILogger]: trace histogram [5, 4, 4, 1, 1, 1] [2019-05-23 09:22:08,178 INFO L146 ILogger]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:08,178 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:08,178 INFO L146 ILogger]: Analyzing trace with hash -1738790557, now seen corresponding path program 4 times [2019-05-23 09:22:08,179 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:08,219 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:08,224 INFO L146 ILogger]: Trace formula consists of 38 conjuncts, 18 conjunts are in the unsatisfiable core [2019-05-23 09:22:08,225 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:08,236 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:08,236 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:08,247 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:08,247 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:08,248 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:08,400 INFO L146 ILogger]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:08,401 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:08,401 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-05-23 09:22:08,402 INFO L146 ILogger]: Interpolant automaton has 8 states [2019-05-23 09:22:08,402 INFO L146 ILogger]: Constructing interpolant automaton starting with 8 interpolants. [2019-05-23 09:22:08,402 INFO L146 ILogger]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-05-23 09:22:08,403 INFO L146 ILogger]: Start difference. First operand 17 states and 17 transitions. Second operand 8 states. [2019-05-23 09:22:08,560 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:08,560 INFO L146 ILogger]: Finished difference Result 21 states and 21 transitions. [2019-05-23 09:22:08,564 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-05-23 09:22:08,564 INFO L146 ILogger]: Start accepts. Automaton has 8 states. Word has length 16 [2019-05-23 09:22:08,565 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:08,565 INFO L146 ILogger]: With dead ends: 21 [2019-05-23 09:22:08,565 INFO L146 ILogger]: Without dead ends: 21 [2019-05-23 09:22:08,566 INFO L146 ILogger]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:22:08,566 INFO L146 ILogger]: Start minimizeSevpa. Operand 21 states. [2019-05-23 09:22:08,568 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-05-23 09:22:08,569 INFO L146 ILogger]: Start removeUnreachable. Operand 20 states. [2019-05-23 09:22:08,569 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-05-23 09:22:08,570 INFO L146 ILogger]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2019-05-23 09:22:08,570 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:08,570 INFO L146 ILogger]: Abstraction has 20 states and 20 transitions. [2019-05-23 09:22:08,570 INFO L146 ILogger]: Interpolant automaton has 8 states. [2019-05-23 09:22:08,570 INFO L146 ILogger]: Start isEmpty. Operand 20 states and 20 transitions. [2019-05-23 09:22:08,571 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 20 [2019-05-23 09:22:08,571 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:08,571 INFO L146 ILogger]: trace histogram [6, 5, 5, 1, 1, 1] [2019-05-23 09:22:08,572 INFO L146 ILogger]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:08,572 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:08,572 INFO L146 ILogger]: Analyzing trace with hash 1291115978, now seen corresponding path program 5 times [2019-05-23 09:22:08,575 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:08,623 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:08,629 INFO L146 ILogger]: Trace formula consists of 44 conjuncts, 21 conjunts are in the unsatisfiable core [2019-05-23 09:22:08,630 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:08,671 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:08,672 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:08,682 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:08,683 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:08,683 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:08,807 INFO L146 ILogger]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:08,808 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:08,808 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 09:22:08,808 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 09:22:08,809 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 09:22:08,809 INFO L146 ILogger]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:22:08,809 INFO L146 ILogger]: Start difference. First operand 20 states and 20 transitions. Second operand 9 states. [2019-05-23 09:22:09,032 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,032 INFO L146 ILogger]: Finished difference Result 24 states and 24 transitions. [2019-05-23 09:22:09,033 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 09:22:09,033 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 19 [2019-05-23 09:22:09,033 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,034 INFO L146 ILogger]: With dead ends: 24 [2019-05-23 09:22:09,034 INFO L146 ILogger]: Without dead ends: 24 [2019-05-23 09:22:09,034 INFO L146 ILogger]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:09,035 INFO L146 ILogger]: Start minimizeSevpa. Operand 24 states. [2019-05-23 09:22:09,037 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-05-23 09:22:09,037 INFO L146 ILogger]: Start removeUnreachable. Operand 23 states. [2019-05-23 09:22:09,037 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-05-23 09:22:09,038 INFO L146 ILogger]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2019-05-23 09:22:09,038 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,038 INFO L146 ILogger]: Abstraction has 23 states and 23 transitions. [2019-05-23 09:22:09,038 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 09:22:09,038 INFO L146 ILogger]: Start isEmpty. Operand 23 states and 23 transitions. [2019-05-23 09:22:09,039 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 23 [2019-05-23 09:22:09,039 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,039 INFO L146 ILogger]: trace histogram [7, 6, 6, 1, 1, 1] [2019-05-23 09:22:09,039 INFO L146 ILogger]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,040 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,040 INFO L146 ILogger]: Analyzing trace with hash -2090959869, now seen corresponding path program 6 times [2019-05-23 09:22:09,041 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,066 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,069 INFO L146 ILogger]: Trace formula consists of 50 conjuncts, 24 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,071 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,094 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:09,095 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:09,108 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:09,108 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:09,109 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:09,267 INFO L146 ILogger]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:09,268 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:09,268 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-05-23 09:22:09,269 INFO L146 ILogger]: Interpolant automaton has 10 states [2019-05-23 09:22:09,269 INFO L146 ILogger]: Constructing interpolant automaton starting with 10 interpolants. [2019-05-23 09:22:09,269 INFO L146 ILogger]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-05-23 09:22:09,270 INFO L146 ILogger]: Start difference. First operand 23 states and 23 transitions. Second operand 10 states. [2019-05-23 09:22:09,435 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,435 INFO L146 ILogger]: Finished difference Result 27 states and 27 transitions. [2019-05-23 09:22:09,436 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-05-23 09:22:09,436 INFO L146 ILogger]: Start accepts. Automaton has 10 states. Word has length 22 [2019-05-23 09:22:09,436 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,437 INFO L146 ILogger]: With dead ends: 27 [2019-05-23 09:22:09,437 INFO L146 ILogger]: Without dead ends: 27 [2019-05-23 09:22:09,438 INFO L146 ILogger]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:22:09,439 INFO L146 ILogger]: Start minimizeSevpa. Operand 27 states. [2019-05-23 09:22:09,441 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-05-23 09:22:09,441 INFO L146 ILogger]: Start removeUnreachable. Operand 26 states. [2019-05-23 09:22:09,442 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-05-23 09:22:09,442 INFO L146 ILogger]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2019-05-23 09:22:09,442 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,443 INFO L146 ILogger]: Abstraction has 26 states and 26 transitions. [2019-05-23 09:22:09,443 INFO L146 ILogger]: Interpolant automaton has 10 states. [2019-05-23 09:22:09,443 INFO L146 ILogger]: Start isEmpty. Operand 26 states and 26 transitions. [2019-05-23 09:22:09,443 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 26 [2019-05-23 09:22:09,443 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,444 INFO L146 ILogger]: trace histogram [8, 7, 7, 1, 1, 1] [2019-05-23 09:22:09,444 INFO L146 ILogger]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,444 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,444 INFO L146 ILogger]: Analyzing trace with hash -1874720982, now seen corresponding path program 7 times [2019-05-23 09:22:09,445 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,468 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,470 INFO L146 ILogger]: Trace formula consists of 56 conjuncts, 27 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,472 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,486 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:09,487 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:09,499 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:09,500 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:09,500 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:09,637 INFO L146 ILogger]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:09,637 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:09,637 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 09:22:09,638 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 09:22:09,638 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 09:22:09,638 INFO L146 ILogger]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:09,638 INFO L146 ILogger]: Start difference. First operand 26 states and 26 transitions. Second operand 11 states. [2019-05-23 09:22:09,848 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,848 INFO L146 ILogger]: Finished difference Result 30 states and 30 transitions. [2019-05-23 09:22:09,849 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-05-23 09:22:09,849 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 25 [2019-05-23 09:22:09,849 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,850 INFO L146 ILogger]: With dead ends: 30 [2019-05-23 09:22:09,850 INFO L146 ILogger]: Without dead ends: 30 [2019-05-23 09:22:09,851 INFO L146 ILogger]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:09,851 INFO L146 ILogger]: Start minimizeSevpa. Operand 30 states. [2019-05-23 09:22:09,855 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-05-23 09:22:09,855 INFO L146 ILogger]: Start removeUnreachable. Operand 29 states. [2019-05-23 09:22:09,856 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-05-23 09:22:09,856 INFO L146 ILogger]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2019-05-23 09:22:09,856 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,856 INFO L146 ILogger]: Abstraction has 29 states and 29 transitions. [2019-05-23 09:22:09,856 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 09:22:09,856 INFO L146 ILogger]: Start isEmpty. Operand 29 states and 29 transitions. [2019-05-23 09:22:09,857 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 29 [2019-05-23 09:22:09,857 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,857 INFO L146 ILogger]: trace histogram [9, 8, 8, 1, 1, 1] [2019-05-23 09:22:09,858 INFO L146 ILogger]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,858 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,858 INFO L146 ILogger]: Analyzing trace with hash 1941984931, now seen corresponding path program 8 times [2019-05-23 09:22:09,859 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,886 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,889 INFO L146 ILogger]: Trace formula consists of 62 conjuncts, 30 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,891 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,906 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:09,906 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:09,916 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:09,916 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:09,917 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:10,308 INFO L146 ILogger]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:10,309 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:10,309 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-05-23 09:22:10,310 INFO L146 ILogger]: Interpolant automaton has 12 states [2019-05-23 09:22:10,310 INFO L146 ILogger]: Constructing interpolant automaton starting with 12 interpolants. [2019-05-23 09:22:10,310 INFO L146 ILogger]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-05-23 09:22:10,310 INFO L146 ILogger]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2019-05-23 09:22:10,535 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:10,535 INFO L146 ILogger]: Finished difference Result 33 states and 33 transitions. [2019-05-23 09:22:10,536 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 09:22:10,536 INFO L146 ILogger]: Start accepts. Automaton has 12 states. Word has length 28 [2019-05-23 09:22:10,536 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:10,537 INFO L146 ILogger]: With dead ends: 33 [2019-05-23 09:22:10,537 INFO L146 ILogger]: Without dead ends: 33 [2019-05-23 09:22:10,538 INFO L146 ILogger]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:22:10,539 INFO L146 ILogger]: Start minimizeSevpa. Operand 33 states. [2019-05-23 09:22:10,541 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-05-23 09:22:10,541 INFO L146 ILogger]: Start removeUnreachable. Operand 32 states. [2019-05-23 09:22:10,542 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-05-23 09:22:10,542 INFO L146 ILogger]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2019-05-23 09:22:10,543 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:10,543 INFO L146 ILogger]: Abstraction has 32 states and 32 transitions. [2019-05-23 09:22:10,543 INFO L146 ILogger]: Interpolant automaton has 12 states. [2019-05-23 09:22:10,543 INFO L146 ILogger]: Start isEmpty. Operand 32 states and 32 transitions. [2019-05-23 09:22:10,544 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 32 [2019-05-23 09:22:10,544 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:10,544 INFO L146 ILogger]: trace histogram [10, 9, 9, 1, 1, 1] [2019-05-23 09:22:10,544 INFO L146 ILogger]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:10,544 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:10,544 INFO L146 ILogger]: Analyzing trace with hash 463644810, now seen corresponding path program 9 times [2019-05-23 09:22:10,545 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:10,569 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:10,571 INFO L146 ILogger]: Trace formula consists of 68 conjuncts, 33 conjunts are in the unsatisfiable core [2019-05-23 09:22:10,573 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:10,604 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:10,604 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:10,683 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:10,684 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:10,684 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:11,022 INFO L146 ILogger]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:11,023 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:11,023 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 09:22:11,023 INFO L146 ILogger]: Interpolant automaton has 13 states [2019-05-23 09:22:11,024 INFO L146 ILogger]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-23 09:22:11,024 INFO L146 ILogger]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:22:11,024 INFO L146 ILogger]: Start difference. First operand 32 states and 32 transitions. Second operand 13 states. [2019-05-23 09:22:11,702 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:11,703 INFO L146 ILogger]: Finished difference Result 36 states and 36 transitions. [2019-05-23 09:22:11,704 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-05-23 09:22:11,704 INFO L146 ILogger]: Start accepts. Automaton has 13 states. Word has length 31 [2019-05-23 09:22:11,704 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:11,705 INFO L146 ILogger]: With dead ends: 36 [2019-05-23 09:22:11,705 INFO L146 ILogger]: Without dead ends: 36 [2019-05-23 09:22:11,705 INFO L146 ILogger]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:11,706 INFO L146 ILogger]: Start minimizeSevpa. Operand 36 states. [2019-05-23 09:22:11,708 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-05-23 09:22:11,708 INFO L146 ILogger]: Start removeUnreachable. Operand 35 states. [2019-05-23 09:22:11,709 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-05-23 09:22:11,709 INFO L146 ILogger]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 31 [2019-05-23 09:22:11,709 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:11,710 INFO L146 ILogger]: Abstraction has 35 states and 35 transitions. [2019-05-23 09:22:11,710 INFO L146 ILogger]: Interpolant automaton has 13 states. [2019-05-23 09:22:11,710 INFO L146 ILogger]: Start isEmpty. Operand 35 states and 35 transitions. [2019-05-23 09:22:11,711 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 35 [2019-05-23 09:22:11,711 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:11,711 INFO L146 ILogger]: trace histogram [11, 10, 10, 1, 1, 1] [2019-05-23 09:22:11,711 INFO L146 ILogger]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:11,711 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:11,712 INFO L146 ILogger]: Analyzing trace with hash -172246717, now seen corresponding path program 10 times [2019-05-23 09:22:11,712 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:11,736 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:11,738 INFO L146 ILogger]: Trace formula consists of 74 conjuncts, 36 conjunts are in the unsatisfiable core [2019-05-23 09:22:11,740 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:11,756 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:11,757 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:11,772 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:11,772 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:11,772 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:12,114 INFO L146 ILogger]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:12,114 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:12,115 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-05-23 09:22:12,115 INFO L146 ILogger]: Interpolant automaton has 14 states [2019-05-23 09:22:12,115 INFO L146 ILogger]: Constructing interpolant automaton starting with 14 interpolants. [2019-05-23 09:22:12,116 INFO L146 ILogger]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-05-23 09:22:12,116 INFO L146 ILogger]: Start difference. First operand 35 states and 35 transitions. Second operand 14 states. [2019-05-23 09:22:12,582 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:12,582 INFO L146 ILogger]: Finished difference Result 39 states and 39 transitions. [2019-05-23 09:22:12,583 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-05-23 09:22:12,584 INFO L146 ILogger]: Start accepts. Automaton has 14 states. Word has length 34 [2019-05-23 09:22:12,584 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:12,585 INFO L146 ILogger]: With dead ends: 39 [2019-05-23 09:22:12,585 INFO L146 ILogger]: Without dead ends: 39 [2019-05-23 09:22:12,586 INFO L146 ILogger]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:22:12,587 INFO L146 ILogger]: Start minimizeSevpa. Operand 39 states. [2019-05-23 09:22:12,589 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-05-23 09:22:12,589 INFO L146 ILogger]: Start removeUnreachable. Operand 38 states. [2019-05-23 09:22:12,590 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-05-23 09:22:12,590 INFO L146 ILogger]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 34 [2019-05-23 09:22:12,591 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:12,591 INFO L146 ILogger]: Abstraction has 38 states and 38 transitions. [2019-05-23 09:22:12,591 INFO L146 ILogger]: Interpolant automaton has 14 states. [2019-05-23 09:22:12,591 INFO L146 ILogger]: Start isEmpty. Operand 38 states and 38 transitions. [2019-05-23 09:22:12,592 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 38 [2019-05-23 09:22:12,592 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:12,592 INFO L146 ILogger]: trace histogram [12, 11, 11, 1, 1, 1] [2019-05-23 09:22:12,592 INFO L146 ILogger]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:12,593 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:12,593 INFO L146 ILogger]: Analyzing trace with hash 1084015082, now seen corresponding path program 11 times [2019-05-23 09:22:12,594 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:12,619 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:12,622 INFO L146 ILogger]: Trace formula consists of 80 conjuncts, 39 conjunts are in the unsatisfiable core [2019-05-23 09:22:12,624 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:12,651 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:12,651 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:12,657 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:12,658 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:12,665 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:12,831 INFO L146 ILogger]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:12,831 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:12,831 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-23 09:22:12,832 INFO L146 ILogger]: Interpolant automaton has 15 states [2019-05-23 09:22:12,832 INFO L146 ILogger]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-23 09:22:12,832 INFO L146 ILogger]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:12,833 INFO L146 ILogger]: Start difference. First operand 38 states and 38 transitions. Second operand 15 states. [2019-05-23 09:22:13,222 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:13,222 INFO L146 ILogger]: Finished difference Result 42 states and 42 transitions. [2019-05-23 09:22:13,223 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-23 09:22:13,223 INFO L146 ILogger]: Start accepts. Automaton has 15 states. Word has length 37 [2019-05-23 09:22:13,223 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:13,224 INFO L146 ILogger]: With dead ends: 42 [2019-05-23 09:22:13,224 INFO L146 ILogger]: Without dead ends: 42 [2019-05-23 09:22:13,225 INFO L146 ILogger]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:13,226 INFO L146 ILogger]: Start minimizeSevpa. Operand 42 states. [2019-05-23 09:22:13,229 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-05-23 09:22:13,230 INFO L146 ILogger]: Start removeUnreachable. Operand 41 states. [2019-05-23 09:22:13,230 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-05-23 09:22:13,231 INFO L146 ILogger]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 37 [2019-05-23 09:22:13,231 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:13,231 INFO L146 ILogger]: Abstraction has 41 states and 41 transitions. [2019-05-23 09:22:13,231 INFO L146 ILogger]: Interpolant automaton has 15 states. [2019-05-23 09:22:13,231 INFO L146 ILogger]: Start isEmpty. Operand 41 states and 41 transitions. [2019-05-23 09:22:13,232 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 41 [2019-05-23 09:22:13,232 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:13,232 INFO L146 ILogger]: trace histogram [13, 12, 12, 1, 1, 1] [2019-05-23 09:22:13,232 INFO L146 ILogger]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:13,233 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:13,233 INFO L146 ILogger]: Analyzing trace with hash 34251747, now seen corresponding path program 12 times [2019-05-23 09:22:13,234 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:13,258 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:13,261 INFO L146 ILogger]: Trace formula consists of 86 conjuncts, 42 conjunts are in the unsatisfiable core [2019-05-23 09:22:13,263 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:13,300 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:13,300 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:13,376 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:13,377 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:13,377 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:13,719 INFO L146 ILogger]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:13,720 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:13,720 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-05-23 09:22:13,720 INFO L146 ILogger]: Interpolant automaton has 16 states [2019-05-23 09:22:13,720 INFO L146 ILogger]: Constructing interpolant automaton starting with 16 interpolants. [2019-05-23 09:22:13,721 INFO L146 ILogger]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-05-23 09:22:13,721 INFO L146 ILogger]: Start difference. First operand 41 states and 41 transitions. Second operand 16 states. [2019-05-23 09:22:14,042 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:14,043 INFO L146 ILogger]: Finished difference Result 45 states and 45 transitions. [2019-05-23 09:22:14,043 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-05-23 09:22:14,043 INFO L146 ILogger]: Start accepts. Automaton has 16 states. Word has length 40 [2019-05-23 09:22:14,043 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:14,044 INFO L146 ILogger]: With dead ends: 45 [2019-05-23 09:22:14,044 INFO L146 ILogger]: Without dead ends: 45 [2019-05-23 09:22:14,045 INFO L146 ILogger]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:22:14,045 INFO L146 ILogger]: Start minimizeSevpa. Operand 45 states. [2019-05-23 09:22:14,048 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-05-23 09:22:14,048 INFO L146 ILogger]: Start removeUnreachable. Operand 44 states. [2019-05-23 09:22:14,049 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-05-23 09:22:14,049 INFO L146 ILogger]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 40 [2019-05-23 09:22:14,049 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:14,049 INFO L146 ILogger]: Abstraction has 44 states and 44 transitions. [2019-05-23 09:22:14,050 INFO L146 ILogger]: Interpolant automaton has 16 states. [2019-05-23 09:22:14,050 INFO L146 ILogger]: Start isEmpty. Operand 44 states and 44 transitions. [2019-05-23 09:22:14,050 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 44 [2019-05-23 09:22:14,050 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:14,051 INFO L146 ILogger]: trace histogram [14, 13, 13, 1, 1, 1] [2019-05-23 09:22:14,051 INFO L146 ILogger]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:14,051 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:14,051 INFO L146 ILogger]: Analyzing trace with hash -1808379062, now seen corresponding path program 13 times [2019-05-23 09:22:14,052 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:14,076 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:14,078 INFO L146 ILogger]: Trace formula consists of 92 conjuncts, 45 conjunts are in the unsatisfiable core [2019-05-23 09:22:14,080 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:14,114 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:14,115 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:14,132 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:14,133 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:14,133 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:14,501 INFO L146 ILogger]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:14,502 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:14,502 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-23 09:22:14,502 INFO L146 ILogger]: Interpolant automaton has 17 states [2019-05-23 09:22:14,503 INFO L146 ILogger]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-23 09:22:14,503 INFO L146 ILogger]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:22:14,503 INFO L146 ILogger]: Start difference. First operand 44 states and 44 transitions. Second operand 17 states. [2019-05-23 09:22:14,893 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:14,893 INFO L146 ILogger]: Finished difference Result 48 states and 48 transitions. [2019-05-23 09:22:14,894 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-05-23 09:22:14,894 INFO L146 ILogger]: Start accepts. Automaton has 17 states. Word has length 43 [2019-05-23 09:22:14,894 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:14,895 INFO L146 ILogger]: With dead ends: 48 [2019-05-23 09:22:14,895 INFO L146 ILogger]: Without dead ends: 48 [2019-05-23 09:22:14,896 INFO L146 ILogger]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:14,897 INFO L146 ILogger]: Start minimizeSevpa. Operand 48 states. [2019-05-23 09:22:14,899 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-05-23 09:22:14,899 INFO L146 ILogger]: Start removeUnreachable. Operand 47 states. [2019-05-23 09:22:14,900 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-05-23 09:22:14,900 INFO L146 ILogger]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 43 [2019-05-23 09:22:14,901 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:14,901 INFO L146 ILogger]: Abstraction has 47 states and 47 transitions. [2019-05-23 09:22:14,901 INFO L146 ILogger]: Interpolant automaton has 17 states. [2019-05-23 09:22:14,901 INFO L146 ILogger]: Start isEmpty. Operand 47 states and 47 transitions. [2019-05-23 09:22:14,901 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 47 [2019-05-23 09:22:14,902 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:14,902 INFO L146 ILogger]: trace histogram [15, 14, 14, 1, 1, 1] [2019-05-23 09:22:14,902 INFO L146 ILogger]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:14,902 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:14,902 INFO L146 ILogger]: Analyzing trace with hash -1645799805, now seen corresponding path program 14 times [2019-05-23 09:22:14,903 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:14,927 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:14,930 INFO L146 ILogger]: Trace formula consists of 98 conjuncts, 48 conjunts are in the unsatisfiable core [2019-05-23 09:22:14,932 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:14,972 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:14,973 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:14,993 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:14,993 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:14,994 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:15,243 INFO L146 ILogger]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:15,243 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:15,244 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-05-23 09:22:15,244 INFO L146 ILogger]: Interpolant automaton has 18 states [2019-05-23 09:22:15,244 INFO L146 ILogger]: Constructing interpolant automaton starting with 18 interpolants. [2019-05-23 09:22:15,245 INFO L146 ILogger]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2019-05-23 09:22:15,245 INFO L146 ILogger]: Start difference. First operand 47 states and 47 transitions. Second operand 18 states. [2019-05-23 09:22:15,640 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:15,641 INFO L146 ILogger]: Finished difference Result 51 states and 51 transitions. [2019-05-23 09:22:15,641 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-23 09:22:15,641 INFO L146 ILogger]: Start accepts. Automaton has 18 states. Word has length 46 [2019-05-23 09:22:15,642 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:15,642 INFO L146 ILogger]: With dead ends: 51 [2019-05-23 09:22:15,642 INFO L146 ILogger]: Without dead ends: 51 [2019-05-23 09:22:15,644 INFO L146 ILogger]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:22:15,644 INFO L146 ILogger]: Start minimizeSevpa. Operand 51 states. [2019-05-23 09:22:15,647 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-05-23 09:22:15,648 INFO L146 ILogger]: Start removeUnreachable. Operand 50 states. [2019-05-23 09:22:15,648 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-05-23 09:22:15,649 INFO L146 ILogger]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2019-05-23 09:22:15,649 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:15,649 INFO L146 ILogger]: Abstraction has 50 states and 50 transitions. [2019-05-23 09:22:15,649 INFO L146 ILogger]: Interpolant automaton has 18 states. [2019-05-23 09:22:15,649 INFO L146 ILogger]: Start isEmpty. Operand 50 states and 50 transitions. [2019-05-23 09:22:15,650 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 50 [2019-05-23 09:22:15,650 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:15,650 INFO L146 ILogger]: trace histogram [16, 15, 15, 1, 1, 1] [2019-05-23 09:22:15,651 INFO L146 ILogger]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:15,651 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:15,651 INFO L146 ILogger]: Analyzing trace with hash 1324702890, now seen corresponding path program 15 times [2019-05-23 09:22:15,652 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:15,678 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:15,681 INFO L146 ILogger]: Trace formula consists of 104 conjuncts, 51 conjunts are in the unsatisfiable core [2019-05-23 09:22:15,684 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:15,723 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:15,724 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:15,731 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:15,732 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:15,732 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:16,199 INFO L146 ILogger]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:16,199 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:16,199 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-23 09:22:16,200 INFO L146 ILogger]: Interpolant automaton has 19 states [2019-05-23 09:22:16,200 INFO L146 ILogger]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-23 09:22:16,200 INFO L146 ILogger]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:16,201 INFO L146 ILogger]: Start difference. First operand 50 states and 50 transitions. Second operand 19 states. [2019-05-23 09:22:16,617 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:16,617 INFO L146 ILogger]: Finished difference Result 54 states and 54 transitions. [2019-05-23 09:22:16,618 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-05-23 09:22:16,618 INFO L146 ILogger]: Start accepts. Automaton has 19 states. Word has length 49 [2019-05-23 09:22:16,618 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:16,619 INFO L146 ILogger]: With dead ends: 54 [2019-05-23 09:22:16,619 INFO L146 ILogger]: Without dead ends: 54 [2019-05-23 09:22:16,620 INFO L146 ILogger]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:16,620 INFO L146 ILogger]: Start minimizeSevpa. Operand 54 states. [2019-05-23 09:22:16,623 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-05-23 09:22:16,623 INFO L146 ILogger]: Start removeUnreachable. Operand 53 states. [2019-05-23 09:22:16,624 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-05-23 09:22:16,624 INFO L146 ILogger]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 49 [2019-05-23 09:22:16,624 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:16,624 INFO L146 ILogger]: Abstraction has 53 states and 53 transitions. [2019-05-23 09:22:16,624 INFO L146 ILogger]: Interpolant automaton has 19 states. [2019-05-23 09:22:16,624 INFO L146 ILogger]: Start isEmpty. Operand 53 states and 53 transitions. [2019-05-23 09:22:16,625 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 53 [2019-05-23 09:22:16,625 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:16,625 INFO L146 ILogger]: trace histogram [17, 16, 16, 1, 1, 1] [2019-05-23 09:22:16,626 INFO L146 ILogger]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:16,626 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:16,626 INFO L146 ILogger]: Analyzing trace with hash 2064322851, now seen corresponding path program 16 times [2019-05-23 09:22:16,627 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:16,649 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:16,651 INFO L146 ILogger]: Trace formula consists of 110 conjuncts, 54 conjunts are in the unsatisfiable core [2019-05-23 09:22:16,654 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:16,669 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:16,670 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:16,676 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:16,676 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:16,676 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:16,949 INFO L146 ILogger]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:16,950 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:16,950 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-05-23 09:22:16,950 INFO L146 ILogger]: Interpolant automaton has 20 states [2019-05-23 09:22:16,950 INFO L146 ILogger]: Constructing interpolant automaton starting with 20 interpolants. [2019-05-23 09:22:16,951 INFO L146 ILogger]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2019-05-23 09:22:16,951 INFO L146 ILogger]: Start difference. First operand 53 states and 53 transitions. Second operand 20 states. [2019-05-23 09:22:17,338 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:17,339 INFO L146 ILogger]: Finished difference Result 57 states and 57 transitions. [2019-05-23 09:22:17,342 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-05-23 09:22:17,342 INFO L146 ILogger]: Start accepts. Automaton has 20 states. Word has length 52 [2019-05-23 09:22:17,342 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:17,343 INFO L146 ILogger]: With dead ends: 57 [2019-05-23 09:22:17,343 INFO L146 ILogger]: Without dead ends: 57 [2019-05-23 09:22:17,344 INFO L146 ILogger]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:22:17,344 INFO L146 ILogger]: Start minimizeSevpa. Operand 57 states. [2019-05-23 09:22:17,347 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-05-23 09:22:17,347 INFO L146 ILogger]: Start removeUnreachable. Operand 56 states. [2019-05-23 09:22:17,348 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-05-23 09:22:17,348 INFO L146 ILogger]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 52 [2019-05-23 09:22:17,349 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:17,349 INFO L146 ILogger]: Abstraction has 56 states and 56 transitions. [2019-05-23 09:22:17,349 INFO L146 ILogger]: Interpolant automaton has 20 states. [2019-05-23 09:22:17,349 INFO L146 ILogger]: Start isEmpty. Operand 56 states and 56 transitions. [2019-05-23 09:22:17,350 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 56 [2019-05-23 09:22:17,350 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:17,350 INFO L146 ILogger]: trace histogram [18, 17, 17, 1, 1, 1] [2019-05-23 09:22:17,350 INFO L146 ILogger]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:17,350 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:17,351 INFO L146 ILogger]: Analyzing trace with hash -1394614774, now seen corresponding path program 17 times [2019-05-23 09:22:17,351 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:17,385 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:17,388 INFO L146 ILogger]: Trace formula consists of 116 conjuncts, 57 conjunts are in the unsatisfiable core [2019-05-23 09:22:17,399 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:17,433 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:17,433 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:17,489 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:17,489 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:17,490 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:17,951 INFO L146 ILogger]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:17,951 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:17,951 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-23 09:22:17,952 INFO L146 ILogger]: Interpolant automaton has 21 states [2019-05-23 09:22:17,952 INFO L146 ILogger]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-23 09:22:17,952 INFO L146 ILogger]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:22:17,952 INFO L146 ILogger]: Start difference. First operand 56 states and 56 transitions. Second operand 21 states. [2019-05-23 09:22:18,438 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:18,439 INFO L146 ILogger]: Finished difference Result 60 states and 60 transitions. [2019-05-23 09:22:18,439 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-23 09:22:18,439 INFO L146 ILogger]: Start accepts. Automaton has 21 states. Word has length 55 [2019-05-23 09:22:18,439 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:18,440 INFO L146 ILogger]: With dead ends: 60 [2019-05-23 09:22:18,440 INFO L146 ILogger]: Without dead ends: 60 [2019-05-23 09:22:18,442 INFO L146 ILogger]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:18,442 INFO L146 ILogger]: Start minimizeSevpa. Operand 60 states. [2019-05-23 09:22:18,444 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-05-23 09:22:18,445 INFO L146 ILogger]: Start removeUnreachable. Operand 59 states. [2019-05-23 09:22:18,445 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-05-23 09:22:18,445 INFO L146 ILogger]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 55 [2019-05-23 09:22:18,446 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:18,446 INFO L146 ILogger]: Abstraction has 59 states and 59 transitions. [2019-05-23 09:22:18,446 INFO L146 ILogger]: Interpolant automaton has 21 states. [2019-05-23 09:22:18,446 INFO L146 ILogger]: Start isEmpty. Operand 59 states and 59 transitions. [2019-05-23 09:22:18,447 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 59 [2019-05-23 09:22:18,447 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:18,447 INFO L146 ILogger]: trace histogram [19, 18, 18, 1, 1, 1] [2019-05-23 09:22:18,447 INFO L146 ILogger]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:18,447 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:18,448 INFO L146 ILogger]: Analyzing trace with hash -1750035517, now seen corresponding path program 18 times [2019-05-23 09:22:18,449 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:18,472 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:18,475 INFO L146 ILogger]: Trace formula consists of 122 conjuncts, 60 conjunts are in the unsatisfiable core [2019-05-23 09:22:18,477 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:18,514 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:18,515 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:18,536 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:18,537 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:18,537 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:18,835 INFO L146 ILogger]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:18,835 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:18,835 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-05-23 09:22:18,836 INFO L146 ILogger]: Interpolant automaton has 22 states [2019-05-23 09:22:18,836 INFO L146 ILogger]: Constructing interpolant automaton starting with 22 interpolants. [2019-05-23 09:22:18,836 INFO L146 ILogger]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2019-05-23 09:22:18,836 INFO L146 ILogger]: Start difference. First operand 59 states and 59 transitions. Second operand 22 states. [2019-05-23 09:22:19,410 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:19,410 INFO L146 ILogger]: Finished difference Result 63 states and 63 transitions. [2019-05-23 09:22:19,410 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-05-23 09:22:19,410 INFO L146 ILogger]: Start accepts. Automaton has 22 states. Word has length 58 [2019-05-23 09:22:19,411 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:19,411 INFO L146 ILogger]: With dead ends: 63 [2019-05-23 09:22:19,411 INFO L146 ILogger]: Without dead ends: 63 [2019-05-23 09:22:19,412 INFO L146 ILogger]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:22:19,413 INFO L146 ILogger]: Start minimizeSevpa. Operand 63 states. [2019-05-23 09:22:19,414 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-05-23 09:22:19,415 INFO L146 ILogger]: Start removeUnreachable. Operand 62 states. [2019-05-23 09:22:19,417 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-05-23 09:22:19,417 INFO L146 ILogger]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 58 [2019-05-23 09:22:19,417 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:19,418 INFO L146 ILogger]: Abstraction has 62 states and 62 transitions. [2019-05-23 09:22:19,418 INFO L146 ILogger]: Interpolant automaton has 22 states. [2019-05-23 09:22:19,418 INFO L146 ILogger]: Start isEmpty. Operand 62 states and 62 transitions. [2019-05-23 09:22:19,419 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 62 [2019-05-23 09:22:19,419 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:19,419 INFO L146 ILogger]: trace histogram [20, 19, 19, 1, 1, 1] [2019-05-23 09:22:19,419 INFO L146 ILogger]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:19,419 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:19,419 INFO L146 ILogger]: Analyzing trace with hash 1299961706, now seen corresponding path program 19 times [2019-05-23 09:22:19,420 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:19,444 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:19,447 INFO L146 ILogger]: Trace formula consists of 128 conjuncts, 63 conjunts are in the unsatisfiable core [2019-05-23 09:22:19,450 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:19,494 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:19,495 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:19,524 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:19,525 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:19,525 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:19,863 INFO L146 ILogger]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:19,863 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:19,863 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-23 09:22:19,863 INFO L146 ILogger]: Interpolant automaton has 23 states [2019-05-23 09:22:19,864 INFO L146 ILogger]: Constructing interpolant automaton starting with 23 interpolants. [2019-05-23 09:22:19,864 INFO L146 ILogger]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:19,864 INFO L146 ILogger]: Start difference. First operand 62 states and 62 transitions. Second operand 23 states. [2019-05-23 09:22:20,426 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:20,427 INFO L146 ILogger]: Finished difference Result 66 states and 66 transitions. [2019-05-23 09:22:20,427 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-05-23 09:22:20,427 INFO L146 ILogger]: Start accepts. Automaton has 23 states. Word has length 61 [2019-05-23 09:22:20,428 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:20,428 INFO L146 ILogger]: With dead ends: 66 [2019-05-23 09:22:20,428 INFO L146 ILogger]: Without dead ends: 66 [2019-05-23 09:22:20,430 INFO L146 ILogger]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:22:20,430 INFO L146 ILogger]: Start minimizeSevpa. Operand 66 states. [2019-05-23 09:22:20,433 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-05-23 09:22:20,433 INFO L146 ILogger]: Start removeUnreachable. Operand 65 states. [2019-05-23 09:22:20,433 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-05-23 09:22:20,433 INFO L146 ILogger]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 61 [2019-05-23 09:22:20,434 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:20,434 INFO L146 ILogger]: Abstraction has 65 states and 65 transitions. [2019-05-23 09:22:20,434 INFO L146 ILogger]: Interpolant automaton has 23 states. [2019-05-23 09:22:20,434 INFO L146 ILogger]: Start isEmpty. Operand 65 states and 65 transitions. [2019-05-23 09:22:20,434 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 65 [2019-05-23 09:22:20,434 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:20,434 INFO L146 ILogger]: trace histogram [21, 20, 20, 1, 1, 1] [2019-05-23 09:22:20,435 INFO L146 ILogger]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:20,435 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:20,435 INFO L146 ILogger]: Analyzing trace with hash -560882077, now seen corresponding path program 20 times [2019-05-23 09:22:20,436 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:20,457 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:20,460 INFO L146 ILogger]: Trace formula consists of 134 conjuncts, 66 conjunts are in the unsatisfiable core [2019-05-23 09:22:20,462 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:20,509 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:20,509 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:20,560 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:20,561 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:20,561 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:21,152 INFO L146 ILogger]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:21,152 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:21,153 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-05-23 09:22:21,153 INFO L146 ILogger]: Interpolant automaton has 24 states [2019-05-23 09:22:21,153 INFO L146 ILogger]: Constructing interpolant automaton starting with 24 interpolants. [2019-05-23 09:22:21,154 INFO L146 ILogger]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2019-05-23 09:22:21,154 INFO L146 ILogger]: Start difference. First operand 65 states and 65 transitions. Second operand 24 states. [2019-05-23 09:22:21,659 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:21,659 INFO L146 ILogger]: Finished difference Result 69 states and 69 transitions. [2019-05-23 09:22:21,659 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-23 09:22:21,660 INFO L146 ILogger]: Start accepts. Automaton has 24 states. Word has length 64 [2019-05-23 09:22:21,660 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:21,661 INFO L146 ILogger]: With dead ends: 69 [2019-05-23 09:22:21,661 INFO L146 ILogger]: Without dead ends: 69 [2019-05-23 09:22:21,662 INFO L146 ILogger]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=759, Invalid=1221, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:22:21,663 INFO L146 ILogger]: Start minimizeSevpa. Operand 69 states. [2019-05-23 09:22:21,665 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-05-23 09:22:21,665 INFO L146 ILogger]: Start removeUnreachable. Operand 68 states. [2019-05-23 09:22:21,665 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-05-23 09:22:21,666 INFO L146 ILogger]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 64 [2019-05-23 09:22:21,666 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:21,666 INFO L146 ILogger]: Abstraction has 68 states and 68 transitions. [2019-05-23 09:22:21,666 INFO L146 ILogger]: Interpolant automaton has 24 states. [2019-05-23 09:22:21,666 INFO L146 ILogger]: Start isEmpty. Operand 68 states and 68 transitions. [2019-05-23 09:22:21,667 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 68 [2019-05-23 09:22:21,667 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:21,667 INFO L146 ILogger]: trace histogram [22, 21, 21, 1, 1, 1] [2019-05-23 09:22:21,667 INFO L146 ILogger]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:21,667 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:21,668 INFO L146 ILogger]: Analyzing trace with hash -1815131958, now seen corresponding path program 21 times [2019-05-23 09:22:21,668 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:21,690 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:21,693 INFO L146 ILogger]: Trace formula consists of 140 conjuncts, 69 conjunts are in the unsatisfiable core [2019-05-23 09:22:21,695 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:21,730 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:21,731 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:21,737 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:21,738 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:21,738 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:23,655 INFO L146 ILogger]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:23,655 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:23,655 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-05-23 09:22:23,656 INFO L146 ILogger]: Interpolant automaton has 25 states [2019-05-23 09:22:23,656 INFO L146 ILogger]: Constructing interpolant automaton starting with 25 interpolants. [2019-05-23 09:22:23,656 INFO L146 ILogger]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:22:23,656 INFO L146 ILogger]: Start difference. First operand 68 states and 68 transitions. Second operand 25 states. [2019-05-23 09:22:24,228 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:24,229 INFO L146 ILogger]: Finished difference Result 72 states and 72 transitions. [2019-05-23 09:22:24,231 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-05-23 09:22:24,231 INFO L146 ILogger]: Start accepts. Automaton has 25 states. Word has length 67 [2019-05-23 09:22:24,232 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:24,232 INFO L146 ILogger]: With dead ends: 72 [2019-05-23 09:22:24,232 INFO L146 ILogger]: Without dead ends: 72 [2019-05-23 09:22:24,234 INFO L146 ILogger]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:22:24,234 INFO L146 ILogger]: Start minimizeSevpa. Operand 72 states. [2019-05-23 09:22:24,236 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-05-23 09:22:24,236 INFO L146 ILogger]: Start removeUnreachable. Operand 71 states. [2019-05-23 09:22:24,236 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-05-23 09:22:24,236 INFO L146 ILogger]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 67 [2019-05-23 09:22:24,237 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:24,237 INFO L146 ILogger]: Abstraction has 71 states and 71 transitions. [2019-05-23 09:22:24,237 INFO L146 ILogger]: Interpolant automaton has 25 states. [2019-05-23 09:22:24,237 INFO L146 ILogger]: Start isEmpty. Operand 71 states and 71 transitions. [2019-05-23 09:22:24,237 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 71 [2019-05-23 09:22:24,238 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:24,238 INFO L146 ILogger]: trace histogram [23, 22, 22, 1, 1, 1] [2019-05-23 09:22:24,238 INFO L146 ILogger]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:24,238 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:24,238 INFO L146 ILogger]: Analyzing trace with hash -957861629, now seen corresponding path program 22 times [2019-05-23 09:22:24,239 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:24,274 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:24,277 INFO L146 ILogger]: Trace formula consists of 146 conjuncts, 72 conjunts are in the unsatisfiable core [2019-05-23 09:22:24,280 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:24,319 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:24,320 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:24,340 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:24,340 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:24,340 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:24,721 INFO L146 ILogger]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:24,721 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:24,721 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-05-23 09:22:24,722 INFO L146 ILogger]: Interpolant automaton has 26 states [2019-05-23 09:22:24,722 INFO L146 ILogger]: Constructing interpolant automaton starting with 26 interpolants. [2019-05-23 09:22:24,722 INFO L146 ILogger]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2019-05-23 09:22:24,722 INFO L146 ILogger]: Start difference. First operand 71 states and 71 transitions. Second operand 26 states. [2019-05-23 09:22:25,281 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:25,281 INFO L146 ILogger]: Finished difference Result 75 states and 75 transitions. [2019-05-23 09:22:25,281 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-05-23 09:22:25,281 INFO L146 ILogger]: Start accepts. Automaton has 26 states. Word has length 70 [2019-05-23 09:22:25,282 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:25,283 INFO L146 ILogger]: With dead ends: 75 [2019-05-23 09:22:25,283 INFO L146 ILogger]: Without dead ends: 75 [2019-05-23 09:22:25,284 INFO L146 ILogger]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=900, Invalid=1452, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:22:25,284 INFO L146 ILogger]: Start minimizeSevpa. Operand 75 states. [2019-05-23 09:22:25,286 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-05-23 09:22:25,286 INFO L146 ILogger]: Start removeUnreachable. Operand 74 states. [2019-05-23 09:22:25,286 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-05-23 09:22:25,286 INFO L146 ILogger]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 70 [2019-05-23 09:22:25,287 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:25,287 INFO L146 ILogger]: Abstraction has 74 states and 74 transitions. [2019-05-23 09:22:25,287 INFO L146 ILogger]: Interpolant automaton has 26 states. [2019-05-23 09:22:25,287 INFO L146 ILogger]: Start isEmpty. Operand 74 states and 74 transitions. [2019-05-23 09:22:25,287 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 74 [2019-05-23 09:22:25,288 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:25,288 INFO L146 ILogger]: trace histogram [24, 23, 23, 1, 1, 1] [2019-05-23 09:22:25,288 INFO L146 ILogger]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:25,288 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:25,288 INFO L146 ILogger]: Analyzing trace with hash 106967594, now seen corresponding path program 23 times [2019-05-23 09:22:25,289 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:25,314 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:25,317 INFO L146 ILogger]: Trace formula consists of 152 conjuncts, 75 conjunts are in the unsatisfiable core [2019-05-23 09:22:25,319 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:25,358 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:25,358 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:25,431 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:25,431 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:25,431 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:25,925 INFO L146 ILogger]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:25,925 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:25,925 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-05-23 09:22:25,926 INFO L146 ILogger]: Interpolant automaton has 27 states [2019-05-23 09:22:25,926 INFO L146 ILogger]: Constructing interpolant automaton starting with 27 interpolants. [2019-05-23 09:22:25,926 INFO L146 ILogger]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:25,926 INFO L146 ILogger]: Start difference. First operand 74 states and 74 transitions. Second operand 27 states. [2019-05-23 09:22:26,741 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:26,742 INFO L146 ILogger]: Finished difference Result 78 states and 78 transitions. [2019-05-23 09:22:26,742 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-05-23 09:22:26,742 INFO L146 ILogger]: Start accepts. Automaton has 27 states. Word has length 73 [2019-05-23 09:22:26,743 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:26,743 INFO L146 ILogger]: With dead ends: 78 [2019-05-23 09:22:26,744 INFO L146 ILogger]: Without dead ends: 78 [2019-05-23 09:22:26,745 INFO L146 ILogger]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:22:26,745 INFO L146 ILogger]: Start minimizeSevpa. Operand 78 states. [2019-05-23 09:22:26,746 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-05-23 09:22:26,746 INFO L146 ILogger]: Start removeUnreachable. Operand 77 states. [2019-05-23 09:22:26,747 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-05-23 09:22:26,747 INFO L146 ILogger]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2019-05-23 09:22:26,747 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:26,747 INFO L146 ILogger]: Abstraction has 77 states and 77 transitions. [2019-05-23 09:22:26,747 INFO L146 ILogger]: Interpolant automaton has 27 states. [2019-05-23 09:22:26,747 INFO L146 ILogger]: Start isEmpty. Operand 77 states and 77 transitions. [2019-05-23 09:22:26,747 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 77 [2019-05-23 09:22:26,747 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:26,748 INFO L146 ILogger]: trace histogram [25, 24, 24, 1, 1, 1] [2019-05-23 09:22:26,748 INFO L146 ILogger]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:26,748 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:26,748 INFO L146 ILogger]: Analyzing trace with hash -194098269, now seen corresponding path program 24 times [2019-05-23 09:22:26,749 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:26,772 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:26,776 INFO L146 ILogger]: Trace formula consists of 158 conjuncts, 78 conjunts are in the unsatisfiable core [2019-05-23 09:22:26,777 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:26,817 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:26,818 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:26,837 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:26,838 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:26,838 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:27,221 INFO L146 ILogger]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:27,222 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:27,222 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-05-23 09:22:27,222 INFO L146 ILogger]: Interpolant automaton has 28 states [2019-05-23 09:22:27,222 INFO L146 ILogger]: Constructing interpolant automaton starting with 28 interpolants. [2019-05-23 09:22:27,223 INFO L146 ILogger]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2019-05-23 09:22:27,223 INFO L146 ILogger]: Start difference. First operand 77 states and 77 transitions. Second operand 28 states. [2019-05-23 09:22:27,948 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:27,949 INFO L146 ILogger]: Finished difference Result 81 states and 81 transitions. [2019-05-23 09:22:27,949 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-05-23 09:22:27,949 INFO L146 ILogger]: Start accepts. Automaton has 28 states. Word has length 76 [2019-05-23 09:22:27,949 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:27,950 INFO L146 ILogger]: With dead ends: 81 [2019-05-23 09:22:27,950 INFO L146 ILogger]: Without dead ends: 81 [2019-05-23 09:22:27,952 INFO L146 ILogger]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1053, Invalid=1703, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:22:27,952 INFO L146 ILogger]: Start minimizeSevpa. Operand 81 states. [2019-05-23 09:22:27,953 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-05-23 09:22:27,954 INFO L146 ILogger]: Start removeUnreachable. Operand 80 states. [2019-05-23 09:22:27,954 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-05-23 09:22:27,955 INFO L146 ILogger]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2019-05-23 09:22:27,955 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:27,955 INFO L146 ILogger]: Abstraction has 80 states and 80 transitions. [2019-05-23 09:22:27,955 INFO L146 ILogger]: Interpolant automaton has 28 states. [2019-05-23 09:22:27,955 INFO L146 ILogger]: Start isEmpty. Operand 80 states and 80 transitions. [2019-05-23 09:22:27,956 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 80 [2019-05-23 09:22:27,956 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:27,956 INFO L146 ILogger]: trace histogram [26, 25, 25, 1, 1, 1] [2019-05-23 09:22:27,956 INFO L146 ILogger]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:27,956 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:27,957 INFO L146 ILogger]: Analyzing trace with hash -1355508854, now seen corresponding path program 25 times [2019-05-23 09:22:27,957 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:27,983 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:27,987 INFO L146 ILogger]: Trace formula consists of 164 conjuncts, 81 conjunts are in the unsatisfiable core [2019-05-23 09:22:27,988 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:28,025 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:28,025 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:28,100 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:28,101 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:28,101 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:28,711 INFO L146 ILogger]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:28,711 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:28,711 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-05-23 09:22:28,712 INFO L146 ILogger]: Interpolant automaton has 29 states [2019-05-23 09:22:28,712 INFO L146 ILogger]: Constructing interpolant automaton starting with 29 interpolants. [2019-05-23 09:22:28,712 INFO L146 ILogger]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:22:28,712 INFO L146 ILogger]: Start difference. First operand 80 states and 80 transitions. Second operand 29 states. [2019-05-23 09:22:29,382 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:29,382 INFO L146 ILogger]: Finished difference Result 84 states and 84 transitions. [2019-05-23 09:22:29,382 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-05-23 09:22:29,383 INFO L146 ILogger]: Start accepts. Automaton has 29 states. Word has length 79 [2019-05-23 09:22:29,383 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:29,384 INFO L146 ILogger]: With dead ends: 84 [2019-05-23 09:22:29,384 INFO L146 ILogger]: Without dead ends: 84 [2019-05-23 09:22:29,386 INFO L146 ILogger]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:22:29,386 INFO L146 ILogger]: Start minimizeSevpa. Operand 84 states. [2019-05-23 09:22:29,387 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-05-23 09:22:29,387 INFO L146 ILogger]: Start removeUnreachable. Operand 83 states. [2019-05-23 09:22:29,388 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-05-23 09:22:29,388 INFO L146 ILogger]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2019-05-23 09:22:29,388 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:29,388 INFO L146 ILogger]: Abstraction has 83 states and 83 transitions. [2019-05-23 09:22:29,388 INFO L146 ILogger]: Interpolant automaton has 29 states. [2019-05-23 09:22:29,389 INFO L146 ILogger]: Start isEmpty. Operand 83 states and 83 transitions. [2019-05-23 09:22:29,389 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 83 [2019-05-23 09:22:29,389 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:29,389 INFO L146 ILogger]: trace histogram [27, 26, 26, 1, 1, 1] [2019-05-23 09:22:29,390 INFO L146 ILogger]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:29,390 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:29,390 INFO L146 ILogger]: Analyzing trace with hash -681710013, now seen corresponding path program 26 times [2019-05-23 09:22:29,391 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:29,416 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:29,420 INFO L146 ILogger]: Trace formula consists of 170 conjuncts, 84 conjunts are in the unsatisfiable core [2019-05-23 09:22:29,422 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:29,463 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:29,464 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:29,525 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:29,526 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:29,526 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:30,367 INFO L146 ILogger]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:30,367 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:30,368 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-05-23 09:22:30,368 INFO L146 ILogger]: Interpolant automaton has 30 states [2019-05-23 09:22:30,368 INFO L146 ILogger]: Constructing interpolant automaton starting with 30 interpolants. [2019-05-23 09:22:30,368 INFO L146 ILogger]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2019-05-23 09:22:30,369 INFO L146 ILogger]: Start difference. First operand 83 states and 83 transitions. Second operand 30 states. [2019-05-23 09:22:31,133 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:31,133 INFO L146 ILogger]: Finished difference Result 87 states and 87 transitions. [2019-05-23 09:22:31,133 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-23 09:22:31,134 INFO L146 ILogger]: Start accepts. Automaton has 30 states. Word has length 82 [2019-05-23 09:22:31,134 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:31,134 INFO L146 ILogger]: With dead ends: 87 [2019-05-23 09:22:31,134 INFO L146 ILogger]: Without dead ends: 87 [2019-05-23 09:22:31,135 INFO L146 ILogger]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1218, Invalid=1974, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:22:31,136 INFO L146 ILogger]: Start minimizeSevpa. Operand 87 states. [2019-05-23 09:22:31,137 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-05-23 09:22:31,137 INFO L146 ILogger]: Start removeUnreachable. Operand 86 states. [2019-05-23 09:22:31,138 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-05-23 09:22:31,138 INFO L146 ILogger]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2019-05-23 09:22:31,138 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:31,138 INFO L146 ILogger]: Abstraction has 86 states and 86 transitions. [2019-05-23 09:22:31,138 INFO L146 ILogger]: Interpolant automaton has 30 states. [2019-05-23 09:22:31,138 INFO L146 ILogger]: Start isEmpty. Operand 86 states and 86 transitions. [2019-05-23 09:22:31,139 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 86 [2019-05-23 09:22:31,139 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:31,139 INFO L146 ILogger]: trace histogram [28, 27, 27, 1, 1, 1] [2019-05-23 09:22:31,139 INFO L146 ILogger]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:31,139 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:31,139 INFO L146 ILogger]: Analyzing trace with hash 2077388010, now seen corresponding path program 27 times [2019-05-23 09:22:31,140 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:31,167 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:31,171 INFO L146 ILogger]: Trace formula consists of 176 conjuncts, 87 conjunts are in the unsatisfiable core [2019-05-23 09:22:31,173 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:31,212 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:31,212 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:31,278 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:31,279 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:31,279 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:31,900 INFO L146 ILogger]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:31,900 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:31,900 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-05-23 09:22:31,900 INFO L146 ILogger]: Interpolant automaton has 31 states [2019-05-23 09:22:31,901 INFO L146 ILogger]: Constructing interpolant automaton starting with 31 interpolants. [2019-05-23 09:22:31,901 INFO L146 ILogger]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:31,901 INFO L146 ILogger]: Start difference. First operand 86 states and 86 transitions. Second operand 31 states. [2019-05-23 09:22:32,714 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:32,714 INFO L146 ILogger]: Finished difference Result 90 states and 90 transitions. [2019-05-23 09:22:32,715 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-05-23 09:22:32,715 INFO L146 ILogger]: Start accepts. Automaton has 31 states. Word has length 85 [2019-05-23 09:22:32,715 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:32,716 INFO L146 ILogger]: With dead ends: 90 [2019-05-23 09:22:32,716 INFO L146 ILogger]: Without dead ends: 90 [2019-05-23 09:22:32,718 INFO L146 ILogger]: 0 DeclaredPredicates, 112 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:22:32,718 INFO L146 ILogger]: Start minimizeSevpa. Operand 90 states. [2019-05-23 09:22:32,720 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-05-23 09:22:32,720 INFO L146 ILogger]: Start removeUnreachable. Operand 89 states. [2019-05-23 09:22:32,720 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-05-23 09:22:32,721 INFO L146 ILogger]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2019-05-23 09:22:32,721 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:32,721 INFO L146 ILogger]: Abstraction has 89 states and 89 transitions. [2019-05-23 09:22:32,721 INFO L146 ILogger]: Interpolant automaton has 31 states. [2019-05-23 09:22:32,721 INFO L146 ILogger]: Start isEmpty. Operand 89 states and 89 transitions. [2019-05-23 09:22:32,722 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 89 [2019-05-23 09:22:32,722 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:32,722 INFO L146 ILogger]: trace histogram [29, 28, 28, 1, 1, 1] [2019-05-23 09:22:32,722 INFO L146 ILogger]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:32,723 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:32,723 INFO L146 ILogger]: Analyzing trace with hash 1282480355, now seen corresponding path program 28 times [2019-05-23 09:22:32,723 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:32,751 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:32,755 INFO L146 ILogger]: Trace formula consists of 182 conjuncts, 90 conjunts are in the unsatisfiable core [2019-05-23 09:22:32,757 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:32,801 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:32,801 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:32,872 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:32,872 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:32,872 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:33,523 INFO L146 ILogger]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:33,523 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:33,523 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-05-23 09:22:33,524 INFO L146 ILogger]: Interpolant automaton has 32 states [2019-05-23 09:22:33,524 INFO L146 ILogger]: Constructing interpolant automaton starting with 32 interpolants. [2019-05-23 09:22:33,524 INFO L146 ILogger]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2019-05-23 09:22:33,524 INFO L146 ILogger]: Start difference. First operand 89 states and 89 transitions. Second operand 32 states. [2019-05-23 09:22:34,352 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:34,352 INFO L146 ILogger]: Finished difference Result 93 states and 93 transitions. [2019-05-23 09:22:34,353 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-05-23 09:22:34,353 INFO L146 ILogger]: Start accepts. Automaton has 32 states. Word has length 88 [2019-05-23 09:22:34,353 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:34,354 INFO L146 ILogger]: With dead ends: 93 [2019-05-23 09:22:34,354 INFO L146 ILogger]: Without dead ends: 93 [2019-05-23 09:22:34,356 INFO L146 ILogger]: 0 DeclaredPredicates, 116 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1395, Invalid=2265, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:22:34,356 INFO L146 ILogger]: Start minimizeSevpa. Operand 93 states. [2019-05-23 09:22:34,358 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-05-23 09:22:34,358 INFO L146 ILogger]: Start removeUnreachable. Operand 92 states. [2019-05-23 09:22:34,359 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-05-23 09:22:34,359 INFO L146 ILogger]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2019-05-23 09:22:34,359 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:34,359 INFO L146 ILogger]: Abstraction has 92 states and 92 transitions. [2019-05-23 09:22:34,359 INFO L146 ILogger]: Interpolant automaton has 32 states. [2019-05-23 09:22:34,359 INFO L146 ILogger]: Start isEmpty. Operand 92 states and 92 transitions. [2019-05-23 09:22:34,360 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 92 [2019-05-23 09:22:34,360 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:34,360 INFO L146 ILogger]: trace histogram [30, 29, 29, 1, 1, 1] [2019-05-23 09:22:34,360 INFO L146 ILogger]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:34,361 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:34,361 INFO L146 ILogger]: Analyzing trace with hash -1656766902, now seen corresponding path program 29 times [2019-05-23 09:22:34,361 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:34,389 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:34,394 INFO L146 ILogger]: Trace formula consists of 188 conjuncts, 93 conjunts are in the unsatisfiable core [2019-05-23 09:22:34,396 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:34,436 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:34,436 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:34,509 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:34,510 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:34,510 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:35,355 INFO L146 ILogger]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:35,355 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:35,355 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-05-23 09:22:35,355 INFO L146 ILogger]: Interpolant automaton has 33 states [2019-05-23 09:22:35,356 INFO L146 ILogger]: Constructing interpolant automaton starting with 33 interpolants. [2019-05-23 09:22:35,356 INFO L146 ILogger]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:22:35,356 INFO L146 ILogger]: Start difference. First operand 92 states and 92 transitions. Second operand 33 states. [2019-05-23 09:22:36,277 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:36,277 INFO L146 ILogger]: Finished difference Result 96 states and 96 transitions. [2019-05-23 09:22:36,277 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-05-23 09:22:36,277 INFO L146 ILogger]: Start accepts. Automaton has 33 states. Word has length 91 [2019-05-23 09:22:36,278 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:36,278 INFO L146 ILogger]: With dead ends: 96 [2019-05-23 09:22:36,278 INFO L146 ILogger]: Without dead ends: 96 [2019-05-23 09:22:36,281 INFO L146 ILogger]: 0 DeclaredPredicates, 120 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:22:36,281 INFO L146 ILogger]: Start minimizeSevpa. Operand 96 states. [2019-05-23 09:22:36,283 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-05-23 09:22:36,283 INFO L146 ILogger]: Start removeUnreachable. Operand 95 states. [2019-05-23 09:22:36,283 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-05-23 09:22:36,283 INFO L146 ILogger]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2019-05-23 09:22:36,284 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:36,284 INFO L146 ILogger]: Abstraction has 95 states and 95 transitions. [2019-05-23 09:22:36,284 INFO L146 ILogger]: Interpolant automaton has 33 states. [2019-05-23 09:22:36,284 INFO L146 ILogger]: Start isEmpty. Operand 95 states and 95 transitions. [2019-05-23 09:22:36,284 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 95 [2019-05-23 09:22:36,284 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:36,285 INFO L146 ILogger]: trace histogram [31, 30, 30, 1, 1, 1] [2019-05-23 09:22:36,285 INFO L146 ILogger]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:36,285 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:36,285 INFO L146 ILogger]: Analyzing trace with hash 1021430659, now seen corresponding path program 30 times [2019-05-23 09:22:36,286 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:36,313 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:36,318 INFO L146 ILogger]: Trace formula consists of 194 conjuncts, 96 conjunts are in the unsatisfiable core [2019-05-23 09:22:36,320 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:36,360 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:36,360 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:36,421 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:36,422 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:36,422 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:37,165 INFO L146 ILogger]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:37,165 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:37,165 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-05-23 09:22:37,165 INFO L146 ILogger]: Interpolant automaton has 34 states [2019-05-23 09:22:37,166 INFO L146 ILogger]: Constructing interpolant automaton starting with 34 interpolants. [2019-05-23 09:22:37,166 INFO L146 ILogger]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 09:22:37,166 INFO L146 ILogger]: Start difference. First operand 95 states and 95 transitions. Second operand 34 states. [2019-05-23 09:22:38,068 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:38,068 INFO L146 ILogger]: Finished difference Result 99 states and 99 transitions. [2019-05-23 09:22:38,068 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-05-23 09:22:38,068 INFO L146 ILogger]: Start accepts. Automaton has 34 states. Word has length 94 [2019-05-23 09:22:38,069 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:38,070 INFO L146 ILogger]: With dead ends: 99 [2019-05-23 09:22:38,070 INFO L146 ILogger]: Without dead ends: 99 [2019-05-23 09:22:38,072 INFO L146 ILogger]: 0 DeclaredPredicates, 124 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1584, Invalid=2576, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:22:38,072 INFO L146 ILogger]: Start minimizeSevpa. Operand 99 states. [2019-05-23 09:22:38,074 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-05-23 09:22:38,074 INFO L146 ILogger]: Start removeUnreachable. Operand 98 states. [2019-05-23 09:22:38,074 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-05-23 09:22:38,074 INFO L146 ILogger]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 94 [2019-05-23 09:22:38,075 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:38,075 INFO L146 ILogger]: Abstraction has 98 states and 98 transitions. [2019-05-23 09:22:38,075 INFO L146 ILogger]: Interpolant automaton has 34 states. [2019-05-23 09:22:38,075 INFO L146 ILogger]: Start isEmpty. Operand 98 states and 98 transitions. [2019-05-23 09:22:38,075 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 98 [2019-05-23 09:22:38,075 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:38,075 INFO L146 ILogger]: trace histogram [32, 31, 31, 1, 1, 1] [2019-05-23 09:22:38,076 INFO L146 ILogger]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:38,076 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:38,076 INFO L146 ILogger]: Analyzing trace with hash -402487382, now seen corresponding path program 31 times [2019-05-23 09:22:38,077 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:38,106 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:38,111 INFO L146 ILogger]: Trace formula consists of 200 conjuncts, 99 conjunts are in the unsatisfiable core [2019-05-23 09:22:38,113 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:38,141 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:38,142 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:38,155 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:38,155 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:38,156 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:38,915 INFO L146 ILogger]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:38,915 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:38,915 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-05-23 09:22:38,916 INFO L146 ILogger]: Interpolant automaton has 35 states [2019-05-23 09:22:38,916 INFO L146 ILogger]: Constructing interpolant automaton starting with 35 interpolants. [2019-05-23 09:22:38,916 INFO L146 ILogger]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:38,916 INFO L146 ILogger]: Start difference. First operand 98 states and 98 transitions. Second operand 35 states. [2019-05-23 09:22:39,903 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:39,903 INFO L146 ILogger]: Finished difference Result 102 states and 102 transitions. [2019-05-23 09:22:39,904 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-05-23 09:22:39,904 INFO L146 ILogger]: Start accepts. Automaton has 35 states. Word has length 97 [2019-05-23 09:22:39,904 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:39,905 INFO L146 ILogger]: With dead ends: 102 [2019-05-23 09:22:39,905 INFO L146 ILogger]: Without dead ends: 102 [2019-05-23 09:22:39,906 INFO L146 ILogger]: 0 DeclaredPredicates, 128 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:22:39,907 INFO L146 ILogger]: Start minimizeSevpa. Operand 102 states. [2019-05-23 09:22:39,908 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-05-23 09:22:39,908 INFO L146 ILogger]: Start removeUnreachable. Operand 101 states. [2019-05-23 09:22:39,909 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-05-23 09:22:39,909 INFO L146 ILogger]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2019-05-23 09:22:39,909 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:39,909 INFO L146 ILogger]: Abstraction has 101 states and 101 transitions. [2019-05-23 09:22:39,909 INFO L146 ILogger]: Interpolant automaton has 35 states. [2019-05-23 09:22:39,909 INFO L146 ILogger]: Start isEmpty. Operand 101 states and 101 transitions. [2019-05-23 09:22:39,910 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 101 [2019-05-23 09:22:39,910 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:39,910 INFO L146 ILogger]: trace histogram [33, 32, 32, 1, 1, 1] [2019-05-23 09:22:39,910 INFO L146 ILogger]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:39,910 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:39,911 INFO L146 ILogger]: Analyzing trace with hash 1047135779, now seen corresponding path program 32 times [2019-05-23 09:22:39,911 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:39,941 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:39,946 INFO L146 ILogger]: Trace formula consists of 206 conjuncts, 102 conjunts are in the unsatisfiable core [2019-05-23 09:22:39,948 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:39,987 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:39,988 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:40,055 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:40,056 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:40,056 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:40,757 INFO L146 ILogger]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:40,758 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:40,758 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-05-23 09:22:40,758 INFO L146 ILogger]: Interpolant automaton has 36 states [2019-05-23 09:22:40,758 INFO L146 ILogger]: Constructing interpolant automaton starting with 36 interpolants. [2019-05-23 09:22:40,759 INFO L146 ILogger]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 09:22:40,759 INFO L146 ILogger]: Start difference. First operand 101 states and 101 transitions. Second operand 36 states. [2019-05-23 09:22:41,983 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:41,983 INFO L146 ILogger]: Finished difference Result 105 states and 105 transitions. [2019-05-23 09:22:41,983 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-23 09:22:41,983 INFO L146 ILogger]: Start accepts. Automaton has 36 states. Word has length 100 [2019-05-23 09:22:41,983 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:41,984 INFO L146 ILogger]: With dead ends: 105 [2019-05-23 09:22:41,984 INFO L146 ILogger]: Without dead ends: 105 [2019-05-23 09:22:41,985 INFO L146 ILogger]: 0 DeclaredPredicates, 132 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1785, Invalid=2907, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:22:41,985 INFO L146 ILogger]: Start minimizeSevpa. Operand 105 states. [2019-05-23 09:22:41,987 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-05-23 09:22:41,988 INFO L146 ILogger]: Start removeUnreachable. Operand 104 states. [2019-05-23 09:22:41,988 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-05-23 09:22:41,988 INFO L146 ILogger]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2019-05-23 09:22:41,989 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:41,989 INFO L146 ILogger]: Abstraction has 104 states and 104 transitions. [2019-05-23 09:22:41,989 INFO L146 ILogger]: Interpolant automaton has 36 states. [2019-05-23 09:22:41,989 INFO L146 ILogger]: Start isEmpty. Operand 104 states and 104 transitions. [2019-05-23 09:22:41,989 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 104 [2019-05-23 09:22:41,990 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:41,990 INFO L146 ILogger]: trace histogram [34, 33, 33, 1, 1, 1] [2019-05-23 09:22:41,990 INFO L146 ILogger]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:41,990 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:41,990 INFO L146 ILogger]: Analyzing trace with hash 874563850, now seen corresponding path program 33 times [2019-05-23 09:22:41,991 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:42,019 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:42,024 INFO L146 ILogger]: Trace formula consists of 212 conjuncts, 105 conjunts are in the unsatisfiable core [2019-05-23 09:22:42,027 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:42,066 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:42,066 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:42,083 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:42,083 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:42,084 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:42,750 INFO L146 ILogger]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:42,750 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:42,751 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-05-23 09:22:42,751 INFO L146 ILogger]: Interpolant automaton has 37 states [2019-05-23 09:22:42,751 INFO L146 ILogger]: Constructing interpolant automaton starting with 37 interpolants. [2019-05-23 09:22:42,752 INFO L146 ILogger]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:22:42,752 INFO L146 ILogger]: Start difference. First operand 104 states and 104 transitions. Second operand 37 states. [2019-05-23 09:22:43,819 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:43,820 INFO L146 ILogger]: Finished difference Result 108 states and 108 transitions. [2019-05-23 09:22:43,820 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-05-23 09:22:43,820 INFO L146 ILogger]: Start accepts. Automaton has 37 states. Word has length 103 [2019-05-23 09:22:43,821 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:43,822 INFO L146 ILogger]: With dead ends: 108 [2019-05-23 09:22:43,822 INFO L146 ILogger]: Without dead ends: 108 [2019-05-23 09:22:43,823 INFO L146 ILogger]: 0 DeclaredPredicates, 136 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:22:43,823 INFO L146 ILogger]: Start minimizeSevpa. Operand 108 states. [2019-05-23 09:22:43,825 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-05-23 09:22:43,825 INFO L146 ILogger]: Start removeUnreachable. Operand 107 states. [2019-05-23 09:22:43,826 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-05-23 09:22:43,826 INFO L146 ILogger]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 103 [2019-05-23 09:22:43,826 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:43,826 INFO L146 ILogger]: Abstraction has 107 states and 107 transitions. [2019-05-23 09:22:43,826 INFO L146 ILogger]: Interpolant automaton has 37 states. [2019-05-23 09:22:43,826 INFO L146 ILogger]: Start isEmpty. Operand 107 states and 107 transitions. [2019-05-23 09:22:43,827 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 107 [2019-05-23 09:22:43,827 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:43,827 INFO L146 ILogger]: trace histogram [35, 34, 34, 1, 1, 1] [2019-05-23 09:22:43,827 INFO L146 ILogger]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:43,828 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:43,828 INFO L146 ILogger]: Analyzing trace with hash 860080323, now seen corresponding path program 34 times [2019-05-23 09:22:43,828 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:43,859 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:43,865 INFO L146 ILogger]: Trace formula consists of 218 conjuncts, 108 conjunts are in the unsatisfiable core [2019-05-23 09:22:43,867 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:43,883 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:43,883 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:43,893 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:43,893 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:43,893 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:44,603 INFO L146 ILogger]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:44,603 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:44,603 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-05-23 09:22:44,604 INFO L146 ILogger]: Interpolant automaton has 38 states [2019-05-23 09:22:44,604 INFO L146 ILogger]: Constructing interpolant automaton starting with 38 interpolants. [2019-05-23 09:22:44,604 INFO L146 ILogger]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 09:22:44,604 INFO L146 ILogger]: Start difference. First operand 107 states and 107 transitions. Second operand 38 states. [2019-05-23 09:22:45,755 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:45,755 INFO L146 ILogger]: Finished difference Result 111 states and 111 transitions. [2019-05-23 09:22:45,756 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-05-23 09:22:45,756 INFO L146 ILogger]: Start accepts. Automaton has 38 states. Word has length 106 [2019-05-23 09:22:45,756 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:45,757 INFO L146 ILogger]: With dead ends: 111 [2019-05-23 09:22:45,757 INFO L146 ILogger]: Without dead ends: 111 [2019-05-23 09:22:45,758 INFO L146 ILogger]: 0 DeclaredPredicates, 140 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1998, Invalid=3258, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:22:45,758 INFO L146 ILogger]: Start minimizeSevpa. Operand 111 states. [2019-05-23 09:22:45,760 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-05-23 09:22:45,760 INFO L146 ILogger]: Start removeUnreachable. Operand 110 states. [2019-05-23 09:22:45,761 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-05-23 09:22:45,761 INFO L146 ILogger]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 106 [2019-05-23 09:22:45,761 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:45,761 INFO L146 ILogger]: Abstraction has 110 states and 110 transitions. [2019-05-23 09:22:45,761 INFO L146 ILogger]: Interpolant automaton has 38 states. [2019-05-23 09:22:45,762 INFO L146 ILogger]: Start isEmpty. Operand 110 states and 110 transitions. [2019-05-23 09:22:45,762 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 110 [2019-05-23 09:22:45,762 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:45,762 INFO L146 ILogger]: trace histogram [36, 35, 35, 1, 1, 1] [2019-05-23 09:22:45,762 INFO L146 ILogger]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:45,763 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:45,763 INFO L146 ILogger]: Analyzing trace with hash -1121942934, now seen corresponding path program 35 times [2019-05-23 09:22:45,763 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:45,791 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:45,797 INFO L146 ILogger]: Trace formula consists of 224 conjuncts, 111 conjunts are in the unsatisfiable core [2019-05-23 09:22:45,799 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:45,822 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:45,823 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:45,832 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:45,832 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:45,832 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:46,808 INFO L146 ILogger]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:46,808 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:46,808 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-05-23 09:22:46,809 INFO L146 ILogger]: Interpolant automaton has 39 states [2019-05-23 09:22:46,809 INFO L146 ILogger]: Constructing interpolant automaton starting with 39 interpolants. [2019-05-23 09:22:46,809 INFO L146 ILogger]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:46,809 INFO L146 ILogger]: Start difference. First operand 110 states and 110 transitions. Second operand 39 states. [2019-05-23 09:22:48,041 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:48,042 INFO L146 ILogger]: Finished difference Result 114 states and 114 transitions. [2019-05-23 09:22:48,042 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-05-23 09:22:48,042 INFO L146 ILogger]: Start accepts. Automaton has 39 states. Word has length 109 [2019-05-23 09:22:48,043 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:48,044 INFO L146 ILogger]: With dead ends: 114 [2019-05-23 09:22:48,044 INFO L146 ILogger]: Without dead ends: 114 [2019-05-23 09:22:48,045 INFO L146 ILogger]: 0 DeclaredPredicates, 144 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:22:48,045 INFO L146 ILogger]: Start minimizeSevpa. Operand 114 states. [2019-05-23 09:22:48,047 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-05-23 09:22:48,047 INFO L146 ILogger]: Start removeUnreachable. Operand 113 states. [2019-05-23 09:22:48,048 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-05-23 09:22:48,048 INFO L146 ILogger]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 109 [2019-05-23 09:22:48,048 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:48,048 INFO L146 ILogger]: Abstraction has 113 states and 113 transitions. [2019-05-23 09:22:48,048 INFO L146 ILogger]: Interpolant automaton has 39 states. [2019-05-23 09:22:48,048 INFO L146 ILogger]: Start isEmpty. Operand 113 states and 113 transitions. [2019-05-23 09:22:48,049 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 113 [2019-05-23 09:22:48,049 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:48,049 INFO L146 ILogger]: trace histogram [37, 36, 36, 1, 1, 1] [2019-05-23 09:22:48,050 INFO L146 ILogger]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:48,050 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:48,050 INFO L146 ILogger]: Analyzing trace with hash -366406813, now seen corresponding path program 36 times [2019-05-23 09:22:48,051 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:48,081 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:48,087 INFO L146 ILogger]: Trace formula consists of 230 conjuncts, 114 conjunts are in the unsatisfiable core [2019-05-23 09:22:48,090 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:48,126 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:48,127 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:48,201 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:48,202 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:48,202 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:49,048 INFO L146 ILogger]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:49,048 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:49,048 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-05-23 09:22:49,048 INFO L146 ILogger]: Interpolant automaton has 40 states [2019-05-23 09:22:49,049 INFO L146 ILogger]: Constructing interpolant automaton starting with 40 interpolants. [2019-05-23 09:22:49,049 INFO L146 ILogger]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 09:22:49,049 INFO L146 ILogger]: Start difference. First operand 113 states and 113 transitions. Second operand 40 states. [2019-05-23 09:22:50,201 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:50,201 INFO L146 ILogger]: Finished difference Result 117 states and 117 transitions. [2019-05-23 09:22:50,201 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-05-23 09:22:50,202 INFO L146 ILogger]: Start accepts. Automaton has 40 states. Word has length 112 [2019-05-23 09:22:50,202 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:50,203 INFO L146 ILogger]: With dead ends: 117 [2019-05-23 09:22:50,203 INFO L146 ILogger]: Without dead ends: 117 [2019-05-23 09:22:50,204 INFO L146 ILogger]: 0 DeclaredPredicates, 148 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2223, Invalid=3629, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:22:50,204 INFO L146 ILogger]: Start minimizeSevpa. Operand 117 states. [2019-05-23 09:22:50,206 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-05-23 09:22:50,206 INFO L146 ILogger]: Start removeUnreachable. Operand 116 states. [2019-05-23 09:22:50,207 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-05-23 09:22:50,207 INFO L146 ILogger]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 112 [2019-05-23 09:22:50,207 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:50,207 INFO L146 ILogger]: Abstraction has 116 states and 116 transitions. [2019-05-23 09:22:50,207 INFO L146 ILogger]: Interpolant automaton has 40 states. [2019-05-23 09:22:50,207 INFO L146 ILogger]: Start isEmpty. Operand 116 states and 116 transitions. [2019-05-23 09:22:50,208 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 116 [2019-05-23 09:22:50,208 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:50,208 INFO L146 ILogger]: trace histogram [38, 37, 37, 1, 1, 1] [2019-05-23 09:22:50,208 INFO L146 ILogger]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:50,209 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:50,209 INFO L146 ILogger]: Analyzing trace with hash -2113424438, now seen corresponding path program 37 times [2019-05-23 09:22:50,209 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:50,241 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:50,248 INFO L146 ILogger]: Trace formula consists of 236 conjuncts, 117 conjunts are in the unsatisfiable core [2019-05-23 09:22:50,250 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:50,287 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:50,288 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:50,346 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:50,347 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:50,347 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:51,338 INFO L146 ILogger]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:51,338 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:51,338 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-05-23 09:22:51,339 INFO L146 ILogger]: Interpolant automaton has 41 states [2019-05-23 09:22:51,339 INFO L146 ILogger]: Constructing interpolant automaton starting with 41 interpolants. [2019-05-23 09:22:51,339 INFO L146 ILogger]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:22:51,340 INFO L146 ILogger]: Start difference. First operand 116 states and 116 transitions. Second operand 41 states. [2019-05-23 09:22:52,680 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:52,681 INFO L146 ILogger]: Finished difference Result 120 states and 120 transitions. [2019-05-23 09:22:52,681 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-05-23 09:22:52,681 INFO L146 ILogger]: Start accepts. Automaton has 41 states. Word has length 115 [2019-05-23 09:22:52,682 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:52,682 INFO L146 ILogger]: With dead ends: 120 [2019-05-23 09:22:52,683 INFO L146 ILogger]: Without dead ends: 120 [2019-05-23 09:22:52,683 INFO L146 ILogger]: 0 DeclaredPredicates, 152 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:22:52,684 INFO L146 ILogger]: Start minimizeSevpa. Operand 120 states. [2019-05-23 09:22:52,686 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-05-23 09:22:52,686 INFO L146 ILogger]: Start removeUnreachable. Operand 119 states. [2019-05-23 09:22:52,687 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-05-23 09:22:52,687 INFO L146 ILogger]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 115 [2019-05-23 09:22:52,687 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:52,687 INFO L146 ILogger]: Abstraction has 119 states and 119 transitions. [2019-05-23 09:22:52,687 INFO L146 ILogger]: Interpolant automaton has 41 states. [2019-05-23 09:22:52,688 INFO L146 ILogger]: Start isEmpty. Operand 119 states and 119 transitions. [2019-05-23 09:22:52,688 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 119 [2019-05-23 09:22:52,688 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:52,688 INFO L146 ILogger]: trace histogram [39, 38, 38, 1, 1, 1] [2019-05-23 09:22:52,689 INFO L146 ILogger]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:52,689 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:52,689 INFO L146 ILogger]: Analyzing trace with hash -1101797885, now seen corresponding path program 38 times [2019-05-23 09:22:52,690 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:52,724 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:52,731 INFO L146 ILogger]: Trace formula consists of 242 conjuncts, 120 conjunts are in the unsatisfiable core [2019-05-23 09:22:52,733 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:52,775 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:52,775 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:52,790 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:52,791 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:52,791 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:53,725 INFO L146 ILogger]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:53,726 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:53,726 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-05-23 09:22:53,726 INFO L146 ILogger]: Interpolant automaton has 42 states [2019-05-23 09:22:53,726 INFO L146 ILogger]: Constructing interpolant automaton starting with 42 interpolants. [2019-05-23 09:22:53,726 INFO L146 ILogger]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 09:22:53,727 INFO L146 ILogger]: Start difference. First operand 119 states and 119 transitions. Second operand 42 states. [2019-05-23 09:22:55,027 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:55,028 INFO L146 ILogger]: Finished difference Result 123 states and 123 transitions. [2019-05-23 09:22:55,028 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-23 09:22:55,028 INFO L146 ILogger]: Start accepts. Automaton has 42 states. Word has length 118 [2019-05-23 09:22:55,029 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:55,030 INFO L146 ILogger]: With dead ends: 123 [2019-05-23 09:22:55,030 INFO L146 ILogger]: Without dead ends: 123 [2019-05-23 09:22:55,031 INFO L146 ILogger]: 0 DeclaredPredicates, 156 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2460, Invalid=4020, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:22:55,032 INFO L146 ILogger]: Start minimizeSevpa. Operand 123 states. [2019-05-23 09:22:55,033 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-05-23 09:22:55,033 INFO L146 ILogger]: Start removeUnreachable. Operand 122 states. [2019-05-23 09:22:55,034 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-05-23 09:22:55,034 INFO L146 ILogger]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 118 [2019-05-23 09:22:55,034 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:55,034 INFO L146 ILogger]: Abstraction has 122 states and 122 transitions. [2019-05-23 09:22:55,035 INFO L146 ILogger]: Interpolant automaton has 42 states. [2019-05-23 09:22:55,035 INFO L146 ILogger]: Start isEmpty. Operand 122 states and 122 transitions. [2019-05-23 09:22:55,035 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 122 [2019-05-23 09:22:55,035 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:55,035 INFO L146 ILogger]: trace histogram [40, 39, 39, 1, 1, 1] [2019-05-23 09:22:55,036 INFO L146 ILogger]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:55,036 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:55,036 INFO L146 ILogger]: Analyzing trace with hash -1520673494, now seen corresponding path program 39 times [2019-05-23 09:22:55,037 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:55,072 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:55,079 INFO L146 ILogger]: Trace formula consists of 248 conjuncts, 123 conjunts are in the unsatisfiable core [2019-05-23 09:22:55,082 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:55,102 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:55,103 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:55,109 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:55,109 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:55,110 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:56,036 INFO L146 ILogger]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:56,036 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:56,037 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-05-23 09:22:56,037 INFO L146 ILogger]: Interpolant automaton has 43 states [2019-05-23 09:22:56,037 INFO L146 ILogger]: Constructing interpolant automaton starting with 43 interpolants. [2019-05-23 09:22:56,037 INFO L146 ILogger]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:22:56,037 INFO L146 ILogger]: Start difference. First operand 122 states and 122 transitions. Second operand 43 states. [2019-05-23 09:22:57,601 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:57,601 INFO L146 ILogger]: Finished difference Result 126 states and 126 transitions. [2019-05-23 09:22:57,602 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-05-23 09:22:57,602 INFO L146 ILogger]: Start accepts. Automaton has 43 states. Word has length 121 [2019-05-23 09:22:57,602 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:57,603 INFO L146 ILogger]: With dead ends: 126 [2019-05-23 09:22:57,603 INFO L146 ILogger]: Without dead ends: 126 [2019-05-23 09:22:57,604 INFO L146 ILogger]: 0 DeclaredPredicates, 160 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:22:57,604 INFO L146 ILogger]: Start minimizeSevpa. Operand 126 states. [2019-05-23 09:22:57,606 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-05-23 09:22:57,606 INFO L146 ILogger]: Start removeUnreachable. Operand 125 states. [2019-05-23 09:22:57,607 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-05-23 09:22:57,607 INFO L146 ILogger]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 121 [2019-05-23 09:22:57,607 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:57,607 INFO L146 ILogger]: Abstraction has 125 states and 125 transitions. [2019-05-23 09:22:57,608 INFO L146 ILogger]: Interpolant automaton has 43 states. [2019-05-23 09:22:57,608 INFO L146 ILogger]: Start isEmpty. Operand 125 states and 125 transitions. [2019-05-23 09:22:57,608 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 125 [2019-05-23 09:22:57,608 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:57,608 INFO L146 ILogger]: trace histogram [41, 40, 40, 1, 1, 1] [2019-05-23 09:22:57,609 INFO L146 ILogger]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:57,609 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:57,609 INFO L146 ILogger]: Analyzing trace with hash 931020963, now seen corresponding path program 40 times [2019-05-23 09:22:57,609 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:57,645 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:57,653 INFO L146 ILogger]: Trace formula consists of 254 conjuncts, 126 conjunts are in the unsatisfiable core [2019-05-23 09:22:57,656 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:57,696 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:57,696 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:57,769 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:57,769 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:57,770 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:58,713 INFO L146 ILogger]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:58,713 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:58,714 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-05-23 09:22:58,714 INFO L146 ILogger]: Interpolant automaton has 44 states [2019-05-23 09:22:58,714 INFO L146 ILogger]: Constructing interpolant automaton starting with 44 interpolants. [2019-05-23 09:22:58,714 INFO L146 ILogger]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 09:22:58,714 INFO L146 ILogger]: Start difference. First operand 125 states and 125 transitions. Second operand 44 states. [2019-05-23 09:23:00,127 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:00,127 INFO L146 ILogger]: Finished difference Result 129 states and 129 transitions. [2019-05-23 09:23:00,131 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-05-23 09:23:00,132 INFO L146 ILogger]: Start accepts. Automaton has 44 states. Word has length 124 [2019-05-23 09:23:00,132 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:00,133 INFO L146 ILogger]: With dead ends: 129 [2019-05-23 09:23:00,133 INFO L146 ILogger]: Without dead ends: 129 [2019-05-23 09:23:00,134 INFO L146 ILogger]: 0 DeclaredPredicates, 164 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2709, Invalid=4431, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:23:00,134 INFO L146 ILogger]: Start minimizeSevpa. Operand 129 states. [2019-05-23 09:23:00,136 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-05-23 09:23:00,136 INFO L146 ILogger]: Start removeUnreachable. Operand 128 states. [2019-05-23 09:23:00,136 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-05-23 09:23:00,136 INFO L146 ILogger]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 124 [2019-05-23 09:23:00,136 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:00,137 INFO L146 ILogger]: Abstraction has 128 states and 128 transitions. [2019-05-23 09:23:00,137 INFO L146 ILogger]: Interpolant automaton has 44 states. [2019-05-23 09:23:00,137 INFO L146 ILogger]: Start isEmpty. Operand 128 states and 128 transitions. [2019-05-23 09:23:00,137 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 128 [2019-05-23 09:23:00,137 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:00,138 INFO L146 ILogger]: trace histogram [42, 41, 41, 1, 1, 1] [2019-05-23 09:23:00,138 INFO L146 ILogger]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:00,138 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:00,138 INFO L146 ILogger]: Analyzing trace with hash -853246326, now seen corresponding path program 41 times [2019-05-23 09:23:00,139 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:00,178 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:00,186 INFO L146 ILogger]: Trace formula consists of 260 conjuncts, 129 conjunts are in the unsatisfiable core [2019-05-23 09:23:00,189 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:00,230 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:00,230 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:00,309 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:00,310 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:00,310 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:02,393 INFO L146 ILogger]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:02,393 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:02,394 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-05-23 09:23:02,394 INFO L146 ILogger]: Interpolant automaton has 45 states [2019-05-23 09:23:02,394 INFO L146 ILogger]: Constructing interpolant automaton starting with 45 interpolants. [2019-05-23 09:23:02,395 INFO L146 ILogger]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:23:02,395 INFO L146 ILogger]: Start difference. First operand 128 states and 128 transitions. Second operand 45 states. [2019-05-23 09:23:03,869 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:03,869 INFO L146 ILogger]: Finished difference Result 132 states and 132 transitions. [2019-05-23 09:23:03,869 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-05-23 09:23:03,870 INFO L146 ILogger]: Start accepts. Automaton has 45 states. Word has length 127 [2019-05-23 09:23:03,870 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:03,871 INFO L146 ILogger]: With dead ends: 132 [2019-05-23 09:23:03,871 INFO L146 ILogger]: Without dead ends: 132 [2019-05-23 09:23:03,872 INFO L146 ILogger]: 0 DeclaredPredicates, 168 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:23:03,873 INFO L146 ILogger]: Start minimizeSevpa. Operand 132 states. [2019-05-23 09:23:03,875 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-05-23 09:23:03,875 INFO L146 ILogger]: Start removeUnreachable. Operand 131 states. [2019-05-23 09:23:03,875 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-05-23 09:23:03,876 INFO L146 ILogger]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 127 [2019-05-23 09:23:03,876 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:03,876 INFO L146 ILogger]: Abstraction has 131 states and 131 transitions. [2019-05-23 09:23:03,876 INFO L146 ILogger]: Interpolant automaton has 45 states. [2019-05-23 09:23:03,876 INFO L146 ILogger]: Start isEmpty. Operand 131 states and 131 transitions. [2019-05-23 09:23:03,877 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 131 [2019-05-23 09:23:03,877 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:03,877 INFO L146 ILogger]: trace histogram [43, 42, 42, 1, 1, 1] [2019-05-23 09:23:03,877 INFO L146 ILogger]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:03,878 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:03,878 INFO L146 ILogger]: Analyzing trace with hash -1444797629, now seen corresponding path program 42 times [2019-05-23 09:23:03,878 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:03,920 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:03,929 INFO L146 ILogger]: Trace formula consists of 266 conjuncts, 132 conjunts are in the unsatisfiable core [2019-05-23 09:23:03,932 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:03,970 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:03,971 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:04,046 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:04,047 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:04,047 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:05,482 INFO L146 ILogger]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:05,483 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:05,483 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-05-23 09:23:05,483 INFO L146 ILogger]: Interpolant automaton has 46 states [2019-05-23 09:23:05,483 INFO L146 ILogger]: Constructing interpolant automaton starting with 46 interpolants. [2019-05-23 09:23:05,484 INFO L146 ILogger]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 09:23:05,484 INFO L146 ILogger]: Start difference. First operand 131 states and 131 transitions. Second operand 46 states. [2019-05-23 09:23:07,166 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:07,166 INFO L146 ILogger]: Finished difference Result 135 states and 135 transitions. [2019-05-23 09:23:07,167 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-05-23 09:23:07,167 INFO L146 ILogger]: Start accepts. Automaton has 46 states. Word has length 130 [2019-05-23 09:23:07,167 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:07,168 INFO L146 ILogger]: With dead ends: 135 [2019-05-23 09:23:07,168 INFO L146 ILogger]: Without dead ends: 135 [2019-05-23 09:23:07,169 INFO L146 ILogger]: 0 DeclaredPredicates, 172 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2970, Invalid=4862, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:23:07,170 INFO L146 ILogger]: Start minimizeSevpa. Operand 135 states. [2019-05-23 09:23:07,172 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-05-23 09:23:07,172 INFO L146 ILogger]: Start removeUnreachable. Operand 134 states. [2019-05-23 09:23:07,173 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-05-23 09:23:07,173 INFO L146 ILogger]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 130 [2019-05-23 09:23:07,173 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:07,173 INFO L146 ILogger]: Abstraction has 134 states and 134 transitions. [2019-05-23 09:23:07,173 INFO L146 ILogger]: Interpolant automaton has 46 states. [2019-05-23 09:23:07,174 INFO L146 ILogger]: Start isEmpty. Operand 134 states and 134 transitions. [2019-05-23 09:23:07,174 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 134 [2019-05-23 09:23:07,174 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:07,174 INFO L146 ILogger]: trace histogram [44, 43, 43, 1, 1, 1] [2019-05-23 09:23:07,175 INFO L146 ILogger]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:07,175 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:07,175 INFO L146 ILogger]: Analyzing trace with hash -2098849814, now seen corresponding path program 43 times [2019-05-23 09:23:07,176 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:07,218 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:07,227 INFO L146 ILogger]: Trace formula consists of 272 conjuncts, 135 conjunts are in the unsatisfiable core [2019-05-23 09:23:07,229 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:07,263 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:07,263 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:07,271 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:07,271 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:07,272 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:08,288 INFO L146 ILogger]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:08,288 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:08,288 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-05-23 09:23:08,288 INFO L146 ILogger]: Interpolant automaton has 47 states [2019-05-23 09:23:08,289 INFO L146 ILogger]: Constructing interpolant automaton starting with 47 interpolants. [2019-05-23 09:23:08,289 INFO L146 ILogger]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:23:08,289 INFO L146 ILogger]: Start difference. First operand 134 states and 134 transitions. Second operand 47 states. [2019-05-23 09:23:10,043 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:10,043 INFO L146 ILogger]: Finished difference Result 138 states and 138 transitions. [2019-05-23 09:23:10,044 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-05-23 09:23:10,044 INFO L146 ILogger]: Start accepts. Automaton has 47 states. Word has length 133 [2019-05-23 09:23:10,044 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:10,045 INFO L146 ILogger]: With dead ends: 138 [2019-05-23 09:23:10,045 INFO L146 ILogger]: Without dead ends: 138 [2019-05-23 09:23:10,046 INFO L146 ILogger]: 0 DeclaredPredicates, 176 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:23:10,046 INFO L146 ILogger]: Start minimizeSevpa. Operand 138 states. [2019-05-23 09:23:10,048 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-05-23 09:23:10,048 INFO L146 ILogger]: Start removeUnreachable. Operand 137 states. [2019-05-23 09:23:10,049 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-05-23 09:23:10,049 INFO L146 ILogger]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 133 [2019-05-23 09:23:10,049 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:10,049 INFO L146 ILogger]: Abstraction has 137 states and 137 transitions. [2019-05-23 09:23:10,049 INFO L146 ILogger]: Interpolant automaton has 47 states. [2019-05-23 09:23:10,049 INFO L146 ILogger]: Start isEmpty. Operand 137 states and 137 transitions. [2019-05-23 09:23:10,050 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 137 [2019-05-23 09:23:10,050 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:10,050 INFO L146 ILogger]: trace histogram [45, 44, 44, 1, 1, 1] [2019-05-23 09:23:10,050 INFO L146 ILogger]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:10,050 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:10,050 INFO L146 ILogger]: Analyzing trace with hash -700871197, now seen corresponding path program 44 times [2019-05-23 09:23:10,051 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:10,086 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:10,096 INFO L146 ILogger]: Trace formula consists of 278 conjuncts, 138 conjunts are in the unsatisfiable core [2019-05-23 09:23:10,099 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:10,136 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:10,137 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:10,158 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:10,159 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:10,159 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:11,212 INFO L146 ILogger]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:11,212 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:11,213 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-05-23 09:23:11,213 INFO L146 ILogger]: Interpolant automaton has 48 states [2019-05-23 09:23:11,213 INFO L146 ILogger]: Constructing interpolant automaton starting with 48 interpolants. [2019-05-23 09:23:11,213 INFO L146 ILogger]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 09:23:11,213 INFO L146 ILogger]: Start difference. First operand 137 states and 137 transitions. Second operand 48 states. [2019-05-23 09:23:13,140 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:13,140 INFO L146 ILogger]: Finished difference Result 141 states and 141 transitions. [2019-05-23 09:23:13,140 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-23 09:23:13,141 INFO L146 ILogger]: Start accepts. Automaton has 48 states. Word has length 136 [2019-05-23 09:23:13,141 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:13,142 INFO L146 ILogger]: With dead ends: 141 [2019-05-23 09:23:13,142 INFO L146 ILogger]: Without dead ends: 141 [2019-05-23 09:23:13,143 INFO L146 ILogger]: 0 DeclaredPredicates, 180 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3243, Invalid=5313, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:23:13,143 INFO L146 ILogger]: Start minimizeSevpa. Operand 141 states. [2019-05-23 09:23:13,145 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 141 to 140. [2019-05-23 09:23:13,145 INFO L146 ILogger]: Start removeUnreachable. Operand 140 states. [2019-05-23 09:23:13,146 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-05-23 09:23:13,146 INFO L146 ILogger]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 136 [2019-05-23 09:23:13,146 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:13,146 INFO L146 ILogger]: Abstraction has 140 states and 140 transitions. [2019-05-23 09:23:13,146 INFO L146 ILogger]: Interpolant automaton has 48 states. [2019-05-23 09:23:13,146 INFO L146 ILogger]: Start isEmpty. Operand 140 states and 140 transitions. [2019-05-23 09:23:13,147 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 140 [2019-05-23 09:23:13,147 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:13,147 INFO L146 ILogger]: trace histogram [46, 45, 45, 1, 1, 1] [2019-05-23 09:23:13,148 INFO L146 ILogger]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:13,148 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:13,148 INFO L146 ILogger]: Analyzing trace with hash -1817761462, now seen corresponding path program 45 times [2019-05-23 09:23:13,148 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:13,182 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:13,192 INFO L146 ILogger]: Trace formula consists of 284 conjuncts, 141 conjunts are in the unsatisfiable core [2019-05-23 09:23:13,195 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:13,236 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:13,237 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:13,313 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:13,314 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:13,314 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:14,855 INFO L146 ILogger]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:14,856 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:14,856 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-05-23 09:23:14,856 INFO L146 ILogger]: Interpolant automaton has 49 states [2019-05-23 09:23:14,856 INFO L146 ILogger]: Constructing interpolant automaton starting with 49 interpolants. [2019-05-23 09:23:14,856 INFO L146 ILogger]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:23:14,857 INFO L146 ILogger]: Start difference. First operand 140 states and 140 transitions. Second operand 49 states. [2019-05-23 09:23:16,652 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:16,652 INFO L146 ILogger]: Finished difference Result 144 states and 144 transitions. [2019-05-23 09:23:16,652 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-05-23 09:23:16,653 INFO L146 ILogger]: Start accepts. Automaton has 49 states. Word has length 139 [2019-05-23 09:23:16,653 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:16,654 INFO L146 ILogger]: With dead ends: 144 [2019-05-23 09:23:16,654 INFO L146 ILogger]: Without dead ends: 144 [2019-05-23 09:23:16,657 INFO L146 ILogger]: 0 DeclaredPredicates, 184 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:23:16,657 INFO L146 ILogger]: Start minimizeSevpa. Operand 144 states. [2019-05-23 09:23:16,659 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-05-23 09:23:16,659 INFO L146 ILogger]: Start removeUnreachable. Operand 143 states. [2019-05-23 09:23:16,660 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2019-05-23 09:23:16,660 INFO L146 ILogger]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 139 [2019-05-23 09:23:16,660 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:16,660 INFO L146 ILogger]: Abstraction has 143 states and 143 transitions. [2019-05-23 09:23:16,661 INFO L146 ILogger]: Interpolant automaton has 49 states. [2019-05-23 09:23:16,661 INFO L146 ILogger]: Start isEmpty. Operand 143 states and 143 transitions. [2019-05-23 09:23:16,661 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 143 [2019-05-23 09:23:16,661 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:16,662 INFO L146 ILogger]: trace histogram [47, 46, 46, 1, 1, 1] [2019-05-23 09:23:16,662 INFO L146 ILogger]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:16,662 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:16,662 INFO L146 ILogger]: Analyzing trace with hash -1984003965, now seen corresponding path program 46 times [2019-05-23 09:23:16,663 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:16,706 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:16,716 INFO L146 ILogger]: Trace formula consists of 290 conjuncts, 144 conjunts are in the unsatisfiable core [2019-05-23 09:23:16,719 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:16,742 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:16,742 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:16,747 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:16,747 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:16,747 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:18,239 INFO L146 ILogger]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:18,240 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:18,240 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-05-23 09:23:18,240 INFO L146 ILogger]: Interpolant automaton has 50 states [2019-05-23 09:23:18,240 INFO L146 ILogger]: Constructing interpolant automaton starting with 50 interpolants. [2019-05-23 09:23:18,241 INFO L146 ILogger]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 09:23:18,241 INFO L146 ILogger]: Start difference. First operand 143 states and 143 transitions. Second operand 50 states. [2019-05-23 09:23:20,037 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:20,037 INFO L146 ILogger]: Finished difference Result 147 states and 147 transitions. [2019-05-23 09:23:20,037 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-05-23 09:23:20,038 INFO L146 ILogger]: Start accepts. Automaton has 50 states. Word has length 142 [2019-05-23 09:23:20,038 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:20,039 INFO L146 ILogger]: With dead ends: 147 [2019-05-23 09:23:20,039 INFO L146 ILogger]: Without dead ends: 147 [2019-05-23 09:23:20,040 INFO L146 ILogger]: 0 DeclaredPredicates, 188 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3528, Invalid=5784, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:23:20,040 INFO L146 ILogger]: Start minimizeSevpa. Operand 147 states. [2019-05-23 09:23:20,042 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-05-23 09:23:20,042 INFO L146 ILogger]: Start removeUnreachable. Operand 146 states. [2019-05-23 09:23:20,043 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-05-23 09:23:20,043 INFO L146 ILogger]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 142 [2019-05-23 09:23:20,043 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:20,043 INFO L146 ILogger]: Abstraction has 146 states and 146 transitions. [2019-05-23 09:23:20,044 INFO L146 ILogger]: Interpolant automaton has 50 states. [2019-05-23 09:23:20,044 INFO L146 ILogger]: Start isEmpty. Operand 146 states and 146 transitions. [2019-05-23 09:23:20,044 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 146 [2019-05-23 09:23:20,044 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:20,045 INFO L146 ILogger]: trace histogram [48, 47, 47, 1, 1, 1] [2019-05-23 09:23:20,045 INFO L146 ILogger]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:20,045 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:20,045 INFO L146 ILogger]: Analyzing trace with hash 1877848746, now seen corresponding path program 47 times [2019-05-23 09:23:20,046 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:20,086 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:20,094 INFO L146 ILogger]: Trace formula consists of 296 conjuncts, 147 conjunts are in the unsatisfiable core [2019-05-23 09:23:20,097 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:20,134 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:20,135 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:20,203 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:20,203 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:20,203 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:23,039 INFO L146 ILogger]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:23,039 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:23,040 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-05-23 09:23:23,040 INFO L146 ILogger]: Interpolant automaton has 51 states [2019-05-23 09:23:23,040 INFO L146 ILogger]: Constructing interpolant automaton starting with 51 interpolants. [2019-05-23 09:23:23,040 INFO L146 ILogger]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:23:23,040 INFO L146 ILogger]: Start difference. First operand 146 states and 146 transitions. Second operand 51 states. [2019-05-23 09:23:25,130 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:25,131 INFO L146 ILogger]: Finished difference Result 150 states and 150 transitions. [2019-05-23 09:23:25,131 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-05-23 09:23:25,131 INFO L146 ILogger]: Start accepts. Automaton has 51 states. Word has length 145 [2019-05-23 09:23:25,131 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:25,132 INFO L146 ILogger]: With dead ends: 150 [2019-05-23 09:23:25,132 INFO L146 ILogger]: Without dead ends: 150 [2019-05-23 09:23:25,134 INFO L146 ILogger]: 0 DeclaredPredicates, 192 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:23:25,134 INFO L146 ILogger]: Start minimizeSevpa. Operand 150 states. [2019-05-23 09:23:25,145 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-05-23 09:23:25,146 INFO L146 ILogger]: Start removeUnreachable. Operand 149 states. [2019-05-23 09:23:25,146 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-05-23 09:23:25,146 INFO L146 ILogger]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 145 [2019-05-23 09:23:25,146 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:25,147 INFO L146 ILogger]: Abstraction has 149 states and 149 transitions. [2019-05-23 09:23:25,147 INFO L146 ILogger]: Interpolant automaton has 51 states. [2019-05-23 09:23:25,147 INFO L146 ILogger]: Start isEmpty. Operand 149 states and 149 transitions. [2019-05-23 09:23:25,147 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 149 [2019-05-23 09:23:25,148 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:25,148 INFO L146 ILogger]: trace histogram [49, 48, 48, 1, 1, 1] [2019-05-23 09:23:25,148 INFO L146 ILogger]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:25,148 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:25,148 INFO L146 ILogger]: Analyzing trace with hash 1043004195, now seen corresponding path program 48 times [2019-05-23 09:23:25,149 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:25,197 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:25,208 INFO L146 ILogger]: Trace formula consists of 302 conjuncts, 150 conjunts are in the unsatisfiable core [2019-05-23 09:23:25,211 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:25,250 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:25,251 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:25,261 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:25,262 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:25,262 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:26,574 INFO L146 ILogger]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:26,574 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:26,574 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-05-23 09:23:26,575 INFO L146 ILogger]: Interpolant automaton has 52 states [2019-05-23 09:23:26,575 INFO L146 ILogger]: Constructing interpolant automaton starting with 52 interpolants. [2019-05-23 09:23:26,575 INFO L146 ILogger]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 09:23:26,575 INFO L146 ILogger]: Start difference. First operand 149 states and 149 transitions. Second operand 52 states. [2019-05-23 09:23:28,702 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:28,702 INFO L146 ILogger]: Finished difference Result 153 states and 153 transitions. [2019-05-23 09:23:28,702 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-05-23 09:23:28,703 INFO L146 ILogger]: Start accepts. Automaton has 52 states. Word has length 148 [2019-05-23 09:23:28,703 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:28,704 INFO L146 ILogger]: With dead ends: 153 [2019-05-23 09:23:28,704 INFO L146 ILogger]: Without dead ends: 153 [2019-05-23 09:23:28,705 INFO L146 ILogger]: 0 DeclaredPredicates, 196 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3825, Invalid=6275, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:23:28,705 INFO L146 ILogger]: Start minimizeSevpa. Operand 153 states. [2019-05-23 09:23:28,708 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 153 to 152. [2019-05-23 09:23:28,708 INFO L146 ILogger]: Start removeUnreachable. Operand 152 states. [2019-05-23 09:23:28,708 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-05-23 09:23:28,708 INFO L146 ILogger]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 148 [2019-05-23 09:23:28,709 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:28,709 INFO L146 ILogger]: Abstraction has 152 states and 152 transitions. [2019-05-23 09:23:28,709 INFO L146 ILogger]: Interpolant automaton has 52 states. [2019-05-23 09:23:28,709 INFO L146 ILogger]: Start isEmpty. Operand 152 states and 152 transitions. [2019-05-23 09:23:28,710 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 152 [2019-05-23 09:23:28,710 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:28,710 INFO L146 ILogger]: trace histogram [50, 49, 49, 1, 1, 1] [2019-05-23 09:23:28,710 INFO L146 ILogger]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:28,710 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:28,711 INFO L146 ILogger]: Analyzing trace with hash -1950370806, now seen corresponding path program 49 times [2019-05-23 09:23:28,711 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:28,750 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:28,758 INFO L146 ILogger]: Trace formula consists of 308 conjuncts, 153 conjunts are in the unsatisfiable core [2019-05-23 09:23:28,761 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:28,781 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:28,781 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:28,787 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:28,787 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:28,787 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:30,104 INFO L146 ILogger]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:30,104 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:30,105 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-05-23 09:23:30,105 INFO L146 ILogger]: Interpolant automaton has 53 states [2019-05-23 09:23:30,105 INFO L146 ILogger]: Constructing interpolant automaton starting with 53 interpolants. [2019-05-23 09:23:30,106 INFO L146 ILogger]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:23:30,106 INFO L146 ILogger]: Start difference. First operand 152 states and 152 transitions. Second operand 53 states. [2019-05-23 09:23:32,043 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:32,044 INFO L146 ILogger]: Finished difference Result 156 states and 156 transitions. [2019-05-23 09:23:32,044 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-05-23 09:23:32,044 INFO L146 ILogger]: Start accepts. Automaton has 53 states. Word has length 151 [2019-05-23 09:23:32,045 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:32,045 INFO L146 ILogger]: With dead ends: 156 [2019-05-23 09:23:32,046 INFO L146 ILogger]: Without dead ends: 156 [2019-05-23 09:23:32,046 INFO L146 ILogger]: 0 DeclaredPredicates, 200 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:23:32,047 INFO L146 ILogger]: Start minimizeSevpa. Operand 156 states. [2019-05-23 09:23:32,048 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-05-23 09:23:32,048 INFO L146 ILogger]: Start removeUnreachable. Operand 155 states. [2019-05-23 09:23:32,048 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2019-05-23 09:23:32,048 INFO L146 ILogger]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 151 [2019-05-23 09:23:32,048 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:32,048 INFO L146 ILogger]: Abstraction has 155 states and 155 transitions. [2019-05-23 09:23:32,049 INFO L146 ILogger]: Interpolant automaton has 53 states. [2019-05-23 09:23:32,049 INFO L146 ILogger]: Start isEmpty. Operand 155 states and 155 transitions. [2019-05-23 09:23:32,049 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 155 [2019-05-23 09:23:32,049 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:32,049 INFO L146 ILogger]: trace histogram [51, 50, 50, 1, 1, 1] [2019-05-23 09:23:32,049 INFO L146 ILogger]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:32,050 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:32,050 INFO L146 ILogger]: Analyzing trace with hash -1179058749, now seen corresponding path program 50 times [2019-05-23 09:23:32,050 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:32,089 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:32,102 INFO L146 ILogger]: Trace formula consists of 314 conjuncts, 156 conjunts are in the unsatisfiable core [2019-05-23 09:23:32,105 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:32,147 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:32,148 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:32,215 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:32,215 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:32,216 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:34,180 INFO L146 ILogger]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:34,180 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:34,180 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-05-23 09:23:34,181 INFO L146 ILogger]: Interpolant automaton has 54 states [2019-05-23 09:23:34,181 INFO L146 ILogger]: Constructing interpolant automaton starting with 54 interpolants. [2019-05-23 09:23:34,181 INFO L146 ILogger]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 09:23:34,181 INFO L146 ILogger]: Start difference. First operand 155 states and 155 transitions. Second operand 54 states. [2019-05-23 09:23:36,241 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:36,242 INFO L146 ILogger]: Finished difference Result 159 states and 159 transitions. [2019-05-23 09:23:36,242 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-23 09:23:36,242 INFO L146 ILogger]: Start accepts. Automaton has 54 states. Word has length 154 [2019-05-23 09:23:36,243 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:36,244 INFO L146 ILogger]: With dead ends: 159 [2019-05-23 09:23:36,244 INFO L146 ILogger]: Without dead ends: 159 [2019-05-23 09:23:36,245 INFO L146 ILogger]: 0 DeclaredPredicates, 204 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4134, Invalid=6786, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 09:23:36,245 INFO L146 ILogger]: Start minimizeSevpa. Operand 159 states. [2019-05-23 09:23:36,247 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-05-23 09:23:36,247 INFO L146 ILogger]: Start removeUnreachable. Operand 158 states. [2019-05-23 09:23:36,247 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-05-23 09:23:36,247 INFO L146 ILogger]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 154 [2019-05-23 09:23:36,248 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:36,248 INFO L146 ILogger]: Abstraction has 158 states and 158 transitions. [2019-05-23 09:23:36,248 INFO L146 ILogger]: Interpolant automaton has 54 states. [2019-05-23 09:23:36,248 INFO L146 ILogger]: Start isEmpty. Operand 158 states and 158 transitions. [2019-05-23 09:23:36,248 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 158 [2019-05-23 09:23:36,249 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:36,249 INFO L146 ILogger]: trace histogram [52, 51, 51, 1, 1, 1] [2019-05-23 09:23:36,249 INFO L146 ILogger]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:36,249 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:36,249 INFO L146 ILogger]: Analyzing trace with hash -1096602262, now seen corresponding path program 51 times [2019-05-23 09:23:36,250 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:36,298 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:36,311 INFO L146 ILogger]: Trace formula consists of 320 conjuncts, 159 conjunts are in the unsatisfiable core [2019-05-23 09:23:36,314 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:36,355 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:36,356 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:36,382 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:36,383 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:36,383 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:38,072 INFO L146 ILogger]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:38,072 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:38,072 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-05-23 09:23:38,073 INFO L146 ILogger]: Interpolant automaton has 55 states [2019-05-23 09:23:38,073 INFO L146 ILogger]: Constructing interpolant automaton starting with 55 interpolants. [2019-05-23 09:23:38,073 INFO L146 ILogger]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:23:38,073 INFO L146 ILogger]: Start difference. First operand 158 states and 158 transitions. Second operand 55 states. [2019-05-23 09:23:40,210 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:40,210 INFO L146 ILogger]: Finished difference Result 162 states and 162 transitions. [2019-05-23 09:23:40,210 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-05-23 09:23:40,210 INFO L146 ILogger]: Start accepts. Automaton has 55 states. Word has length 157 [2019-05-23 09:23:40,211 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:40,212 INFO L146 ILogger]: With dead ends: 162 [2019-05-23 09:23:40,212 INFO L146 ILogger]: Without dead ends: 162 [2019-05-23 09:23:40,213 INFO L146 ILogger]: 0 DeclaredPredicates, 208 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 09:23:40,213 INFO L146 ILogger]: Start minimizeSevpa. Operand 162 states. [2019-05-23 09:23:40,215 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-05-23 09:23:40,216 INFO L146 ILogger]: Start removeUnreachable. Operand 161 states. [2019-05-23 09:23:40,216 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-05-23 09:23:40,216 INFO L146 ILogger]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 157 [2019-05-23 09:23:40,216 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:40,216 INFO L146 ILogger]: Abstraction has 161 states and 161 transitions. [2019-05-23 09:23:40,216 INFO L146 ILogger]: Interpolant automaton has 55 states. [2019-05-23 09:23:40,217 INFO L146 ILogger]: Start isEmpty. Operand 161 states and 161 transitions. [2019-05-23 09:23:40,217 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 161 [2019-05-23 09:23:40,217 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:40,217 INFO L146 ILogger]: trace histogram [53, 52, 52, 1, 1, 1] [2019-05-23 09:23:40,217 INFO L146 ILogger]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:40,218 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:40,218 INFO L146 ILogger]: Analyzing trace with hash -1356691357, now seen corresponding path program 52 times [2019-05-23 09:23:40,218 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:40,268 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:40,281 INFO L146 ILogger]: Trace formula consists of 326 conjuncts, 162 conjunts are in the unsatisfiable core [2019-05-23 09:23:40,283 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:40,309 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:40,309 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:40,315 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:40,315 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:40,315 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:41,762 INFO L146 ILogger]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:41,762 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:41,763 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-05-23 09:23:41,763 INFO L146 ILogger]: Interpolant automaton has 56 states [2019-05-23 09:23:41,763 INFO L146 ILogger]: Constructing interpolant automaton starting with 56 interpolants. [2019-05-23 09:23:41,763 INFO L146 ILogger]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 09:23:41,763 INFO L146 ILogger]: Start difference. First operand 161 states and 161 transitions. Second operand 56 states. [2019-05-23 09:23:44,113 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:44,114 INFO L146 ILogger]: Finished difference Result 165 states and 165 transitions. [2019-05-23 09:23:44,114 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-05-23 09:23:44,114 INFO L146 ILogger]: Start accepts. Automaton has 56 states. Word has length 160 [2019-05-23 09:23:44,115 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:44,116 INFO L146 ILogger]: With dead ends: 165 [2019-05-23 09:23:44,116 INFO L146 ILogger]: Without dead ends: 165 [2019-05-23 09:23:44,117 INFO L146 ILogger]: 0 DeclaredPredicates, 212 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4455, Invalid=7317, Unknown=0, NotChecked=0, Total=11772 [2019-05-23 09:23:44,117 INFO L146 ILogger]: Start minimizeSevpa. Operand 165 states. [2019-05-23 09:23:44,119 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-05-23 09:23:44,119 INFO L146 ILogger]: Start removeUnreachable. Operand 164 states. [2019-05-23 09:23:44,120 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-05-23 09:23:44,120 INFO L146 ILogger]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 160 [2019-05-23 09:23:44,120 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:44,120 INFO L146 ILogger]: Abstraction has 164 states and 164 transitions. [2019-05-23 09:23:44,120 INFO L146 ILogger]: Interpolant automaton has 56 states. [2019-05-23 09:23:44,121 INFO L146 ILogger]: Start isEmpty. Operand 164 states and 164 transitions. [2019-05-23 09:23:44,121 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 164 [2019-05-23 09:23:44,121 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:44,121 INFO L146 ILogger]: trace histogram [54, 53, 53, 1, 1, 1] [2019-05-23 09:23:44,122 INFO L146 ILogger]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:44,122 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:44,122 INFO L146 ILogger]: Analyzing trace with hash -1549918518, now seen corresponding path program 53 times [2019-05-23 09:23:44,122 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:44,177 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:44,191 INFO L146 ILogger]: Trace formula consists of 332 conjuncts, 165 conjunts are in the unsatisfiable core [2019-05-23 09:23:44,193 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:44,224 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:44,224 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:44,230 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:44,231 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:44,231 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:48,494 INFO L146 ILogger]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:48,495 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:48,495 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-05-23 09:23:48,495 INFO L146 ILogger]: Interpolant automaton has 57 states [2019-05-23 09:23:48,495 INFO L146 ILogger]: Constructing interpolant automaton starting with 57 interpolants. [2019-05-23 09:23:48,496 INFO L146 ILogger]: CoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:23:48,496 INFO L146 ILogger]: Start difference. First operand 164 states and 164 transitions. Second operand 57 states. [2019-05-23 09:23:50,731 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:50,732 INFO L146 ILogger]: Finished difference Result 168 states and 168 transitions. [2019-05-23 09:23:50,732 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-05-23 09:23:50,732 INFO L146 ILogger]: Start accepts. Automaton has 57 states. Word has length 163 [2019-05-23 09:23:50,733 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:50,733 INFO L146 ILogger]: With dead ends: 168 [2019-05-23 09:23:50,734 INFO L146 ILogger]: Without dead ends: 168 [2019-05-23 09:23:50,734 INFO L146 ILogger]: 0 DeclaredPredicates, 216 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4620, Invalid=7590, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 09:23:50,735 INFO L146 ILogger]: Start minimizeSevpa. Operand 168 states. [2019-05-23 09:23:50,737 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-05-23 09:23:50,737 INFO L146 ILogger]: Start removeUnreachable. Operand 167 states. [2019-05-23 09:23:50,737 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-05-23 09:23:50,737 INFO L146 ILogger]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 163 [2019-05-23 09:23:50,737 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:50,737 INFO L146 ILogger]: Abstraction has 167 states and 167 transitions. [2019-05-23 09:23:50,738 INFO L146 ILogger]: Interpolant automaton has 57 states. [2019-05-23 09:23:50,738 INFO L146 ILogger]: Start isEmpty. Operand 167 states and 167 transitions. [2019-05-23 09:23:50,738 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 167 [2019-05-23 09:23:50,738 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:50,738 INFO L146 ILogger]: trace histogram [55, 54, 54, 1, 1, 1] [2019-05-23 09:23:50,738 INFO L146 ILogger]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:50,739 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:50,739 INFO L146 ILogger]: Analyzing trace with hash 1570872067, now seen corresponding path program 54 times [2019-05-23 09:23:50,739 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:50,796 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:50,810 INFO L146 ILogger]: Trace formula consists of 338 conjuncts, 168 conjunts are in the unsatisfiable core [2019-05-23 09:23:50,813 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:50,851 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:50,852 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:50,870 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:50,870 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:50,870 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:52,418 INFO L146 ILogger]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:52,418 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:52,419 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-05-23 09:23:52,419 INFO L146 ILogger]: Interpolant automaton has 58 states [2019-05-23 09:23:52,419 INFO L146 ILogger]: Constructing interpolant automaton starting with 58 interpolants. [2019-05-23 09:23:52,419 INFO L146 ILogger]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 09:23:52,419 INFO L146 ILogger]: Start difference. First operand 167 states and 167 transitions. Second operand 58 states. [2019-05-23 09:23:54,907 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:54,907 INFO L146 ILogger]: Finished difference Result 171 states and 171 transitions. [2019-05-23 09:23:54,908 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-05-23 09:23:54,908 INFO L146 ILogger]: Start accepts. Automaton has 58 states. Word has length 166 [2019-05-23 09:23:54,908 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:54,909 INFO L146 ILogger]: With dead ends: 171 [2019-05-23 09:23:54,909 INFO L146 ILogger]: Without dead ends: 171 [2019-05-23 09:23:54,910 INFO L146 ILogger]: 0 DeclaredPredicates, 220 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4788, Invalid=7868, Unknown=0, NotChecked=0, Total=12656 [2019-05-23 09:23:54,910 INFO L146 ILogger]: Start minimizeSevpa. Operand 171 states. [2019-05-23 09:23:54,912 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-05-23 09:23:54,912 INFO L146 ILogger]: Start removeUnreachable. Operand 170 states. [2019-05-23 09:23:54,913 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-05-23 09:23:54,913 INFO L146 ILogger]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 166 [2019-05-23 09:23:54,913 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:54,913 INFO L146 ILogger]: Abstraction has 170 states and 170 transitions. [2019-05-23 09:23:54,913 INFO L146 ILogger]: Interpolant automaton has 58 states. [2019-05-23 09:23:54,913 INFO L146 ILogger]: Start isEmpty. Operand 170 states and 170 transitions. [2019-05-23 09:23:54,914 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 170 [2019-05-23 09:23:54,914 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:54,915 INFO L146 ILogger]: trace histogram [56, 55, 55, 1, 1, 1] [2019-05-23 09:23:54,915 INFO L146 ILogger]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:54,915 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:54,915 INFO L146 ILogger]: Analyzing trace with hash -113866710, now seen corresponding path program 55 times [2019-05-23 09:23:54,916 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:54,972 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:54,987 INFO L146 ILogger]: Trace formula consists of 344 conjuncts, 171 conjunts are in the unsatisfiable core [2019-05-23 09:23:54,990 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:55,026 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:55,027 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:55,050 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:55,051 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:55,051 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:56,623 INFO L146 ILogger]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:56,623 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:56,623 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-05-23 09:23:56,623 INFO L146 ILogger]: Interpolant automaton has 59 states [2019-05-23 09:23:56,624 INFO L146 ILogger]: Constructing interpolant automaton starting with 59 interpolants. [2019-05-23 09:23:56,624 INFO L146 ILogger]: CoverageRelationStatistics Valid=1655, Invalid=1767, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:23:56,624 INFO L146 ILogger]: Start difference. First operand 170 states and 170 transitions. Second operand 59 states. [2019-05-23 09:23:59,221 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:59,221 INFO L146 ILogger]: Finished difference Result 174 states and 174 transitions. [2019-05-23 09:23:59,222 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-05-23 09:23:59,222 INFO L146 ILogger]: Start accepts. Automaton has 59 states. Word has length 169 [2019-05-23 09:23:59,222 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:59,223 INFO L146 ILogger]: With dead ends: 174 [2019-05-23 09:23:59,223 INFO L146 ILogger]: Without dead ends: 174 [2019-05-23 09:23:59,224 INFO L146 ILogger]: 0 DeclaredPredicates, 224 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4959, Invalid=8151, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 09:23:59,224 INFO L146 ILogger]: Start minimizeSevpa. Operand 174 states. [2019-05-23 09:23:59,226 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-05-23 09:23:59,226 INFO L146 ILogger]: Start removeUnreachable. Operand 173 states. [2019-05-23 09:23:59,226 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-05-23 09:23:59,226 INFO L146 ILogger]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 169 [2019-05-23 09:23:59,227 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:59,227 INFO L146 ILogger]: Abstraction has 173 states and 173 transitions. [2019-05-23 09:23:59,227 INFO L146 ILogger]: Interpolant automaton has 59 states. [2019-05-23 09:23:59,227 INFO L146 ILogger]: Start isEmpty. Operand 173 states and 173 transitions. [2019-05-23 09:23:59,227 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 173 [2019-05-23 09:23:59,227 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:59,228 INFO L146 ILogger]: trace histogram [57, 56, 56, 1, 1, 1] [2019-05-23 09:23:59,228 INFO L146 ILogger]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:59,228 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:59,228 INFO L146 ILogger]: Analyzing trace with hash 821048739, now seen corresponding path program 56 times [2019-05-23 09:23:59,228 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:59,271 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:59,287 INFO L146 ILogger]: Trace formula consists of 350 conjuncts, 174 conjunts are in the unsatisfiable core [2019-05-23 09:23:59,289 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:59,306 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:59,306 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:59,313 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:59,313 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:59,313 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:01,091 INFO L146 ILogger]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:01,091 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:01,092 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-05-23 09:24:01,092 INFO L146 ILogger]: Interpolant automaton has 60 states [2019-05-23 09:24:01,092 INFO L146 ILogger]: Constructing interpolant automaton starting with 60 interpolants. [2019-05-23 09:24:01,093 INFO L146 ILogger]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 09:24:01,093 INFO L146 ILogger]: Start difference. First operand 173 states and 173 transitions. Second operand 60 states. [2019-05-23 09:24:03,716 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:03,717 INFO L146 ILogger]: Finished difference Result 177 states and 177 transitions. [2019-05-23 09:24:03,717 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-23 09:24:03,717 INFO L146 ILogger]: Start accepts. Automaton has 60 states. Word has length 172 [2019-05-23 09:24:03,718 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:03,719 INFO L146 ILogger]: With dead ends: 177 [2019-05-23 09:24:03,719 INFO L146 ILogger]: Without dead ends: 177 [2019-05-23 09:24:03,720 INFO L146 ILogger]: 0 DeclaredPredicates, 228 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5133, Invalid=8439, Unknown=0, NotChecked=0, Total=13572 [2019-05-23 09:24:03,721 INFO L146 ILogger]: Start minimizeSevpa. Operand 177 states. [2019-05-23 09:24:03,722 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-05-23 09:24:03,722 INFO L146 ILogger]: Start removeUnreachable. Operand 176 states. [2019-05-23 09:24:03,722 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-05-23 09:24:03,722 INFO L146 ILogger]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 172 [2019-05-23 09:24:03,722 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:03,722 INFO L146 ILogger]: Abstraction has 176 states and 176 transitions. [2019-05-23 09:24:03,723 INFO L146 ILogger]: Interpolant automaton has 60 states. [2019-05-23 09:24:03,723 INFO L146 ILogger]: Start isEmpty. Operand 176 states and 176 transitions. [2019-05-23 09:24:03,723 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 176 [2019-05-23 09:24:03,723 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:03,723 INFO L146 ILogger]: trace histogram [58, 57, 57, 1, 1, 1] [2019-05-23 09:24:03,724 INFO L146 ILogger]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:03,724 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:03,724 INFO L146 ILogger]: Analyzing trace with hash 24275338, now seen corresponding path program 57 times [2019-05-23 09:24:03,724 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:03,911 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:03,926 INFO L146 ILogger]: Trace formula consists of 356 conjuncts, 177 conjunts are in the unsatisfiable core [2019-05-23 09:24:03,929 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:03,973 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:03,974 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:04,041 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:04,042 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:04,042 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:06,214 INFO L146 ILogger]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:06,215 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:06,215 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-05-23 09:24:06,215 INFO L146 ILogger]: Interpolant automaton has 61 states [2019-05-23 09:24:06,216 INFO L146 ILogger]: Constructing interpolant automaton starting with 61 interpolants. [2019-05-23 09:24:06,216 INFO L146 ILogger]: CoverageRelationStatistics Valid=1772, Invalid=1888, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:24:06,216 INFO L146 ILogger]: Start difference. First operand 176 states and 176 transitions. Second operand 61 states. [2019-05-23 09:24:08,969 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:08,969 INFO L146 ILogger]: Finished difference Result 180 states and 180 transitions. [2019-05-23 09:24:08,969 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-05-23 09:24:08,970 INFO L146 ILogger]: Start accepts. Automaton has 61 states. Word has length 175 [2019-05-23 09:24:08,970 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:08,971 INFO L146 ILogger]: With dead ends: 180 [2019-05-23 09:24:08,971 INFO L146 ILogger]: Without dead ends: 180 [2019-05-23 09:24:08,972 INFO L146 ILogger]: 0 DeclaredPredicates, 232 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5310, Invalid=8732, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 09:24:08,973 INFO L146 ILogger]: Start minimizeSevpa. Operand 180 states. [2019-05-23 09:24:08,975 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 180 to 179. [2019-05-23 09:24:08,975 INFO L146 ILogger]: Start removeUnreachable. Operand 179 states. [2019-05-23 09:24:08,975 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2019-05-23 09:24:08,976 INFO L146 ILogger]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 175 [2019-05-23 09:24:08,976 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:08,976 INFO L146 ILogger]: Abstraction has 179 states and 179 transitions. [2019-05-23 09:24:08,976 INFO L146 ILogger]: Interpolant automaton has 61 states. [2019-05-23 09:24:08,976 INFO L146 ILogger]: Start isEmpty. Operand 179 states and 179 transitions. [2019-05-23 09:24:08,976 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 179 [2019-05-23 09:24:08,977 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:08,977 INFO L146 ILogger]: trace histogram [59, 58, 58, 1, 1, 1] [2019-05-23 09:24:08,977 INFO L146 ILogger]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:08,977 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:08,977 INFO L146 ILogger]: Analyzing trace with hash 1632131139, now seen corresponding path program 58 times [2019-05-23 09:24:08,978 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:09,037 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:09,054 INFO L146 ILogger]: Trace formula consists of 362 conjuncts, 180 conjunts are in the unsatisfiable core [2019-05-23 09:24:09,057 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:09,095 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:09,096 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:09,118 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:09,119 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:09,119 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:10,929 INFO L146 ILogger]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:10,930 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:10,930 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-05-23 09:24:10,930 INFO L146 ILogger]: Interpolant automaton has 62 states [2019-05-23 09:24:10,930 INFO L146 ILogger]: Constructing interpolant automaton starting with 62 interpolants. [2019-05-23 09:24:10,931 INFO L146 ILogger]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 09:24:10,931 INFO L146 ILogger]: Start difference. First operand 179 states and 179 transitions. Second operand 62 states. [2019-05-23 09:24:13,504 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:13,505 INFO L146 ILogger]: Finished difference Result 183 states and 183 transitions. [2019-05-23 09:24:13,505 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-05-23 09:24:13,505 INFO L146 ILogger]: Start accepts. Automaton has 62 states. Word has length 178 [2019-05-23 09:24:13,505 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:13,506 INFO L146 ILogger]: With dead ends: 183 [2019-05-23 09:24:13,506 INFO L146 ILogger]: Without dead ends: 183 [2019-05-23 09:24:13,507 INFO L146 ILogger]: 0 DeclaredPredicates, 236 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5490, Invalid=9030, Unknown=0, NotChecked=0, Total=14520 [2019-05-23 09:24:13,507 INFO L146 ILogger]: Start minimizeSevpa. Operand 183 states. [2019-05-23 09:24:13,509 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-05-23 09:24:13,509 INFO L146 ILogger]: Start removeUnreachable. Operand 182 states. [2019-05-23 09:24:13,509 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-05-23 09:24:13,510 INFO L146 ILogger]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 178 [2019-05-23 09:24:13,510 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:13,510 INFO L146 ILogger]: Abstraction has 182 states and 182 transitions. [2019-05-23 09:24:13,510 INFO L146 ILogger]: Interpolant automaton has 62 states. [2019-05-23 09:24:13,510 INFO L146 ILogger]: Start isEmpty. Operand 182 states and 182 transitions. [2019-05-23 09:24:13,511 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 182 [2019-05-23 09:24:13,511 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:13,511 INFO L146 ILogger]: trace histogram [60, 59, 59, 1, 1, 1] [2019-05-23 09:24:13,511 INFO L146 ILogger]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:13,512 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:13,512 INFO L146 ILogger]: Analyzing trace with hash -505953558, now seen corresponding path program 59 times [2019-05-23 09:24:13,512 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:13,569 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:13,584 INFO L146 ILogger]: Trace formula consists of 368 conjuncts, 183 conjunts are in the unsatisfiable core [2019-05-23 09:24:13,586 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:13,629 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:13,629 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:13,645 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:13,645 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:13,645 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:15,694 INFO L146 ILogger]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:15,695 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:15,695 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-05-23 09:24:15,695 INFO L146 ILogger]: Interpolant automaton has 63 states [2019-05-23 09:24:15,696 INFO L146 ILogger]: Constructing interpolant automaton starting with 63 interpolants. [2019-05-23 09:24:15,696 INFO L146 ILogger]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:24:15,696 INFO L146 ILogger]: Start difference. First operand 182 states and 182 transitions. Second operand 63 states. [2019-05-23 09:24:18,517 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:18,517 INFO L146 ILogger]: Finished difference Result 186 states and 186 transitions. [2019-05-23 09:24:18,517 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-05-23 09:24:18,518 INFO L146 ILogger]: Start accepts. Automaton has 63 states. Word has length 181 [2019-05-23 09:24:18,518 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:18,519 INFO L146 ILogger]: With dead ends: 186 [2019-05-23 09:24:18,519 INFO L146 ILogger]: Without dead ends: 186 [2019-05-23 09:24:18,521 INFO L146 ILogger]: 0 DeclaredPredicates, 240 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5673, Invalid=9333, Unknown=0, NotChecked=0, Total=15006 [2019-05-23 09:24:18,521 INFO L146 ILogger]: Start minimizeSevpa. Operand 186 states. [2019-05-23 09:24:18,523 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-05-23 09:24:18,523 INFO L146 ILogger]: Start removeUnreachable. Operand 185 states. [2019-05-23 09:24:18,523 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-05-23 09:24:18,524 INFO L146 ILogger]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 181 [2019-05-23 09:24:18,524 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:18,524 INFO L146 ILogger]: Abstraction has 185 states and 185 transitions. [2019-05-23 09:24:18,524 INFO L146 ILogger]: Interpolant automaton has 63 states. [2019-05-23 09:24:18,524 INFO L146 ILogger]: Start isEmpty. Operand 185 states and 185 transitions. [2019-05-23 09:24:18,525 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 185 [2019-05-23 09:24:18,525 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:18,525 INFO L146 ILogger]: trace histogram [61, 60, 60, 1, 1, 1] [2019-05-23 09:24:18,526 INFO L146 ILogger]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:18,526 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:18,526 INFO L146 ILogger]: Analyzing trace with hash -1822162205, now seen corresponding path program 60 times [2019-05-23 09:24:18,526 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:18,581 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:18,614 INFO L146 ILogger]: Trace formula consists of 374 conjuncts, 186 conjunts are in the unsatisfiable core [2019-05-23 09:24:18,617 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:18,661 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:18,662 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:18,739 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:18,740 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:18,740 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:20,696 INFO L146 ILogger]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:20,697 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:20,697 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-05-23 09:24:20,697 INFO L146 ILogger]: Interpolant automaton has 64 states [2019-05-23 09:24:20,697 INFO L146 ILogger]: Constructing interpolant automaton starting with 64 interpolants. [2019-05-23 09:24:20,698 INFO L146 ILogger]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 09:24:20,698 INFO L146 ILogger]: Start difference. First operand 185 states and 185 transitions. Second operand 64 states. [2019-05-23 09:24:23,472 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:23,472 INFO L146 ILogger]: Finished difference Result 189 states and 189 transitions. [2019-05-23 09:24:23,472 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-05-23 09:24:23,472 INFO L146 ILogger]: Start accepts. Automaton has 64 states. Word has length 184 [2019-05-23 09:24:23,473 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:23,474 INFO L146 ILogger]: With dead ends: 189 [2019-05-23 09:24:23,474 INFO L146 ILogger]: Without dead ends: 189 [2019-05-23 09:24:23,475 INFO L146 ILogger]: 0 DeclaredPredicates, 244 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5859, Invalid=9641, Unknown=0, NotChecked=0, Total=15500 [2019-05-23 09:24:23,475 INFO L146 ILogger]: Start minimizeSevpa. Operand 189 states. [2019-05-23 09:24:23,477 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-05-23 09:24:23,477 INFO L146 ILogger]: Start removeUnreachable. Operand 188 states. [2019-05-23 09:24:23,478 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2019-05-23 09:24:23,478 INFO L146 ILogger]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 184 [2019-05-23 09:24:23,478 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:23,478 INFO L146 ILogger]: Abstraction has 188 states and 188 transitions. [2019-05-23 09:24:23,478 INFO L146 ILogger]: Interpolant automaton has 64 states. [2019-05-23 09:24:23,478 INFO L146 ILogger]: Start isEmpty. Operand 188 states and 188 transitions. [2019-05-23 09:24:23,479 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 188 [2019-05-23 09:24:23,479 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:23,479 INFO L146 ILogger]: trace histogram [62, 61, 61, 1, 1, 1] [2019-05-23 09:24:23,480 INFO L146 ILogger]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:23,480 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:23,480 INFO L146 ILogger]: Analyzing trace with hash 57447498, now seen corresponding path program 61 times [2019-05-23 09:24:23,480 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:23,540 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:23,559 INFO L146 ILogger]: Trace formula consists of 380 conjuncts, 189 conjunts are in the unsatisfiable core [2019-05-23 09:24:23,562 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:23,600 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:23,601 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:23,639 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:23,640 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:23,640 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:25,825 INFO L146 ILogger]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:25,826 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:25,826 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-05-23 09:24:25,826 INFO L146 ILogger]: Interpolant automaton has 65 states [2019-05-23 09:24:25,826 INFO L146 ILogger]: Constructing interpolant automaton starting with 65 interpolants. [2019-05-23 09:24:25,826 INFO L146 ILogger]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:24:25,827 INFO L146 ILogger]: Start difference. First operand 188 states and 188 transitions. Second operand 65 states. [2019-05-23 09:24:28,626 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:28,626 INFO L146 ILogger]: Finished difference Result 192 states and 192 transitions. [2019-05-23 09:24:28,627 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-05-23 09:24:28,627 INFO L146 ILogger]: Start accepts. Automaton has 65 states. Word has length 187 [2019-05-23 09:24:28,627 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:28,628 INFO L146 ILogger]: With dead ends: 192 [2019-05-23 09:24:28,628 INFO L146 ILogger]: Without dead ends: 192 [2019-05-23 09:24:28,630 INFO L146 ILogger]: 0 DeclaredPredicates, 248 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6048, Invalid=9954, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 09:24:28,630 INFO L146 ILogger]: Start minimizeSevpa. Operand 192 states. [2019-05-23 09:24:28,631 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-05-23 09:24:28,631 INFO L146 ILogger]: Start removeUnreachable. Operand 191 states. [2019-05-23 09:24:28,632 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-05-23 09:24:28,632 INFO L146 ILogger]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 187 [2019-05-23 09:24:28,632 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:28,632 INFO L146 ILogger]: Abstraction has 191 states and 191 transitions. [2019-05-23 09:24:28,632 INFO L146 ILogger]: Interpolant automaton has 65 states. [2019-05-23 09:24:28,632 INFO L146 ILogger]: Start isEmpty. Operand 191 states and 191 transitions. [2019-05-23 09:24:28,633 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 191 [2019-05-23 09:24:28,633 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:28,633 INFO L146 ILogger]: trace histogram [63, 62, 62, 1, 1, 1] [2019-05-23 09:24:28,633 INFO L146 ILogger]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:28,633 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:28,633 INFO L146 ILogger]: Analyzing trace with hash 2021471619, now seen corresponding path program 62 times [2019-05-23 09:24:28,634 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:28,683 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:28,702 INFO L146 ILogger]: Trace formula consists of 386 conjuncts, 192 conjunts are in the unsatisfiable core [2019-05-23 09:24:28,704 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:28,720 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:28,720 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:28,725 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:28,725 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:28,725 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:31,096 INFO L146 ILogger]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:31,097 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:31,097 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-05-23 09:24:31,097 INFO L146 ILogger]: Interpolant automaton has 66 states [2019-05-23 09:24:31,098 INFO L146 ILogger]: Constructing interpolant automaton starting with 66 interpolants. [2019-05-23 09:24:31,098 INFO L146 ILogger]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-05-23 09:24:31,098 INFO L146 ILogger]: Start difference. First operand 191 states and 191 transitions. Second operand 66 states. [2019-05-23 09:24:34,152 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:34,152 INFO L146 ILogger]: Finished difference Result 195 states and 195 transitions. [2019-05-23 09:24:34,152 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-23 09:24:34,152 INFO L146 ILogger]: Start accepts. Automaton has 66 states. Word has length 190 [2019-05-23 09:24:34,153 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:34,154 INFO L146 ILogger]: With dead ends: 195 [2019-05-23 09:24:34,154 INFO L146 ILogger]: Without dead ends: 195 [2019-05-23 09:24:34,155 INFO L146 ILogger]: 0 DeclaredPredicates, 252 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6240, Invalid=10272, Unknown=0, NotChecked=0, Total=16512 [2019-05-23 09:24:34,155 INFO L146 ILogger]: Start minimizeSevpa. Operand 195 states. [2019-05-23 09:24:34,157 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-05-23 09:24:34,157 INFO L146 ILogger]: Start removeUnreachable. Operand 194 states. [2019-05-23 09:24:34,157 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2019-05-23 09:24:34,157 INFO L146 ILogger]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 190 [2019-05-23 09:24:34,157 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:34,157 INFO L146 ILogger]: Abstraction has 194 states and 194 transitions. [2019-05-23 09:24:34,157 INFO L146 ILogger]: Interpolant automaton has 66 states. [2019-05-23 09:24:34,158 INFO L146 ILogger]: Start isEmpty. Operand 194 states and 194 transitions. [2019-05-23 09:24:34,158 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 194 [2019-05-23 09:24:34,158 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:34,158 INFO L146 ILogger]: trace histogram [64, 63, 63, 1, 1, 1] [2019-05-23 09:24:34,159 INFO L146 ILogger]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:34,159 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:34,159 INFO L146 ILogger]: Analyzing trace with hash 1924586922, now seen corresponding path program 63 times [2019-05-23 09:24:34,159 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:34,215 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:34,229 INFO L146 ILogger]: Trace formula consists of 392 conjuncts, 195 conjunts are in the unsatisfiable core [2019-05-23 09:24:34,231 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:34,275 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:34,276 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:34,282 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:34,282 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:34,283 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:36,364 INFO L146 ILogger]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:36,364 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:36,364 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-05-23 09:24:36,365 INFO L146 ILogger]: Interpolant automaton has 67 states [2019-05-23 09:24:36,365 INFO L146 ILogger]: Constructing interpolant automaton starting with 67 interpolants. [2019-05-23 09:24:36,366 INFO L146 ILogger]: CoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:24:36,366 INFO L146 ILogger]: Start difference. First operand 194 states and 194 transitions. Second operand 67 states. [2019-05-23 09:24:39,551 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:39,551 INFO L146 ILogger]: Finished difference Result 198 states and 198 transitions. [2019-05-23 09:24:39,552 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-05-23 09:24:39,552 INFO L146 ILogger]: Start accepts. Automaton has 67 states. Word has length 193 [2019-05-23 09:24:39,552 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:39,553 INFO L146 ILogger]: With dead ends: 198 [2019-05-23 09:24:39,553 INFO L146 ILogger]: Without dead ends: 198 [2019-05-23 09:24:39,555 INFO L146 ILogger]: 0 DeclaredPredicates, 256 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6435, Invalid=10595, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 09:24:39,555 INFO L146 ILogger]: Start minimizeSevpa. Operand 198 states. [2019-05-23 09:24:39,557 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-05-23 09:24:39,557 INFO L146 ILogger]: Start removeUnreachable. Operand 197 states. [2019-05-23 09:24:39,558 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-05-23 09:24:39,558 INFO L146 ILogger]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 193 [2019-05-23 09:24:39,558 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:39,558 INFO L146 ILogger]: Abstraction has 197 states and 197 transitions. [2019-05-23 09:24:39,558 INFO L146 ILogger]: Interpolant automaton has 67 states. [2019-05-23 09:24:39,559 INFO L146 ILogger]: Start isEmpty. Operand 197 states and 197 transitions. [2019-05-23 09:24:39,559 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 197 [2019-05-23 09:24:39,560 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:39,560 INFO L146 ILogger]: trace histogram [65, 64, 64, 1, 1, 1] [2019-05-23 09:24:39,560 INFO L146 ILogger]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:39,560 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:39,560 INFO L146 ILogger]: Analyzing trace with hash 1850601507, now seen corresponding path program 64 times [2019-05-23 09:24:39,561 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:39,610 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:39,626 INFO L146 ILogger]: Trace formula consists of 398 conjuncts, 198 conjunts are in the unsatisfiable core [2019-05-23 09:24:39,628 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:39,638 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:39,638 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:39,648 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:39,648 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:39,648 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:41,750 INFO L146 ILogger]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:41,750 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:41,750 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-05-23 09:24:41,750 INFO L146 ILogger]: Interpolant automaton has 68 states [2019-05-23 09:24:41,751 INFO L146 ILogger]: Constructing interpolant automaton starting with 68 interpolants. [2019-05-23 09:24:41,751 INFO L146 ILogger]: CoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 09:24:41,751 INFO L146 ILogger]: Start difference. First operand 197 states and 197 transitions. Second operand 68 states. [2019-05-23 09:24:44,988 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:44,989 INFO L146 ILogger]: Finished difference Result 201 states and 201 transitions. [2019-05-23 09:24:44,989 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-05-23 09:24:44,989 INFO L146 ILogger]: Start accepts. Automaton has 68 states. Word has length 196 [2019-05-23 09:24:44,990 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:44,991 INFO L146 ILogger]: With dead ends: 201 [2019-05-23 09:24:44,991 INFO L146 ILogger]: Without dead ends: 201 [2019-05-23 09:24:44,992 INFO L146 ILogger]: 0 DeclaredPredicates, 260 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6633, Invalid=10923, Unknown=0, NotChecked=0, Total=17556 [2019-05-23 09:24:44,993 INFO L146 ILogger]: Start minimizeSevpa. Operand 201 states. [2019-05-23 09:24:44,995 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-05-23 09:24:44,995 INFO L146 ILogger]: Start removeUnreachable. Operand 200 states. [2019-05-23 09:24:44,995 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2019-05-23 09:24:44,995 INFO L146 ILogger]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 196 [2019-05-23 09:24:44,996 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:44,996 INFO L146 ILogger]: Abstraction has 200 states and 200 transitions. [2019-05-23 09:24:44,996 INFO L146 ILogger]: Interpolant automaton has 68 states. [2019-05-23 09:24:44,996 INFO L146 ILogger]: Start isEmpty. Operand 200 states and 200 transitions. [2019-05-23 09:24:44,997 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 200 [2019-05-23 09:24:44,997 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:44,997 INFO L146 ILogger]: trace histogram [66, 65, 65, 1, 1, 1] [2019-05-23 09:24:44,997 INFO L146 ILogger]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:44,998 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:44,998 INFO L146 ILogger]: Analyzing trace with hash 1069326090, now seen corresponding path program 65 times [2019-05-23 09:24:44,998 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:45,082 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:45,104 INFO L146 ILogger]: Trace formula consists of 404 conjuncts, 201 conjunts are in the unsatisfiable core [2019-05-23 09:24:45,106 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:45,144 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:45,144 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:45,176 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:45,176 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:45,176 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:47,471 INFO L146 ILogger]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:47,471 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:47,471 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-05-23 09:24:47,472 INFO L146 ILogger]: Interpolant automaton has 69 states [2019-05-23 09:24:47,472 INFO L146 ILogger]: Constructing interpolant automaton starting with 69 interpolants. [2019-05-23 09:24:47,472 INFO L146 ILogger]: CoverageRelationStatistics Valid=2280, Invalid=2412, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:24:47,472 INFO L146 ILogger]: Start difference. First operand 200 states and 200 transitions. Second operand 69 states. [2019-05-23 09:24:50,932 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:50,933 INFO L146 ILogger]: Finished difference Result 204 states and 204 transitions. [2019-05-23 09:24:50,933 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-05-23 09:24:50,933 INFO L146 ILogger]: Start accepts. Automaton has 69 states. Word has length 199 [2019-05-23 09:24:50,933 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:50,935 INFO L146 ILogger]: With dead ends: 204 [2019-05-23 09:24:50,935 INFO L146 ILogger]: Without dead ends: 204 [2019-05-23 09:24:50,936 INFO L146 ILogger]: 0 DeclaredPredicates, 264 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6834, Invalid=11256, Unknown=0, NotChecked=0, Total=18090 [2019-05-23 09:24:50,936 INFO L146 ILogger]: Start minimizeSevpa. Operand 204 states. [2019-05-23 09:24:50,938 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-05-23 09:24:50,938 INFO L146 ILogger]: Start removeUnreachable. Operand 203 states. [2019-05-23 09:24:50,939 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2019-05-23 09:24:50,939 INFO L146 ILogger]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 199 [2019-05-23 09:24:50,939 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:50,939 INFO L146 ILogger]: Abstraction has 203 states and 203 transitions. [2019-05-23 09:24:50,939 INFO L146 ILogger]: Interpolant automaton has 69 states. [2019-05-23 09:24:50,939 INFO L146 ILogger]: Start isEmpty. Operand 203 states and 203 transitions. [2019-05-23 09:24:50,940 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 203 [2019-05-23 09:24:50,940 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:50,940 INFO L146 ILogger]: trace histogram [67, 66, 66, 1, 1, 1] [2019-05-23 09:24:50,940 INFO L146 ILogger]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:50,940 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:50,940 INFO L146 ILogger]: Analyzing trace with hash 521155267, now seen corresponding path program 66 times [2019-05-23 09:24:50,941 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:50,991 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:51,013 INFO L146 ILogger]: Trace formula consists of 410 conjuncts, 204 conjunts are in the unsatisfiable core [2019-05-23 09:24:51,016 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:51,054 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:51,055 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:51,123 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:51,124 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:51,124 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:53,611 INFO L146 ILogger]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:53,611 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:53,611 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-05-23 09:24:53,611 INFO L146 ILogger]: Interpolant automaton has 70 states [2019-05-23 09:24:53,612 INFO L146 ILogger]: Constructing interpolant automaton starting with 70 interpolants. [2019-05-23 09:24:53,612 INFO L146 ILogger]: CoverageRelationStatistics Valid=2348, Invalid=2482, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 09:24:53,612 INFO L146 ILogger]: Start difference. First operand 203 states and 203 transitions. Second operand 70 states. [2019-05-23 09:24:57,092 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:57,092 INFO L146 ILogger]: Finished difference Result 207 states and 207 transitions. [2019-05-23 09:24:57,092 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-05-23 09:24:57,092 INFO L146 ILogger]: Start accepts. Automaton has 70 states. Word has length 202 [2019-05-23 09:24:57,093 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:57,094 INFO L146 ILogger]: With dead ends: 207 [2019-05-23 09:24:57,094 INFO L146 ILogger]: Without dead ends: 207 [2019-05-23 09:24:57,095 INFO L146 ILogger]: 0 DeclaredPredicates, 268 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7038, Invalid=11594, Unknown=0, NotChecked=0, Total=18632 [2019-05-23 09:24:57,095 INFO L146 ILogger]: Start minimizeSevpa. Operand 207 states. [2019-05-23 09:24:57,097 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-05-23 09:24:57,097 INFO L146 ILogger]: Start removeUnreachable. Operand 206 states. [2019-05-23 09:24:57,097 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-05-23 09:24:57,097 INFO L146 ILogger]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 202 [2019-05-23 09:24:57,098 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:57,098 INFO L146 ILogger]: Abstraction has 206 states and 206 transitions. [2019-05-23 09:24:57,098 INFO L146 ILogger]: Interpolant automaton has 70 states. [2019-05-23 09:24:57,098 INFO L146 ILogger]: Start isEmpty. Operand 206 states and 206 transitions. [2019-05-23 09:24:57,098 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 206 [2019-05-23 09:24:57,098 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:57,099 INFO L146 ILogger]: trace histogram [68, 67, 67, 1, 1, 1] [2019-05-23 09:24:57,099 INFO L146 ILogger]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:57,099 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:57,099 INFO L146 ILogger]: Analyzing trace with hash -570173334, now seen corresponding path program 67 times [2019-05-23 09:24:57,100 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:57,157 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:57,173 INFO L146 ILogger]: Trace formula consists of 416 conjuncts, 207 conjunts are in the unsatisfiable core [2019-05-23 09:24:57,175 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:57,180 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:57,180 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:57,192 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:57,192 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:57,192 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:59,411 INFO L146 ILogger]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:59,411 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:59,411 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-05-23 09:24:59,412 INFO L146 ILogger]: Interpolant automaton has 71 states [2019-05-23 09:24:59,412 INFO L146 ILogger]: Constructing interpolant automaton starting with 71 interpolants. [2019-05-23 09:24:59,412 INFO L146 ILogger]: CoverageRelationStatistics Valid=2417, Invalid=2553, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:24:59,412 INFO L146 ILogger]: Start difference. First operand 206 states and 206 transitions. Second operand 71 states. [2019-05-23 09:25:02,900 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:02,900 INFO L146 ILogger]: Finished difference Result 210 states and 210 transitions. [2019-05-23 09:25:02,900 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-05-23 09:25:02,901 INFO L146 ILogger]: Start accepts. Automaton has 71 states. Word has length 205 [2019-05-23 09:25:02,901 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:02,902 INFO L146 ILogger]: With dead ends: 210 [2019-05-23 09:25:02,902 INFO L146 ILogger]: Without dead ends: 210 [2019-05-23 09:25:02,903 INFO L146 ILogger]: 0 DeclaredPredicates, 272 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7245, Invalid=11937, Unknown=0, NotChecked=0, Total=19182 [2019-05-23 09:25:02,903 INFO L146 ILogger]: Start minimizeSevpa. Operand 210 states. [2019-05-23 09:25:02,905 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-05-23 09:25:02,906 INFO L146 ILogger]: Start removeUnreachable. Operand 209 states. [2019-05-23 09:25:02,906 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-05-23 09:25:02,906 INFO L146 ILogger]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 205 [2019-05-23 09:25:02,906 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:02,906 INFO L146 ILogger]: Abstraction has 209 states and 209 transitions. [2019-05-23 09:25:02,906 INFO L146 ILogger]: Interpolant automaton has 71 states. [2019-05-23 09:25:02,906 INFO L146 ILogger]: Start isEmpty. Operand 209 states and 209 transitions. [2019-05-23 09:25:02,907 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 209 [2019-05-23 09:25:02,907 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:02,908 INFO L146 ILogger]: trace histogram [69, 68, 68, 1, 1, 1] [2019-05-23 09:25:02,908 INFO L146 ILogger]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:02,908 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:02,908 INFO L146 ILogger]: Analyzing trace with hash 561904995, now seen corresponding path program 68 times [2019-05-23 09:25:02,909 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:02,992 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:03,018 INFO L146 ILogger]: Trace formula consists of 422 conjuncts, 210 conjunts are in the unsatisfiable core [2019-05-23 09:25:03,021 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:03,058 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:03,059 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:03,075 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:03,076 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:03,076 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:05,587 INFO L146 ILogger]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:05,588 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:05,588 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-05-23 09:25:05,588 INFO L146 ILogger]: Interpolant automaton has 72 states [2019-05-23 09:25:05,588 INFO L146 ILogger]: Constructing interpolant automaton starting with 72 interpolants. [2019-05-23 09:25:05,589 INFO L146 ILogger]: CoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 09:25:05,589 INFO L146 ILogger]: Start difference. First operand 209 states and 209 transitions. Second operand 72 states. [2019-05-23 09:25:09,025 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:09,025 INFO L146 ILogger]: Finished difference Result 213 states and 213 transitions. [2019-05-23 09:25:09,026 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-23 09:25:09,026 INFO L146 ILogger]: Start accepts. Automaton has 72 states. Word has length 208 [2019-05-23 09:25:09,026 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:09,027 INFO L146 ILogger]: With dead ends: 213 [2019-05-23 09:25:09,027 INFO L146 ILogger]: Without dead ends: 213 [2019-05-23 09:25:09,029 INFO L146 ILogger]: 0 DeclaredPredicates, 276 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7455, Invalid=12285, Unknown=0, NotChecked=0, Total=19740 [2019-05-23 09:25:09,029 INFO L146 ILogger]: Start minimizeSevpa. Operand 213 states. [2019-05-23 09:25:09,031 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-05-23 09:25:09,031 INFO L146 ILogger]: Start removeUnreachable. Operand 212 states. [2019-05-23 09:25:09,031 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-05-23 09:25:09,031 INFO L146 ILogger]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 208 [2019-05-23 09:25:09,031 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:09,031 INFO L146 ILogger]: Abstraction has 212 states and 212 transitions. [2019-05-23 09:25:09,031 INFO L146 ILogger]: Interpolant automaton has 72 states. [2019-05-23 09:25:09,032 INFO L146 ILogger]: Start isEmpty. Operand 212 states and 212 transitions. [2019-05-23 09:25:09,032 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 212 [2019-05-23 09:25:09,032 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:09,033 INFO L146 ILogger]: trace histogram [70, 69, 69, 1, 1, 1] [2019-05-23 09:25:09,033 INFO L146 ILogger]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:09,033 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:09,033 INFO L146 ILogger]: Analyzing trace with hash -2070771254, now seen corresponding path program 69 times [2019-05-23 09:25:09,034 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:09,099 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:09,124 INFO L146 ILogger]: Trace formula consists of 428 conjuncts, 213 conjunts are in the unsatisfiable core [2019-05-23 09:25:09,127 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:09,132 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:09,132 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:09,140 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:09,140 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:09,141 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:11,748 INFO L146 ILogger]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:11,748 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:11,748 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-05-23 09:25:11,748 INFO L146 ILogger]: Interpolant automaton has 73 states [2019-05-23 09:25:11,749 INFO L146 ILogger]: Constructing interpolant automaton starting with 73 interpolants. [2019-05-23 09:25:11,749 INFO L146 ILogger]: CoverageRelationStatistics Valid=2558, Invalid=2698, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:25:11,749 INFO L146 ILogger]: Start difference. First operand 212 states and 212 transitions. Second operand 73 states. [2019-05-23 09:25:15,400 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:15,400 INFO L146 ILogger]: Finished difference Result 216 states and 216 transitions. [2019-05-23 09:25:15,401 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-05-23 09:25:15,401 INFO L146 ILogger]: Start accepts. Automaton has 73 states. Word has length 211 [2019-05-23 09:25:15,401 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:15,402 INFO L146 ILogger]: With dead ends: 216 [2019-05-23 09:25:15,402 INFO L146 ILogger]: Without dead ends: 216 [2019-05-23 09:25:15,404 INFO L146 ILogger]: 0 DeclaredPredicates, 280 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7668, Invalid=12638, Unknown=0, NotChecked=0, Total=20306 [2019-05-23 09:25:15,404 INFO L146 ILogger]: Start minimizeSevpa. Operand 216 states. [2019-05-23 09:25:15,407 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-05-23 09:25:15,407 INFO L146 ILogger]: Start removeUnreachable. Operand 215 states. [2019-05-23 09:25:15,407 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2019-05-23 09:25:15,408 INFO L146 ILogger]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 211 [2019-05-23 09:25:15,408 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:15,408 INFO L146 ILogger]: Abstraction has 215 states and 215 transitions. [2019-05-23 09:25:15,408 INFO L146 ILogger]: Interpolant automaton has 73 states. [2019-05-23 09:25:15,408 INFO L146 ILogger]: Start isEmpty. Operand 215 states and 215 transitions. [2019-05-23 09:25:15,409 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 215 [2019-05-23 09:25:15,409 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:15,409 INFO L146 ILogger]: trace histogram [71, 70, 70, 1, 1, 1] [2019-05-23 09:25:15,410 INFO L146 ILogger]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:15,410 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:15,410 INFO L146 ILogger]: Analyzing trace with hash -1731112957, now seen corresponding path program 70 times [2019-05-23 09:25:15,410 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:15,483 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:15,508 INFO L146 ILogger]: Trace formula consists of 434 conjuncts, 216 conjunts are in the unsatisfiable core [2019-05-23 09:25:15,510 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:15,533 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:15,534 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:15,544 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:15,544 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:15,544 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:18,042 INFO L146 ILogger]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:18,042 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:18,042 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-05-23 09:25:18,042 INFO L146 ILogger]: Interpolant automaton has 74 states [2019-05-23 09:25:18,043 INFO L146 ILogger]: Constructing interpolant automaton starting with 74 interpolants. [2019-05-23 09:25:18,043 INFO L146 ILogger]: CoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 09:25:18,043 INFO L146 ILogger]: Start difference. First operand 215 states and 215 transitions. Second operand 74 states. [2019-05-23 09:25:21,910 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:21,910 INFO L146 ILogger]: Finished difference Result 219 states and 219 transitions. [2019-05-23 09:25:21,910 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-05-23 09:25:21,911 INFO L146 ILogger]: Start accepts. Automaton has 74 states. Word has length 214 [2019-05-23 09:25:21,911 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:21,912 INFO L146 ILogger]: With dead ends: 219 [2019-05-23 09:25:21,912 INFO L146 ILogger]: Without dead ends: 219 [2019-05-23 09:25:21,913 INFO L146 ILogger]: 0 DeclaredPredicates, 284 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7884, Invalid=12996, Unknown=0, NotChecked=0, Total=20880 [2019-05-23 09:25:21,913 INFO L146 ILogger]: Start minimizeSevpa. Operand 219 states. [2019-05-23 09:25:21,915 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 219 to 218. [2019-05-23 09:25:21,915 INFO L146 ILogger]: Start removeUnreachable. Operand 218 states. [2019-05-23 09:25:21,915 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2019-05-23 09:25:21,916 INFO L146 ILogger]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 214 [2019-05-23 09:25:21,916 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:21,916 INFO L146 ILogger]: Abstraction has 218 states and 218 transitions. [2019-05-23 09:25:21,916 INFO L146 ILogger]: Interpolant automaton has 74 states. [2019-05-23 09:25:21,916 INFO L146 ILogger]: Start isEmpty. Operand 218 states and 218 transitions. [2019-05-23 09:25:21,917 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 218 [2019-05-23 09:25:21,917 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:21,917 INFO L146 ILogger]: trace histogram [72, 71, 71, 1, 1, 1] [2019-05-23 09:25:21,917 INFO L146 ILogger]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:21,917 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:21,917 INFO L146 ILogger]: Analyzing trace with hash -1913736406, now seen corresponding path program 71 times [2019-05-23 09:25:21,918 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:21,979 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:22,006 INFO L146 ILogger]: Trace formula consists of 440 conjuncts, 219 conjunts are in the unsatisfiable core [2019-05-23 09:25:22,009 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:22,048 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:22,049 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:22,058 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:22,058 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:22,059 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:24,563 INFO L146 ILogger]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:24,564 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:24,564 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-05-23 09:25:24,564 INFO L146 ILogger]: Interpolant automaton has 75 states [2019-05-23 09:25:24,565 INFO L146 ILogger]: Constructing interpolant automaton starting with 75 interpolants. [2019-05-23 09:25:24,565 INFO L146 ILogger]: CoverageRelationStatistics Valid=2703, Invalid=2847, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:25:24,565 INFO L146 ILogger]: Start difference. First operand 218 states and 218 transitions. Second operand 75 states. [2019-05-23 09:25:28,550 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:28,551 INFO L146 ILogger]: Finished difference Result 222 states and 222 transitions. [2019-05-23 09:25:28,551 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-05-23 09:25:28,551 INFO L146 ILogger]: Start accepts. Automaton has 75 states. Word has length 217 [2019-05-23 09:25:28,552 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:28,553 INFO L146 ILogger]: With dead ends: 222 [2019-05-23 09:25:28,553 INFO L146 ILogger]: Without dead ends: 222 [2019-05-23 09:25:28,554 INFO L146 ILogger]: 0 DeclaredPredicates, 288 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8103, Invalid=13359, Unknown=0, NotChecked=0, Total=21462 [2019-05-23 09:25:28,555 INFO L146 ILogger]: Start minimizeSevpa. Operand 222 states. [2019-05-23 09:25:28,557 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-05-23 09:25:28,557 INFO L146 ILogger]: Start removeUnreachable. Operand 221 states. [2019-05-23 09:25:28,557 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-05-23 09:25:28,557 INFO L146 ILogger]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 217 [2019-05-23 09:25:28,557 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:28,557 INFO L146 ILogger]: Abstraction has 221 states and 221 transitions. [2019-05-23 09:25:28,557 INFO L146 ILogger]: Interpolant automaton has 75 states. [2019-05-23 09:25:28,557 INFO L146 ILogger]: Start isEmpty. Operand 221 states and 221 transitions. [2019-05-23 09:25:28,558 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 221 [2019-05-23 09:25:28,558 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:28,558 INFO L146 ILogger]: trace histogram [73, 72, 72, 1, 1, 1] [2019-05-23 09:25:28,558 INFO L146 ILogger]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:28,559 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:28,559 INFO L146 ILogger]: Analyzing trace with hash -725341533, now seen corresponding path program 72 times [2019-05-23 09:25:28,559 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:28,620 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:28,640 INFO L146 ILogger]: Trace formula consists of 446 conjuncts, 222 conjunts are in the unsatisfiable core [2019-05-23 09:25:28,642 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:28,649 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:28,649 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:28,657 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:28,657 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:28,657 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:31,469 INFO L146 ILogger]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:31,470 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:31,470 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-05-23 09:25:31,470 INFO L146 ILogger]: Interpolant automaton has 76 states [2019-05-23 09:25:31,471 INFO L146 ILogger]: Constructing interpolant automaton starting with 76 interpolants. [2019-05-23 09:25:31,471 INFO L146 ILogger]: CoverageRelationStatistics Valid=2777, Invalid=2923, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 09:25:31,471 INFO L146 ILogger]: Start difference. First operand 221 states and 221 transitions. Second operand 76 states. [2019-05-23 09:25:35,242 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:35,242 INFO L146 ILogger]: Finished difference Result 225 states and 225 transitions. [2019-05-23 09:25:35,242 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-05-23 09:25:35,242 INFO L146 ILogger]: Start accepts. Automaton has 76 states. Word has length 220 [2019-05-23 09:25:35,243 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:35,244 INFO L146 ILogger]: With dead ends: 225 [2019-05-23 09:25:35,244 INFO L146 ILogger]: Without dead ends: 225 [2019-05-23 09:25:35,246 INFO L146 ILogger]: 0 DeclaredPredicates, 292 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8325, Invalid=13727, Unknown=0, NotChecked=0, Total=22052 [2019-05-23 09:25:35,246 INFO L146 ILogger]: Start minimizeSevpa. Operand 225 states. [2019-05-23 09:25:35,248 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 225 to 224. [2019-05-23 09:25:35,248 INFO L146 ILogger]: Start removeUnreachable. Operand 224 states. [2019-05-23 09:25:35,249 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2019-05-23 09:25:35,249 INFO L146 ILogger]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 220 [2019-05-23 09:25:35,249 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:35,249 INFO L146 ILogger]: Abstraction has 224 states and 224 transitions. [2019-05-23 09:25:35,249 INFO L146 ILogger]: Interpolant automaton has 76 states. [2019-05-23 09:25:35,249 INFO L146 ILogger]: Start isEmpty. Operand 224 states and 224 transitions. [2019-05-23 09:25:35,250 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 224 [2019-05-23 09:25:35,250 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:35,250 INFO L146 ILogger]: trace histogram [74, 73, 73, 1, 1, 1] [2019-05-23 09:25:35,250 INFO L146 ILogger]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:35,250 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:35,250 INFO L146 ILogger]: Analyzing trace with hash -669100918, now seen corresponding path program 73 times [2019-05-23 09:25:35,251 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:35,319 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:35,340 INFO L146 ILogger]: Trace formula consists of 452 conjuncts, 225 conjunts are in the unsatisfiable core [2019-05-23 09:25:35,342 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:35,351 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:35,352 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:35,359 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:35,359 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:35,359 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:38,306 INFO L146 ILogger]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:38,307 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:38,307 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-05-23 09:25:38,307 INFO L146 ILogger]: Interpolant automaton has 77 states [2019-05-23 09:25:38,308 INFO L146 ILogger]: Constructing interpolant automaton starting with 77 interpolants. [2019-05-23 09:25:38,308 INFO L146 ILogger]: CoverageRelationStatistics Valid=2852, Invalid=3000, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:25:38,308 INFO L146 ILogger]: Start difference. First operand 224 states and 224 transitions. Second operand 77 states. [2019-05-23 09:25:42,308 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:42,308 INFO L146 ILogger]: Finished difference Result 228 states and 228 transitions. [2019-05-23 09:25:42,308 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-05-23 09:25:42,308 INFO L146 ILogger]: Start accepts. Automaton has 77 states. Word has length 223 [2019-05-23 09:25:42,309 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:42,310 INFO L146 ILogger]: With dead ends: 228 [2019-05-23 09:25:42,310 INFO L146 ILogger]: Without dead ends: 228 [2019-05-23 09:25:42,312 INFO L146 ILogger]: 0 DeclaredPredicates, 296 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8550, Invalid=14100, Unknown=0, NotChecked=0, Total=22650 [2019-05-23 09:25:42,312 INFO L146 ILogger]: Start minimizeSevpa. Operand 228 states. [2019-05-23 09:25:42,314 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 228 to 227. [2019-05-23 09:25:42,315 INFO L146 ILogger]: Start removeUnreachable. Operand 227 states. [2019-05-23 09:25:42,315 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2019-05-23 09:25:42,315 INFO L146 ILogger]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 223 [2019-05-23 09:25:42,315 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:42,315 INFO L146 ILogger]: Abstraction has 227 states and 227 transitions. [2019-05-23 09:25:42,316 INFO L146 ILogger]: Interpolant automaton has 77 states. [2019-05-23 09:25:42,316 INFO L146 ILogger]: Start isEmpty. Operand 227 states and 227 transitions. [2019-05-23 09:25:42,317 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 227 [2019-05-23 09:25:42,317 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:42,317 INFO L146 ILogger]: trace histogram [75, 74, 74, 1, 1, 1] [2019-05-23 09:25:42,317 INFO L146 ILogger]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:42,317 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:42,318 INFO L146 ILogger]: Analyzing trace with hash -242184893, now seen corresponding path program 74 times [2019-05-23 09:25:42,318 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:42,420 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:42,450 INFO L146 ILogger]: Trace formula consists of 458 conjuncts, 228 conjunts are in the unsatisfiable core [2019-05-23 09:25:42,453 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:42,490 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:42,490 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:42,529 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:42,530 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:42,530 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:45,174 INFO L146 ILogger]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:45,174 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:45,175 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-05-23 09:25:45,175 INFO L146 ILogger]: Interpolant automaton has 78 states [2019-05-23 09:25:45,175 INFO L146 ILogger]: Constructing interpolant automaton starting with 78 interpolants. [2019-05-23 09:25:45,176 INFO L146 ILogger]: CoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 09:25:45,176 INFO L146 ILogger]: Start difference. First operand 227 states and 227 transitions. Second operand 78 states. [2019-05-23 09:25:49,234 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:49,234 INFO L146 ILogger]: Finished difference Result 231 states and 231 transitions. [2019-05-23 09:25:49,234 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-23 09:25:49,234 INFO L146 ILogger]: Start accepts. Automaton has 78 states. Word has length 226 [2019-05-23 09:25:49,235 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:49,236 INFO L146 ILogger]: With dead ends: 231 [2019-05-23 09:25:49,236 INFO L146 ILogger]: Without dead ends: 231 [2019-05-23 09:25:49,237 INFO L146 ILogger]: 0 DeclaredPredicates, 300 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8778, Invalid=14478, Unknown=0, NotChecked=0, Total=23256 [2019-05-23 09:25:49,237 INFO L146 ILogger]: Start minimizeSevpa. Operand 231 states. [2019-05-23 09:25:49,240 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 231 to 230. [2019-05-23 09:25:49,240 INFO L146 ILogger]: Start removeUnreachable. Operand 230 states. [2019-05-23 09:25:49,240 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2019-05-23 09:25:49,241 INFO L146 ILogger]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 226 [2019-05-23 09:25:49,241 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:49,241 INFO L146 ILogger]: Abstraction has 230 states and 230 transitions. [2019-05-23 09:25:49,241 INFO L146 ILogger]: Interpolant automaton has 78 states. [2019-05-23 09:25:49,241 INFO L146 ILogger]: Start isEmpty. Operand 230 states and 230 transitions. [2019-05-23 09:25:49,242 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 230 [2019-05-23 09:25:49,242 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:49,242 INFO L146 ILogger]: trace histogram [76, 75, 75, 1, 1, 1] [2019-05-23 09:25:49,243 INFO L146 ILogger]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:49,243 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:49,243 INFO L146 ILogger]: Analyzing trace with hash 614952426, now seen corresponding path program 75 times [2019-05-23 09:25:49,243 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:49,306 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:49,327 INFO L146 ILogger]: Trace formula consists of 464 conjuncts, 231 conjunts are in the unsatisfiable core [2019-05-23 09:25:49,329 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:49,334 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:49,334 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:49,347 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:49,347 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:49,348 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:52,175 INFO L146 ILogger]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:52,176 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:52,176 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-05-23 09:25:52,176 INFO L146 ILogger]: Interpolant automaton has 79 states [2019-05-23 09:25:52,177 INFO L146 ILogger]: Constructing interpolant automaton starting with 79 interpolants. [2019-05-23 09:25:52,177 INFO L146 ILogger]: CoverageRelationStatistics Valid=3005, Invalid=3157, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:25:52,177 INFO L146 ILogger]: Start difference. First operand 230 states and 230 transitions. Second operand 79 states. [2019-05-23 09:25:56,333 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:56,334 INFO L146 ILogger]: Finished difference Result 234 states and 234 transitions. [2019-05-23 09:25:56,334 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-05-23 09:25:56,334 INFO L146 ILogger]: Start accepts. Automaton has 79 states. Word has length 229 [2019-05-23 09:25:56,335 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:56,336 INFO L146 ILogger]: With dead ends: 234 [2019-05-23 09:25:56,336 INFO L146 ILogger]: Without dead ends: 234 [2019-05-23 09:25:56,337 INFO L146 ILogger]: 0 DeclaredPredicates, 304 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9009, Invalid=14861, Unknown=0, NotChecked=0, Total=23870 [2019-05-23 09:25:56,338 INFO L146 ILogger]: Start minimizeSevpa. Operand 234 states. [2019-05-23 09:25:56,339 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-05-23 09:25:56,339 INFO L146 ILogger]: Start removeUnreachable. Operand 233 states. [2019-05-23 09:25:56,340 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-05-23 09:25:56,340 INFO L146 ILogger]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 229 [2019-05-23 09:25:56,340 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:56,340 INFO L146 ILogger]: Abstraction has 233 states and 233 transitions. [2019-05-23 09:25:56,340 INFO L146 ILogger]: Interpolant automaton has 79 states. [2019-05-23 09:25:56,341 INFO L146 ILogger]: Start isEmpty. Operand 233 states and 233 transitions. [2019-05-23 09:25:56,341 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 233 [2019-05-23 09:25:56,342 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:56,342 INFO L146 ILogger]: trace histogram [77, 76, 76, 1, 1, 1] [2019-05-23 09:25:56,342 INFO L146 ILogger]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:56,342 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:56,342 INFO L146 ILogger]: Analyzing trace with hash 2012248035, now seen corresponding path program 76 times [2019-05-23 09:25:56,343 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:56,418 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:56,443 INFO L146 ILogger]: Trace formula consists of 470 conjuncts, 234 conjunts are in the unsatisfiable core [2019-05-23 09:25:56,446 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:56,451 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:56,452 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:56,462 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:56,462 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:56,463 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:59,385 INFO L146 ILogger]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:59,386 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:59,386 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-05-23 09:25:59,386 INFO L146 ILogger]: Interpolant automaton has 80 states [2019-05-23 09:25:59,387 INFO L146 ILogger]: Constructing interpolant automaton starting with 80 interpolants. [2019-05-23 09:25:59,387 INFO L146 ILogger]: CoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 09:25:59,387 INFO L146 ILogger]: Start difference. First operand 233 states and 233 transitions. Second operand 80 states. [2019-05-23 09:26:03,706 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:03,707 INFO L146 ILogger]: Finished difference Result 237 states and 237 transitions. [2019-05-23 09:26:03,707 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-05-23 09:26:03,707 INFO L146 ILogger]: Start accepts. Automaton has 80 states. Word has length 232 [2019-05-23 09:26:03,708 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:03,709 INFO L146 ILogger]: With dead ends: 237 [2019-05-23 09:26:03,709 INFO L146 ILogger]: Without dead ends: 237 [2019-05-23 09:26:03,711 INFO L146 ILogger]: 0 DeclaredPredicates, 308 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9243, Invalid=15249, Unknown=0, NotChecked=0, Total=24492 [2019-05-23 09:26:03,711 INFO L146 ILogger]: Start minimizeSevpa. Operand 237 states. [2019-05-23 09:26:03,713 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 237 to 236. [2019-05-23 09:26:03,713 INFO L146 ILogger]: Start removeUnreachable. Operand 236 states. [2019-05-23 09:26:03,713 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2019-05-23 09:26:03,714 INFO L146 ILogger]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 232 [2019-05-23 09:26:03,714 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:03,714 INFO L146 ILogger]: Abstraction has 236 states and 236 transitions. [2019-05-23 09:26:03,714 INFO L146 ILogger]: Interpolant automaton has 80 states. [2019-05-23 09:26:03,714 INFO L146 ILogger]: Start isEmpty. Operand 236 states and 236 transitions. [2019-05-23 09:26:03,715 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 236 [2019-05-23 09:26:03,715 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:03,715 INFO L146 ILogger]: trace histogram [78, 77, 77, 1, 1, 1] [2019-05-23 09:26:03,715 INFO L146 ILogger]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:03,715 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:03,715 INFO L146 ILogger]: Analyzing trace with hash 2022702922, now seen corresponding path program 77 times [2019-05-23 09:26:03,716 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:03,784 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:03,812 INFO L146 ILogger]: Trace formula consists of 476 conjuncts, 237 conjunts are in the unsatisfiable core [2019-05-23 09:26:03,815 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:03,820 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:26:03,821 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:03,834 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:03,834 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:03,835 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:26:06,986 INFO L146 ILogger]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:06,986 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:06,986 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-05-23 09:26:06,987 INFO L146 ILogger]: Interpolant automaton has 81 states [2019-05-23 09:26:06,988 INFO L146 ILogger]: Constructing interpolant automaton starting with 81 interpolants. [2019-05-23 09:26:06,988 INFO L146 ILogger]: CoverageRelationStatistics Valid=3162, Invalid=3318, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:26:06,988 INFO L146 ILogger]: Start difference. First operand 236 states and 236 transitions. Second operand 81 states. [2019-05-23 09:26:11,307 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:11,307 INFO L146 ILogger]: Finished difference Result 240 states and 240 transitions. [2019-05-23 09:26:11,308 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-05-23 09:26:11,308 INFO L146 ILogger]: Start accepts. Automaton has 81 states. Word has length 235 [2019-05-23 09:26:11,308 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:11,309 INFO L146 ILogger]: With dead ends: 240 [2019-05-23 09:26:11,309 INFO L146 ILogger]: Without dead ends: 240 [2019-05-23 09:26:11,310 INFO L146 ILogger]: 0 DeclaredPredicates, 312 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9480, Invalid=15642, Unknown=0, NotChecked=0, Total=25122 [2019-05-23 09:26:11,311 INFO L146 ILogger]: Start minimizeSevpa. Operand 240 states. [2019-05-23 09:26:11,312 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 240 to 239. [2019-05-23 09:26:11,313 INFO L146 ILogger]: Start removeUnreachable. Operand 239 states. [2019-05-23 09:26:11,313 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2019-05-23 09:26:11,313 INFO L146 ILogger]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 235 [2019-05-23 09:26:11,313 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:11,313 INFO L146 ILogger]: Abstraction has 239 states and 239 transitions. [2019-05-23 09:26:11,313 INFO L146 ILogger]: Interpolant automaton has 81 states. [2019-05-23 09:26:11,313 INFO L146 ILogger]: Start isEmpty. Operand 239 states and 239 transitions. [2019-05-23 09:26:11,314 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 239 [2019-05-23 09:26:11,314 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:11,314 INFO L146 ILogger]: trace histogram [79, 78, 78, 1, 1, 1] [2019-05-23 09:26:11,314 INFO L146 ILogger]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:11,315 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:11,315 INFO L146 ILogger]: Analyzing trace with hash -48371069, now seen corresponding path program 78 times [2019-05-23 09:26:11,315 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:11,387 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:11,410 INFO L146 ILogger]: Trace formula consists of 482 conjuncts, 240 conjunts are in the unsatisfiable core [2019-05-23 09:26:11,412 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:11,416 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:26:11,416 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:11,423 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:11,423 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:11,423 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:26:14,373 INFO L146 ILogger]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:14,374 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:14,374 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-05-23 09:26:14,374 INFO L146 ILogger]: Interpolant automaton has 82 states [2019-05-23 09:26:14,375 INFO L146 ILogger]: Constructing interpolant automaton starting with 82 interpolants. [2019-05-23 09:26:14,375 INFO L146 ILogger]: CoverageRelationStatistics Valid=3242, Invalid=3400, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 09:26:14,375 INFO L146 ILogger]: Start difference. First operand 239 states and 239 transitions. Second operand 82 states. [2019-05-23 09:26:18,851 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:18,851 INFO L146 ILogger]: Finished difference Result 243 states and 243 transitions. [2019-05-23 09:26:18,851 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-05-23 09:26:18,851 INFO L146 ILogger]: Start accepts. Automaton has 82 states. Word has length 238 [2019-05-23 09:26:18,852 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:18,853 INFO L146 ILogger]: With dead ends: 243 [2019-05-23 09:26:18,853 INFO L146 ILogger]: Without dead ends: 243 [2019-05-23 09:26:18,854 INFO L146 ILogger]: 0 DeclaredPredicates, 316 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9720, Invalid=16040, Unknown=0, NotChecked=0, Total=25760 [2019-05-23 09:26:18,855 INFO L146 ILogger]: Start minimizeSevpa. Operand 243 states. [2019-05-23 09:26:18,857 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 243 to 242. [2019-05-23 09:26:18,857 INFO L146 ILogger]: Start removeUnreachable. Operand 242 states. [2019-05-23 09:26:18,858 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2019-05-23 09:26:18,858 INFO L146 ILogger]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 238 [2019-05-23 09:26:18,858 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:18,858 INFO L146 ILogger]: Abstraction has 242 states and 242 transitions. [2019-05-23 09:26:18,858 INFO L146 ILogger]: Interpolant automaton has 82 states. [2019-05-23 09:26:18,858 INFO L146 ILogger]: Start isEmpty. Operand 242 states and 242 transitions. [2019-05-23 09:26:18,859 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 242 [2019-05-23 09:26:18,860 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:18,860 INFO L146 ILogger]: trace histogram [80, 79, 79, 1, 1, 1] [2019-05-23 09:26:18,860 INFO L146 ILogger]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:18,860 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:18,860 INFO L146 ILogger]: Analyzing trace with hash 2086537386, now seen corresponding path program 79 times [2019-05-23 09:26:18,861 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:18,947 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:18,975 INFO L146 ILogger]: Trace formula consists of 488 conjuncts, 243 conjunts are in the unsatisfiable core [2019-05-23 09:26:18,977 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:18,983 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:26:18,983 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:18,992 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:18,992 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:18,993 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:26:22,456 INFO L146 ILogger]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:22,457 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:22,457 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-05-23 09:26:22,457 INFO L146 ILogger]: Interpolant automaton has 83 states [2019-05-23 09:26:22,457 INFO L146 ILogger]: Constructing interpolant automaton starting with 83 interpolants. [2019-05-23 09:26:22,458 INFO L146 ILogger]: CoverageRelationStatistics Valid=3323, Invalid=3483, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:26:22,458 INFO L146 ILogger]: Start difference. First operand 242 states and 242 transitions. Second operand 83 states. [2019-05-23 09:26:27,053 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:27,053 INFO L146 ILogger]: Finished difference Result 246 states and 246 transitions. [2019-05-23 09:26:27,053 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-05-23 09:26:27,054 INFO L146 ILogger]: Start accepts. Automaton has 83 states. Word has length 241 [2019-05-23 09:26:27,054 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:27,055 INFO L146 ILogger]: With dead ends: 246 [2019-05-23 09:26:27,055 INFO L146 ILogger]: Without dead ends: 246 [2019-05-23 09:26:27,057 INFO L146 ILogger]: 0 DeclaredPredicates, 320 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=9963, Invalid=16443, Unknown=0, NotChecked=0, Total=26406 [2019-05-23 09:26:27,057 INFO L146 ILogger]: Start minimizeSevpa. Operand 246 states. [2019-05-23 09:26:27,059 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-05-23 09:26:27,059 INFO L146 ILogger]: Start removeUnreachable. Operand 245 states. [2019-05-23 09:26:27,059 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-05-23 09:26:27,059 INFO L146 ILogger]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 241 [2019-05-23 09:26:27,059 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:27,059 INFO L146 ILogger]: Abstraction has 245 states and 245 transitions. [2019-05-23 09:26:27,059 INFO L146 ILogger]: Interpolant automaton has 83 states. [2019-05-23 09:26:27,060 INFO L146 ILogger]: Start isEmpty. Operand 245 states and 245 transitions. [2019-05-23 09:26:27,060 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 245 [2019-05-23 09:26:27,060 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:27,060 INFO L146 ILogger]: trace histogram [81, 80, 80, 1, 1, 1] [2019-05-23 09:26:27,061 INFO L146 ILogger]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:27,061 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:27,061 INFO L146 ILogger]: Analyzing trace with hash -1026366173, now seen corresponding path program 80 times [2019-05-23 09:26:27,061 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:27,140 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:27,164 INFO L146 ILogger]: Trace formula consists of 494 conjuncts, 246 conjunts are in the unsatisfiable core [2019-05-23 09:26:27,166 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:27,170 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:26:27,170 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:27,178 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:27,178 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:27,178 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:26:30,277 INFO L146 ILogger]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:30,277 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:30,277 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-05-23 09:26:30,277 INFO L146 ILogger]: Interpolant automaton has 84 states [2019-05-23 09:26:30,278 INFO L146 ILogger]: Constructing interpolant automaton starting with 84 interpolants. [2019-05-23 09:26:30,278 INFO L146 ILogger]: CoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 09:26:30,278 INFO L146 ILogger]: Start difference. First operand 245 states and 245 transitions. Second operand 84 states. [2019-05-23 09:26:34,968 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:34,968 INFO L146 ILogger]: Finished difference Result 249 states and 249 transitions. [2019-05-23 09:26:34,969 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-23 09:26:34,969 INFO L146 ILogger]: Start accepts. Automaton has 84 states. Word has length 244 [2019-05-23 09:26:34,969 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:34,970 INFO L146 ILogger]: With dead ends: 249 [2019-05-23 09:26:34,970 INFO L146 ILogger]: Without dead ends: 249 [2019-05-23 09:26:34,972 INFO L146 ILogger]: 0 DeclaredPredicates, 324 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10209, Invalid=16851, Unknown=0, NotChecked=0, Total=27060 [2019-05-23 09:26:34,972 INFO L146 ILogger]: Start minimizeSevpa. Operand 249 states. [2019-05-23 09:26:34,974 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 249 to 248. [2019-05-23 09:26:34,974 INFO L146 ILogger]: Start removeUnreachable. Operand 248 states. [2019-05-23 09:26:34,975 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2019-05-23 09:26:34,975 INFO L146 ILogger]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 244 [2019-05-23 09:26:34,975 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:34,975 INFO L146 ILogger]: Abstraction has 248 states and 248 transitions. [2019-05-23 09:26:34,975 INFO L146 ILogger]: Interpolant automaton has 84 states. [2019-05-23 09:26:34,975 INFO L146 ILogger]: Start isEmpty. Operand 248 states and 248 transitions. [2019-05-23 09:26:34,977 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 248 [2019-05-23 09:26:34,977 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:34,977 INFO L146 ILogger]: trace histogram [82, 81, 81, 1, 1, 1] [2019-05-23 09:26:34,977 INFO L146 ILogger]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:34,977 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:34,977 INFO L146 ILogger]: Analyzing trace with hash -602437110, now seen corresponding path program 81 times [2019-05-23 09:26:34,978 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:35,093 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:35,114 INFO L146 ILogger]: Trace formula consists of 500 conjuncts, 249 conjunts are in the unsatisfiable core [2019-05-23 09:26:35,116 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:35,121 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:26:35,122 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:35,129 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:35,129 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:35,129 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:26:38,612 INFO L146 ILogger]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:38,612 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:38,613 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-05-23 09:26:38,613 INFO L146 ILogger]: Interpolant automaton has 85 states [2019-05-23 09:26:38,613 INFO L146 ILogger]: Constructing interpolant automaton starting with 85 interpolants. [2019-05-23 09:26:38,614 INFO L146 ILogger]: CoverageRelationStatistics Valid=3488, Invalid=3652, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:26:38,614 INFO L146 ILogger]: Start difference. First operand 248 states and 248 transitions. Second operand 85 states. [2019-05-23 09:26:43,388 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:43,389 INFO L146 ILogger]: Finished difference Result 252 states and 252 transitions. [2019-05-23 09:26:43,389 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-05-23 09:26:43,389 INFO L146 ILogger]: Start accepts. Automaton has 85 states. Word has length 247 [2019-05-23 09:26:43,390 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:43,391 INFO L146 ILogger]: With dead ends: 252 [2019-05-23 09:26:43,391 INFO L146 ILogger]: Without dead ends: 252 [2019-05-23 09:26:43,393 INFO L146 ILogger]: 0 DeclaredPredicates, 328 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10458, Invalid=17264, Unknown=0, NotChecked=0, Total=27722 [2019-05-23 09:26:43,393 INFO L146 ILogger]: Start minimizeSevpa. Operand 252 states. [2019-05-23 09:26:43,394 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 252 to 251. [2019-05-23 09:26:43,394 INFO L146 ILogger]: Start removeUnreachable. Operand 251 states. [2019-05-23 09:26:43,394 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-05-23 09:26:43,395 INFO L146 ILogger]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 247 [2019-05-23 09:26:43,395 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:43,395 INFO L146 ILogger]: Abstraction has 251 states and 251 transitions. [2019-05-23 09:26:43,395 INFO L146 ILogger]: Interpolant automaton has 85 states. [2019-05-23 09:26:43,395 INFO L146 ILogger]: Start isEmpty. Operand 251 states and 251 transitions. [2019-05-23 09:26:43,396 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 251 [2019-05-23 09:26:43,396 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:43,396 INFO L146 ILogger]: trace histogram [83, 82, 82, 1, 1, 1] [2019-05-23 09:26:43,396 INFO L146 ILogger]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:43,396 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:43,396 INFO L146 ILogger]: Analyzing trace with hash 1464428483, now seen corresponding path program 82 times [2019-05-23 09:26:43,397 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:43,499 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:43,539 INFO L146 ILogger]: Trace formula consists of 506 conjuncts, 252 conjunts are in the unsatisfiable core [2019-05-23 09:26:43,542 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:43,588 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:26:43,589 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:43,658 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:43,659 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:43,659 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:26:47,132 INFO L146 ILogger]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:47,133 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:47,133 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-05-23 09:26:47,133 INFO L146 ILogger]: Interpolant automaton has 86 states [2019-05-23 09:26:47,134 INFO L146 ILogger]: Constructing interpolant automaton starting with 86 interpolants. [2019-05-23 09:26:47,134 INFO L146 ILogger]: CoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 09:26:47,134 INFO L146 ILogger]: Start difference. First operand 251 states and 251 transitions. Second operand 86 states. [2019-05-23 09:26:51,960 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:51,960 INFO L146 ILogger]: Finished difference Result 255 states and 255 transitions. [2019-05-23 09:26:51,961 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-05-23 09:26:51,961 INFO L146 ILogger]: Start accepts. Automaton has 86 states. Word has length 250 [2019-05-23 09:26:51,961 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:51,962 INFO L146 ILogger]: With dead ends: 255 [2019-05-23 09:26:51,962 INFO L146 ILogger]: Without dead ends: 255 [2019-05-23 09:26:51,964 INFO L146 ILogger]: 0 DeclaredPredicates, 332 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10710, Invalid=17682, Unknown=0, NotChecked=0, Total=28392 [2019-05-23 09:26:51,965 INFO L146 ILogger]: Start minimizeSevpa. Operand 255 states. [2019-05-23 09:26:51,966 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-05-23 09:26:51,966 INFO L146 ILogger]: Start removeUnreachable. Operand 254 states. [2019-05-23 09:26:51,967 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2019-05-23 09:26:51,967 INFO L146 ILogger]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 250 [2019-05-23 09:26:51,967 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:51,967 INFO L146 ILogger]: Abstraction has 254 states and 254 transitions. [2019-05-23 09:26:51,967 INFO L146 ILogger]: Interpolant automaton has 86 states. [2019-05-23 09:26:51,968 INFO L146 ILogger]: Start isEmpty. Operand 254 states and 254 transitions. [2019-05-23 09:26:51,969 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 254 [2019-05-23 09:26:51,969 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:51,969 INFO L146 ILogger]: trace histogram [84, 83, 83, 1, 1, 1] [2019-05-23 09:26:51,969 INFO L146 ILogger]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:51,969 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:51,970 INFO L146 ILogger]: Analyzing trace with hash -1488813206, now seen corresponding path program 83 times [2019-05-23 09:26:51,970 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:52,067 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:52,092 INFO L146 ILogger]: Trace formula consists of 512 conjuncts, 255 conjunts are in the unsatisfiable core [2019-05-23 09:26:52,094 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:52,104 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:26:52,104 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:52,113 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:52,113 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:52,113 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:26:55,717 INFO L146 ILogger]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:55,717 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:55,717 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-05-23 09:26:55,717 INFO L146 ILogger]: Interpolant automaton has 87 states [2019-05-23 09:26:55,718 INFO L146 ILogger]: Constructing interpolant automaton starting with 87 interpolants. [2019-05-23 09:26:55,718 INFO L146 ILogger]: CoverageRelationStatistics Valid=3657, Invalid=3825, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:26:55,718 INFO L146 ILogger]: Start difference. First operand 254 states and 254 transitions. Second operand 87 states. [2019-05-23 09:27:00,700 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:00,700 INFO L146 ILogger]: Finished difference Result 258 states and 258 transitions. [2019-05-23 09:27:00,700 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-05-23 09:27:00,701 INFO L146 ILogger]: Start accepts. Automaton has 87 states. Word has length 253 [2019-05-23 09:27:00,701 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:00,702 INFO L146 ILogger]: With dead ends: 258 [2019-05-23 09:27:00,702 INFO L146 ILogger]: Without dead ends: 258 [2019-05-23 09:27:00,705 INFO L146 ILogger]: 0 DeclaredPredicates, 336 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10965, Invalid=18105, Unknown=0, NotChecked=0, Total=29070 [2019-05-23 09:27:00,705 INFO L146 ILogger]: Start minimizeSevpa. Operand 258 states. [2019-05-23 09:27:00,707 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-05-23 09:27:00,707 INFO L146 ILogger]: Start removeUnreachable. Operand 257 states. [2019-05-23 09:27:00,707 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-05-23 09:27:00,708 INFO L146 ILogger]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 253 [2019-05-23 09:27:00,708 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:00,708 INFO L146 ILogger]: Abstraction has 257 states and 257 transitions. [2019-05-23 09:27:00,708 INFO L146 ILogger]: Interpolant automaton has 87 states. [2019-05-23 09:27:00,708 INFO L146 ILogger]: Start isEmpty. Operand 257 states and 257 transitions. [2019-05-23 09:27:00,709 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 257 [2019-05-23 09:27:00,709 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:00,710 INFO L146 ILogger]: trace histogram [85, 84, 84, 1, 1, 1] [2019-05-23 09:27:00,710 INFO L146 ILogger]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:00,710 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:00,710 INFO L146 ILogger]: Analyzing trace with hash 893088355, now seen corresponding path program 84 times [2019-05-23 09:27:00,711 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:00,801 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:00,852 INFO L146 ILogger]: Trace formula consists of 518 conjuncts, 258 conjunts are in the unsatisfiable core [2019-05-23 09:27:00,854 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:00,859 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:27:00,859 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:00,868 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:00,868 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:00,868 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:27:04,433 INFO L146 ILogger]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:04,433 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:04,434 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-05-23 09:27:04,434 INFO L146 ILogger]: Interpolant automaton has 88 states [2019-05-23 09:27:04,435 INFO L146 ILogger]: Constructing interpolant automaton starting with 88 interpolants. [2019-05-23 09:27:04,435 INFO L146 ILogger]: CoverageRelationStatistics Valid=3743, Invalid=3913, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 09:27:04,436 INFO L146 ILogger]: Start difference. First operand 257 states and 257 transitions. Second operand 88 states. [2019-05-23 09:27:09,487 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:09,487 INFO L146 ILogger]: Finished difference Result 261 states and 261 transitions. [2019-05-23 09:27:09,488 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-05-23 09:27:09,488 INFO L146 ILogger]: Start accepts. Automaton has 88 states. Word has length 256 [2019-05-23 09:27:09,488 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:09,490 INFO L146 ILogger]: With dead ends: 261 [2019-05-23 09:27:09,490 INFO L146 ILogger]: Without dead ends: 261 [2019-05-23 09:27:09,491 INFO L146 ILogger]: 0 DeclaredPredicates, 340 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11223, Invalid=18533, Unknown=0, NotChecked=0, Total=29756 [2019-05-23 09:27:09,491 INFO L146 ILogger]: Start minimizeSevpa. Operand 261 states. [2019-05-23 09:27:09,493 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 261 to 260. [2019-05-23 09:27:09,494 INFO L146 ILogger]: Start removeUnreachable. Operand 260 states. [2019-05-23 09:27:09,494 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2019-05-23 09:27:09,494 INFO L146 ILogger]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 256 [2019-05-23 09:27:09,494 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:09,495 INFO L146 ILogger]: Abstraction has 260 states and 260 transitions. [2019-05-23 09:27:09,495 INFO L146 ILogger]: Interpolant automaton has 88 states. [2019-05-23 09:27:09,495 INFO L146 ILogger]: Start isEmpty. Operand 260 states and 260 transitions. [2019-05-23 09:27:09,496 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 260 [2019-05-23 09:27:09,496 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:09,496 INFO L146 ILogger]: trace histogram [86, 85, 85, 1, 1, 1] [2019-05-23 09:27:09,496 INFO L146 ILogger]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:09,496 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:09,497 INFO L146 ILogger]: Analyzing trace with hash -1327172406, now seen corresponding path program 85 times [2019-05-23 09:27:09,497 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:09,583 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:09,610 INFO L146 ILogger]: Trace formula consists of 524 conjuncts, 261 conjunts are in the unsatisfiable core [2019-05-23 09:27:09,613 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:09,626 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:27:09,626 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:09,637 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:09,637 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:09,637 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:27:13,265 INFO L146 ILogger]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:13,265 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:13,266 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-05-23 09:27:13,266 INFO L146 ILogger]: Interpolant automaton has 89 states [2019-05-23 09:27:13,267 INFO L146 ILogger]: Constructing interpolant automaton starting with 89 interpolants. [2019-05-23 09:27:13,267 INFO L146 ILogger]: CoverageRelationStatistics Valid=3830, Invalid=4002, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:27:13,268 INFO L146 ILogger]: Start difference. First operand 260 states and 260 transitions. Second operand 89 states. [2019-05-23 09:27:18,580 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:18,580 INFO L146 ILogger]: Finished difference Result 264 states and 264 transitions. [2019-05-23 09:27:18,581 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-05-23 09:27:18,581 INFO L146 ILogger]: Start accepts. Automaton has 89 states. Word has length 259 [2019-05-23 09:27:18,581 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:18,583 INFO L146 ILogger]: With dead ends: 264 [2019-05-23 09:27:18,583 INFO L146 ILogger]: Without dead ends: 264 [2019-05-23 09:27:18,585 INFO L146 ILogger]: 0 DeclaredPredicates, 344 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11484, Invalid=18966, Unknown=0, NotChecked=0, Total=30450 [2019-05-23 09:27:18,585 INFO L146 ILogger]: Start minimizeSevpa. Operand 264 states. [2019-05-23 09:27:18,586 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 264 to 263. [2019-05-23 09:27:18,587 INFO L146 ILogger]: Start removeUnreachable. Operand 263 states. [2019-05-23 09:27:18,587 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2019-05-23 09:27:18,588 INFO L146 ILogger]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 259 [2019-05-23 09:27:18,588 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:18,588 INFO L146 ILogger]: Abstraction has 263 states and 263 transitions. [2019-05-23 09:27:18,588 INFO L146 ILogger]: Interpolant automaton has 89 states. [2019-05-23 09:27:18,588 INFO L146 ILogger]: Start isEmpty. Operand 263 states and 263 transitions. [2019-05-23 09:27:18,589 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 263 [2019-05-23 09:27:18,589 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:18,589 INFO L146 ILogger]: trace histogram [87, 86, 86, 1, 1, 1] [2019-05-23 09:27:18,590 INFO L146 ILogger]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:18,590 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:18,590 INFO L146 ILogger]: Analyzing trace with hash 1675822339, now seen corresponding path program 86 times [2019-05-23 09:27:18,590 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:18,690 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:18,721 INFO L146 ILogger]: Trace formula consists of 530 conjuncts, 264 conjunts are in the unsatisfiable core [2019-05-23 09:27:18,723 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:18,727 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:27:18,727 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:18,735 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:18,735 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:18,735 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:27:22,305 INFO L146 ILogger]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:22,305 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:22,305 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-05-23 09:27:22,306 INFO L146 ILogger]: Interpolant automaton has 90 states [2019-05-23 09:27:22,307 INFO L146 ILogger]: Constructing interpolant automaton starting with 90 interpolants. [2019-05-23 09:27:22,307 INFO L146 ILogger]: CoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 09:27:22,307 INFO L146 ILogger]: Start difference. First operand 263 states and 263 transitions. Second operand 90 states. [2019-05-23 09:27:27,645 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:27,646 INFO L146 ILogger]: Finished difference Result 267 states and 267 transitions. [2019-05-23 09:27:27,646 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-23 09:27:27,646 INFO L146 ILogger]: Start accepts. Automaton has 90 states. Word has length 262 [2019-05-23 09:27:27,647 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:27,648 INFO L146 ILogger]: With dead ends: 267 [2019-05-23 09:27:27,648 INFO L146 ILogger]: Without dead ends: 267 [2019-05-23 09:27:27,650 INFO L146 ILogger]: 0 DeclaredPredicates, 348 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11748, Invalid=19404, Unknown=0, NotChecked=0, Total=31152 [2019-05-23 09:27:27,651 INFO L146 ILogger]: Start minimizeSevpa. Operand 267 states. [2019-05-23 09:27:27,652 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 267 to 266. [2019-05-23 09:27:27,653 INFO L146 ILogger]: Start removeUnreachable. Operand 266 states. [2019-05-23 09:27:27,653 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-05-23 09:27:27,653 INFO L146 ILogger]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 262 [2019-05-23 09:27:27,653 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:27,653 INFO L146 ILogger]: Abstraction has 266 states and 266 transitions. [2019-05-23 09:27:27,653 INFO L146 ILogger]: Interpolant automaton has 90 states. [2019-05-23 09:27:27,653 INFO L146 ILogger]: Start isEmpty. Operand 266 states and 266 transitions. [2019-05-23 09:27:27,654 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 266 [2019-05-23 09:27:27,655 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:27,655 INFO L146 ILogger]: trace histogram [88, 87, 87, 1, 1, 1] [2019-05-23 09:27:27,655 INFO L146 ILogger]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:27,655 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:27,655 INFO L146 ILogger]: Analyzing trace with hash -276505046, now seen corresponding path program 87 times [2019-05-23 09:27:27,656 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:27,805 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:27,851 INFO L146 ILogger]: Trace formula consists of 536 conjuncts, 267 conjunts are in the unsatisfiable core [2019-05-23 09:27:27,856 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:27,891 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:27:27,891 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:27,911 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:27,911 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:27,911 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:27:31,684 INFO L146 ILogger]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:31,685 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:31,685 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-05-23 09:27:31,685 INFO L146 ILogger]: Interpolant automaton has 91 states [2019-05-23 09:27:31,686 INFO L146 ILogger]: Constructing interpolant automaton starting with 91 interpolants. [2019-05-23 09:27:31,686 INFO L146 ILogger]: CoverageRelationStatistics Valid=4007, Invalid=4183, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:27:31,686 INFO L146 ILogger]: Start difference. First operand 266 states and 266 transitions. Second operand 91 states. [2019-05-23 09:27:37,121 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:37,121 INFO L146 ILogger]: Finished difference Result 270 states and 270 transitions. [2019-05-23 09:27:37,121 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-05-23 09:27:37,121 INFO L146 ILogger]: Start accepts. Automaton has 91 states. Word has length 265 [2019-05-23 09:27:37,122 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:37,123 INFO L146 ILogger]: With dead ends: 270 [2019-05-23 09:27:37,123 INFO L146 ILogger]: Without dead ends: 270 [2019-05-23 09:27:37,125 INFO L146 ILogger]: 0 DeclaredPredicates, 352 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12015, Invalid=19847, Unknown=0, NotChecked=0, Total=31862 [2019-05-23 09:27:37,125 INFO L146 ILogger]: Start minimizeSevpa. Operand 270 states. [2019-05-23 09:27:37,127 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-05-23 09:27:37,127 INFO L146 ILogger]: Start removeUnreachable. Operand 269 states. [2019-05-23 09:27:37,127 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-05-23 09:27:37,127 INFO L146 ILogger]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 265 [2019-05-23 09:27:37,128 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:37,128 INFO L146 ILogger]: Abstraction has 269 states and 269 transitions. [2019-05-23 09:27:37,128 INFO L146 ILogger]: Interpolant automaton has 91 states. [2019-05-23 09:27:37,128 INFO L146 ILogger]: Start isEmpty. Operand 269 states and 269 transitions. [2019-05-23 09:27:37,129 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 269 [2019-05-23 09:27:37,129 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:37,129 INFO L146 ILogger]: trace histogram [89, 88, 88, 1, 1, 1] [2019-05-23 09:27:37,129 INFO L146 ILogger]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:37,129 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:37,129 INFO L146 ILogger]: Analyzing trace with hash 385490851, now seen corresponding path program 88 times [2019-05-23 09:27:37,130 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:37,223 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:37,252 INFO L146 ILogger]: Trace formula consists of 542 conjuncts, 270 conjunts are in the unsatisfiable core [2019-05-23 09:27:37,254 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:37,261 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:27:37,261 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:37,269 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:37,269 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:37,269 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:27:41,350 INFO L146 ILogger]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:41,351 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:41,351 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-05-23 09:27:41,351 INFO L146 ILogger]: Interpolant automaton has 92 states [2019-05-23 09:27:41,352 INFO L146 ILogger]: Constructing interpolant automaton starting with 92 interpolants. [2019-05-23 09:27:41,352 INFO L146 ILogger]: CoverageRelationStatistics Valid=4097, Invalid=4275, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 09:27:41,352 INFO L146 ILogger]: Start difference. First operand 269 states and 269 transitions. Second operand 92 states. [2019-05-23 09:27:46,834 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:46,834 INFO L146 ILogger]: Finished difference Result 273 states and 273 transitions. [2019-05-23 09:27:46,835 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-05-23 09:27:46,835 INFO L146 ILogger]: Start accepts. Automaton has 92 states. Word has length 268 [2019-05-23 09:27:46,835 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:46,837 INFO L146 ILogger]: With dead ends: 273 [2019-05-23 09:27:46,837 INFO L146 ILogger]: Without dead ends: 273 [2019-05-23 09:27:46,839 INFO L146 ILogger]: 0 DeclaredPredicates, 356 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12285, Invalid=20295, Unknown=0, NotChecked=0, Total=32580 [2019-05-23 09:27:46,839 INFO L146 ILogger]: Start minimizeSevpa. Operand 273 states. [2019-05-23 09:27:46,841 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 273 to 272. [2019-05-23 09:27:46,841 INFO L146 ILogger]: Start removeUnreachable. Operand 272 states. [2019-05-23 09:27:46,842 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2019-05-23 09:27:46,842 INFO L146 ILogger]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 268 [2019-05-23 09:27:46,842 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:46,842 INFO L146 ILogger]: Abstraction has 272 states and 272 transitions. [2019-05-23 09:27:46,842 INFO L146 ILogger]: Interpolant automaton has 92 states. [2019-05-23 09:27:46,843 INFO L146 ILogger]: Start isEmpty. Operand 272 states and 272 transitions. [2019-05-23 09:27:46,844 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 272 [2019-05-23 09:27:46,844 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:46,844 INFO L146 ILogger]: trace histogram [90, 89, 89, 1, 1, 1] [2019-05-23 09:27:46,844 INFO L146 ILogger]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:46,844 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:46,845 INFO L146 ILogger]: Analyzing trace with hash -584564854, now seen corresponding path program 89 times [2019-05-23 09:27:46,845 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:46,945 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:46,977 INFO L146 ILogger]: Trace formula consists of 548 conjuncts, 273 conjunts are in the unsatisfiable core [2019-05-23 09:27:46,979 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:46,987 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:27:46,987 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:46,996 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:46,996 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:46,996 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:27:50,977 INFO L146 ILogger]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:50,977 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:50,977 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-05-23 09:27:50,977 INFO L146 ILogger]: Interpolant automaton has 93 states [2019-05-23 09:27:50,978 INFO L146 ILogger]: Constructing interpolant automaton starting with 93 interpolants. [2019-05-23 09:27:50,978 INFO L146 ILogger]: CoverageRelationStatistics Valid=4188, Invalid=4368, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:27:50,978 INFO L146 ILogger]: Start difference. First operand 272 states and 272 transitions. Second operand 93 states. [2019-05-23 09:27:56,538 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:56,538 INFO L146 ILogger]: Finished difference Result 276 states and 276 transitions. [2019-05-23 09:27:56,538 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-05-23 09:27:56,539 INFO L146 ILogger]: Start accepts. Automaton has 93 states. Word has length 271 [2019-05-23 09:27:56,539 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:56,540 INFO L146 ILogger]: With dead ends: 276 [2019-05-23 09:27:56,540 INFO L146 ILogger]: Without dead ends: 276 [2019-05-23 09:27:56,541 INFO L146 ILogger]: 0 DeclaredPredicates, 360 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12558, Invalid=20748, Unknown=0, NotChecked=0, Total=33306 [2019-05-23 09:27:56,542 INFO L146 ILogger]: Start minimizeSevpa. Operand 276 states. [2019-05-23 09:27:56,544 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 276 to 275. [2019-05-23 09:27:56,544 INFO L146 ILogger]: Start removeUnreachable. Operand 275 states. [2019-05-23 09:27:56,544 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2019-05-23 09:27:56,545 INFO L146 ILogger]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 271 [2019-05-23 09:27:56,545 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:56,545 INFO L146 ILogger]: Abstraction has 275 states and 275 transitions. [2019-05-23 09:27:56,545 INFO L146 ILogger]: Interpolant automaton has 93 states. [2019-05-23 09:27:56,545 INFO L146 ILogger]: Start isEmpty. Operand 275 states and 275 transitions. [2019-05-23 09:27:56,546 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 275 [2019-05-23 09:27:56,546 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:56,546 INFO L146 ILogger]: trace histogram [91, 90, 90, 1, 1, 1] [2019-05-23 09:27:56,546 INFO L146 ILogger]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:56,546 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:56,546 INFO L146 ILogger]: Analyzing trace with hash 1320862275, now seen corresponding path program 90 times [2019-05-23 09:27:56,547 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:56,642 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:56,672 INFO L146 ILogger]: Trace formula consists of 554 conjuncts, 276 conjunts are in the unsatisfiable core [2019-05-23 09:27:56,674 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:56,684 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:27:56,684 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:56,698 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:56,698 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:56,699 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:28:00,771 INFO L146 ILogger]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:00,771 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:00,771 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-05-23 09:28:00,771 INFO L146 ILogger]: Interpolant automaton has 94 states [2019-05-23 09:28:00,772 INFO L146 ILogger]: Constructing interpolant automaton starting with 94 interpolants. [2019-05-23 09:28:00,772 INFO L146 ILogger]: CoverageRelationStatistics Valid=4280, Invalid=4462, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 09:28:00,773 INFO L146 ILogger]: Start difference. First operand 275 states and 275 transitions. Second operand 94 states. [2019-05-23 09:28:06,505 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:06,505 INFO L146 ILogger]: Finished difference Result 279 states and 279 transitions. [2019-05-23 09:28:06,506 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-05-23 09:28:06,506 INFO L146 ILogger]: Start accepts. Automaton has 94 states. Word has length 274 [2019-05-23 09:28:06,506 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:06,507 INFO L146 ILogger]: With dead ends: 279 [2019-05-23 09:28:06,507 INFO L146 ILogger]: Without dead ends: 279 [2019-05-23 09:28:06,509 INFO L146 ILogger]: 0 DeclaredPredicates, 364 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12834, Invalid=21206, Unknown=0, NotChecked=0, Total=34040 [2019-05-23 09:28:06,510 INFO L146 ILogger]: Start minimizeSevpa. Operand 279 states. [2019-05-23 09:28:06,511 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 279 to 278. [2019-05-23 09:28:06,511 INFO L146 ILogger]: Start removeUnreachable. Operand 278 states. [2019-05-23 09:28:06,512 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2019-05-23 09:28:06,512 INFO L146 ILogger]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 274 [2019-05-23 09:28:06,512 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:06,512 INFO L146 ILogger]: Abstraction has 278 states and 278 transitions. [2019-05-23 09:28:06,512 INFO L146 ILogger]: Interpolant automaton has 94 states. [2019-05-23 09:28:06,512 INFO L146 ILogger]: Start isEmpty. Operand 278 states and 278 transitions. [2019-05-23 09:28:06,513 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 278 [2019-05-23 09:28:06,513 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:06,513 INFO L146 ILogger]: trace histogram [92, 91, 91, 1, 1, 1] [2019-05-23 09:28:06,514 INFO L146 ILogger]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:06,514 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:06,514 INFO L146 ILogger]: Analyzing trace with hash -682288918, now seen corresponding path program 91 times [2019-05-23 09:28:06,515 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:06,630 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:06,676 INFO L146 ILogger]: Trace formula consists of 560 conjuncts, 279 conjunts are in the unsatisfiable core [2019-05-23 09:28:06,679 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:06,683 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:28:06,683 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:06,693 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:06,693 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:06,693 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:28:10,930 INFO L146 ILogger]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:10,930 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:10,930 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-05-23 09:28:10,930 INFO L146 ILogger]: Interpolant automaton has 95 states [2019-05-23 09:28:10,931 INFO L146 ILogger]: Constructing interpolant automaton starting with 95 interpolants. [2019-05-23 09:28:10,931 INFO L146 ILogger]: CoverageRelationStatistics Valid=4373, Invalid=4557, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:28:10,931 INFO L146 ILogger]: Start difference. First operand 278 states and 278 transitions. Second operand 95 states. [2019-05-23 09:28:16,928 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:16,929 INFO L146 ILogger]: Finished difference Result 282 states and 282 transitions. [2019-05-23 09:28:16,929 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-05-23 09:28:16,929 INFO L146 ILogger]: Start accepts. Automaton has 95 states. Word has length 277 [2019-05-23 09:28:16,929 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:16,931 INFO L146 ILogger]: With dead ends: 282 [2019-05-23 09:28:16,931 INFO L146 ILogger]: Without dead ends: 282 [2019-05-23 09:28:16,933 INFO L146 ILogger]: 0 DeclaredPredicates, 368 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13113, Invalid=21669, Unknown=0, NotChecked=0, Total=34782 [2019-05-23 09:28:16,934 INFO L146 ILogger]: Start minimizeSevpa. Operand 282 states. [2019-05-23 09:28:16,935 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-05-23 09:28:16,935 INFO L146 ILogger]: Start removeUnreachable. Operand 281 states. [2019-05-23 09:28:16,936 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-05-23 09:28:16,936 INFO L146 ILogger]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 277 [2019-05-23 09:28:16,936 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:16,936 INFO L146 ILogger]: Abstraction has 281 states and 281 transitions. [2019-05-23 09:28:16,936 INFO L146 ILogger]: Interpolant automaton has 95 states. [2019-05-23 09:28:16,936 INFO L146 ILogger]: Start isEmpty. Operand 281 states and 281 transitions. [2019-05-23 09:28:16,937 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 281 [2019-05-23 09:28:16,937 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:16,937 INFO L146 ILogger]: trace histogram [93, 92, 92, 1, 1, 1] [2019-05-23 09:28:16,937 INFO L146 ILogger]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:16,938 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:16,938 INFO L146 ILogger]: Analyzing trace with hash 2011098339, now seen corresponding path program 92 times [2019-05-23 09:28:16,938 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:17,037 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:17,070 INFO L146 ILogger]: Trace formula consists of 566 conjuncts, 282 conjunts are in the unsatisfiable core [2019-05-23 09:28:17,073 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:17,076 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:28:17,077 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:17,085 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:17,085 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:17,086 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:28:21,305 INFO L146 ILogger]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:21,306 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:21,306 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-05-23 09:28:21,306 INFO L146 ILogger]: Interpolant automaton has 96 states [2019-05-23 09:28:21,307 INFO L146 ILogger]: Constructing interpolant automaton starting with 96 interpolants. [2019-05-23 09:28:21,307 INFO L146 ILogger]: CoverageRelationStatistics Valid=4467, Invalid=4653, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 09:28:21,307 INFO L146 ILogger]: Start difference. First operand 281 states and 281 transitions. Second operand 96 states. [2019-05-23 09:28:27,281 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:27,282 INFO L146 ILogger]: Finished difference Result 285 states and 285 transitions. [2019-05-23 09:28:27,282 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-05-23 09:28:27,282 INFO L146 ILogger]: Start accepts. Automaton has 96 states. Word has length 280 [2019-05-23 09:28:27,282 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:27,284 INFO L146 ILogger]: With dead ends: 285 [2019-05-23 09:28:27,284 INFO L146 ILogger]: Without dead ends: 285 [2019-05-23 09:28:27,285 INFO L146 ILogger]: 0 DeclaredPredicates, 372 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13395, Invalid=22137, Unknown=0, NotChecked=0, Total=35532 [2019-05-23 09:28:27,286 INFO L146 ILogger]: Start minimizeSevpa. Operand 285 states. [2019-05-23 09:28:27,287 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 285 to 284. [2019-05-23 09:28:27,287 INFO L146 ILogger]: Start removeUnreachable. Operand 284 states. [2019-05-23 09:28:27,288 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 284 states to 284 states and 284 transitions. [2019-05-23 09:28:27,288 INFO L146 ILogger]: Start accepts. Automaton has 284 states and 284 transitions. Word has length 280 [2019-05-23 09:28:27,288 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:27,288 INFO L146 ILogger]: Abstraction has 284 states and 284 transitions. [2019-05-23 09:28:27,288 INFO L146 ILogger]: Interpolant automaton has 96 states. [2019-05-23 09:28:27,288 INFO L146 ILogger]: Start isEmpty. Operand 284 states and 284 transitions. [2019-05-23 09:28:27,289 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 284 [2019-05-23 09:28:27,289 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:27,289 INFO L146 ILogger]: trace histogram [94, 93, 93, 1, 1, 1] [2019-05-23 09:28:27,289 INFO L146 ILogger]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:27,290 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:27,290 INFO L146 ILogger]: Analyzing trace with hash 2131847754, now seen corresponding path program 93 times [2019-05-23 09:28:27,290 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:27,387 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:27,421 INFO L146 ILogger]: Trace formula consists of 572 conjuncts, 285 conjunts are in the unsatisfiable core [2019-05-23 09:28:27,424 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:27,429 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:28:27,429 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:27,438 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:27,438 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:27,439 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:28:31,856 INFO L146 ILogger]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:31,856 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:31,856 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-05-23 09:28:31,856 INFO L146 ILogger]: Interpolant automaton has 97 states [2019-05-23 09:28:31,857 INFO L146 ILogger]: Constructing interpolant automaton starting with 97 interpolants. [2019-05-23 09:28:31,858 INFO L146 ILogger]: CoverageRelationStatistics Valid=4562, Invalid=4750, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:28:31,858 INFO L146 ILogger]: Start difference. First operand 284 states and 284 transitions. Second operand 97 states. [2019-05-23 09:28:37,900 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:37,900 INFO L146 ILogger]: Finished difference Result 288 states and 288 transitions. [2019-05-23 09:28:37,900 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-05-23 09:28:37,900 INFO L146 ILogger]: Start accepts. Automaton has 97 states. Word has length 283 [2019-05-23 09:28:37,901 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:37,902 INFO L146 ILogger]: With dead ends: 288 [2019-05-23 09:28:37,902 INFO L146 ILogger]: Without dead ends: 288 [2019-05-23 09:28:37,904 INFO L146 ILogger]: 0 DeclaredPredicates, 376 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13680, Invalid=22610, Unknown=0, NotChecked=0, Total=36290 [2019-05-23 09:28:37,905 INFO L146 ILogger]: Start minimizeSevpa. Operand 288 states. [2019-05-23 09:28:37,907 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 288 to 287. [2019-05-23 09:28:37,907 INFO L146 ILogger]: Start removeUnreachable. Operand 287 states. [2019-05-23 09:28:37,907 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2019-05-23 09:28:37,907 INFO L146 ILogger]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 283 [2019-05-23 09:28:37,908 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:37,908 INFO L146 ILogger]: Abstraction has 287 states and 287 transitions. [2019-05-23 09:28:37,908 INFO L146 ILogger]: Interpolant automaton has 97 states. [2019-05-23 09:28:37,908 INFO L146 ILogger]: Start isEmpty. Operand 287 states and 287 transitions. [2019-05-23 09:28:37,909 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 287 [2019-05-23 09:28:37,909 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:37,909 INFO L146 ILogger]: trace histogram [95, 94, 94, 1, 1, 1] [2019-05-23 09:28:37,909 INFO L146 ILogger]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:37,909 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:37,909 INFO L146 ILogger]: Analyzing trace with hash 195075971, now seen corresponding path program 94 times [2019-05-23 09:28:37,910 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:38,014 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:38,049 INFO L146 ILogger]: Trace formula consists of 578 conjuncts, 288 conjunts are in the unsatisfiable core [2019-05-23 09:28:38,051 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:38,055 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:28:38,055 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:38,067 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:38,067 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:38,067 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:28:42,305 INFO L146 ILogger]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:42,305 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:42,305 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-05-23 09:28:42,305 INFO L146 ILogger]: Interpolant automaton has 98 states [2019-05-23 09:28:42,306 INFO L146 ILogger]: Constructing interpolant automaton starting with 98 interpolants. [2019-05-23 09:28:42,306 INFO L146 ILogger]: CoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 09:28:42,306 INFO L146 ILogger]: Start difference. First operand 287 states and 287 transitions. Second operand 98 states. [2019-05-23 09:28:48,603 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:48,603 INFO L146 ILogger]: Finished difference Result 291 states and 291 transitions. [2019-05-23 09:28:48,603 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-05-23 09:28:48,603 INFO L146 ILogger]: Start accepts. Automaton has 98 states. Word has length 286 [2019-05-23 09:28:48,604 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:48,605 INFO L146 ILogger]: With dead ends: 291 [2019-05-23 09:28:48,605 INFO L146 ILogger]: Without dead ends: 291 [2019-05-23 09:28:48,608 INFO L146 ILogger]: 0 DeclaredPredicates, 380 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4465 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13968, Invalid=23088, Unknown=0, NotChecked=0, Total=37056 [2019-05-23 09:28:48,608 INFO L146 ILogger]: Start minimizeSevpa. Operand 291 states. [2019-05-23 09:28:48,610 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 291 to 290. [2019-05-23 09:28:48,610 INFO L146 ILogger]: Start removeUnreachable. Operand 290 states. [2019-05-23 09:28:48,610 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2019-05-23 09:28:48,611 INFO L146 ILogger]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 286 [2019-05-23 09:28:48,611 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:48,611 INFO L146 ILogger]: Abstraction has 290 states and 290 transitions. [2019-05-23 09:28:48,611 INFO L146 ILogger]: Interpolant automaton has 98 states. [2019-05-23 09:28:48,611 INFO L146 ILogger]: Start isEmpty. Operand 290 states and 290 transitions. [2019-05-23 09:28:48,612 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 290 [2019-05-23 09:28:48,612 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:48,612 INFO L146 ILogger]: trace histogram [96, 95, 95, 1, 1, 1] [2019-05-23 09:28:48,612 INFO L146 ILogger]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:48,612 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:48,612 INFO L146 ILogger]: Analyzing trace with hash 417543082, now seen corresponding path program 95 times [2019-05-23 09:28:48,613 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:48,726 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:48,761 INFO L146 ILogger]: Trace formula consists of 584 conjuncts, 291 conjunts are in the unsatisfiable core [2019-05-23 09:28:48,764 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:48,773 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:28:48,773 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:48,787 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:48,787 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:48,787 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:28:53,171 INFO L146 ILogger]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:53,171 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:53,171 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-05-23 09:28:53,172 INFO L146 ILogger]: Interpolant automaton has 99 states [2019-05-23 09:28:53,172 INFO L146 ILogger]: Constructing interpolant automaton starting with 99 interpolants. [2019-05-23 09:28:53,173 INFO L146 ILogger]: CoverageRelationStatistics Valid=4755, Invalid=4947, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:28:53,173 INFO L146 ILogger]: Start difference. First operand 290 states and 290 transitions. Second operand 99 states. [2019-05-23 09:28:59,430 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:59,430 INFO L146 ILogger]: Finished difference Result 294 states and 294 transitions. [2019-05-23 09:28:59,431 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-05-23 09:28:59,431 INFO L146 ILogger]: Start accepts. Automaton has 99 states. Word has length 289 [2019-05-23 09:28:59,431 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:59,433 INFO L146 ILogger]: With dead ends: 294 [2019-05-23 09:28:59,433 INFO L146 ILogger]: Without dead ends: 294 [2019-05-23 09:28:59,435 INFO L146 ILogger]: 0 DeclaredPredicates, 384 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4560 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14259, Invalid=23571, Unknown=0, NotChecked=0, Total=37830 [2019-05-23 09:28:59,435 INFO L146 ILogger]: Start minimizeSevpa. Operand 294 states. [2019-05-23 09:28:59,437 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-05-23 09:28:59,437 INFO L146 ILogger]: Start removeUnreachable. Operand 293 states. [2019-05-23 09:28:59,437 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-05-23 09:28:59,437 INFO L146 ILogger]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 289 [2019-05-23 09:28:59,437 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:59,437 INFO L146 ILogger]: Abstraction has 293 states and 293 transitions. [2019-05-23 09:28:59,438 INFO L146 ILogger]: Interpolant automaton has 99 states. [2019-05-23 09:28:59,438 INFO L146 ILogger]: Start isEmpty. Operand 293 states and 293 transitions. [2019-05-23 09:28:59,438 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 293 [2019-05-23 09:28:59,439 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:59,439 INFO L146 ILogger]: trace histogram [97, 96, 96, 1, 1, 1] [2019-05-23 09:28:59,439 INFO L146 ILogger]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:59,439 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:59,439 INFO L146 ILogger]: Analyzing trace with hash 800709155, now seen corresponding path program 96 times [2019-05-23 09:28:59,440 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:59,570 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:59,634 INFO L146 ILogger]: Trace formula consists of 590 conjuncts, 294 conjunts are in the unsatisfiable core [2019-05-23 09:28:59,640 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:59,681 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:28:59,682 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:59,749 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:59,750 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:59,750 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:29:04,451 INFO L146 ILogger]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:04,452 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:04,452 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-05-23 09:29:04,452 INFO L146 ILogger]: Interpolant automaton has 100 states [2019-05-23 09:29:04,453 INFO L146 ILogger]: Constructing interpolant automaton starting with 100 interpolants. [2019-05-23 09:29:04,453 INFO L146 ILogger]: CoverageRelationStatistics Valid=4853, Invalid=5047, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 09:29:04,453 INFO L146 ILogger]: Start difference. First operand 293 states and 293 transitions. Second operand 100 states. [2019-05-23 09:29:10,953 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:10,953 INFO L146 ILogger]: Finished difference Result 297 states and 297 transitions. [2019-05-23 09:29:10,953 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-05-23 09:29:10,954 INFO L146 ILogger]: Start accepts. Automaton has 100 states. Word has length 292 [2019-05-23 09:29:10,954 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:10,955 INFO L146 ILogger]: With dead ends: 297 [2019-05-23 09:29:10,955 INFO L146 ILogger]: Without dead ends: 297 [2019-05-23 09:29:10,958 INFO L146 ILogger]: 0 DeclaredPredicates, 388 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4656 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14553, Invalid=24059, Unknown=0, NotChecked=0, Total=38612 [2019-05-23 09:29:10,958 INFO L146 ILogger]: Start minimizeSevpa. Operand 297 states. [2019-05-23 09:29:10,960 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 297 to 296. [2019-05-23 09:29:10,960 INFO L146 ILogger]: Start removeUnreachable. Operand 296 states. [2019-05-23 09:29:10,960 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2019-05-23 09:29:10,961 INFO L146 ILogger]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 292 [2019-05-23 09:29:10,961 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:10,961 INFO L146 ILogger]: Abstraction has 296 states and 296 transitions. [2019-05-23 09:29:10,961 INFO L146 ILogger]: Interpolant automaton has 100 states. [2019-05-23 09:29:10,961 INFO L146 ILogger]: Start isEmpty. Operand 296 states and 296 transitions. [2019-05-23 09:29:10,962 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 296 [2019-05-23 09:29:10,962 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:10,962 INFO L146 ILogger]: trace histogram [98, 97, 97, 1, 1, 1] [2019-05-23 09:29:10,962 INFO L146 ILogger]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:10,962 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:10,962 INFO L146 ILogger]: Analyzing trace with hash -321882870, now seen corresponding path program 97 times [2019-05-23 09:29:10,963 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:11,076 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:11,120 INFO L146 ILogger]: Trace formula consists of 596 conjuncts, 297 conjunts are in the unsatisfiable core [2019-05-23 09:29:11,122 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:11,126 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:29:11,126 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:29:11,138 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:11,138 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:11,139 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:29:15,702 INFO L146 ILogger]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:15,702 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:15,702 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-05-23 09:29:15,703 INFO L146 ILogger]: Interpolant automaton has 101 states [2019-05-23 09:29:15,703 INFO L146 ILogger]: Constructing interpolant automaton starting with 101 interpolants. [2019-05-23 09:29:15,704 INFO L146 ILogger]: CoverageRelationStatistics Valid=4952, Invalid=5148, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:29:15,704 INFO L146 ILogger]: Start difference. First operand 296 states and 296 transitions. Second operand 101 states. [2019-05-23 09:29:22,282 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:22,282 INFO L146 ILogger]: Finished difference Result 300 states and 300 transitions. [2019-05-23 09:29:22,282 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-05-23 09:29:22,282 INFO L146 ILogger]: Start accepts. Automaton has 101 states. Word has length 295 [2019-05-23 09:29:22,283 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:22,284 INFO L146 ILogger]: With dead ends: 300 [2019-05-23 09:29:22,284 INFO L146 ILogger]: Without dead ends: 300 [2019-05-23 09:29:22,286 INFO L146 ILogger]: 0 DeclaredPredicates, 392 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4753 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14850, Invalid=24552, Unknown=0, NotChecked=0, Total=39402 [2019-05-23 09:29:22,286 INFO L146 ILogger]: Start minimizeSevpa. Operand 300 states. [2019-05-23 09:29:22,288 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 300 to 299. [2019-05-23 09:29:22,288 INFO L146 ILogger]: Start removeUnreachable. Operand 299 states. [2019-05-23 09:29:22,288 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2019-05-23 09:29:22,289 INFO L146 ILogger]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 295 [2019-05-23 09:29:22,289 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:22,289 INFO L146 ILogger]: Abstraction has 299 states and 299 transitions. [2019-05-23 09:29:22,289 INFO L146 ILogger]: Interpolant automaton has 101 states. [2019-05-23 09:29:22,289 INFO L146 ILogger]: Start isEmpty. Operand 299 states and 299 transitions. [2019-05-23 09:29:22,290 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 299 [2019-05-23 09:29:22,290 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:22,290 INFO L146 ILogger]: trace histogram [99, 98, 98, 1, 1, 1] [2019-05-23 09:29:22,290 INFO L146 ILogger]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:22,290 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:22,291 INFO L146 ILogger]: Analyzing trace with hash 1449434307, now seen corresponding path program 98 times [2019-05-23 09:29:22,291 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:22,409 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:22,448 INFO L146 ILogger]: Trace formula consists of 602 conjuncts, 300 conjunts are in the unsatisfiable core [2019-05-23 09:29:22,451 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:22,458 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:29:22,458 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:29:22,467 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:22,467 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:22,467 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:29:27,323 INFO L146 ILogger]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:27,324 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:27,324 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-05-23 09:29:27,324 INFO L146 ILogger]: Interpolant automaton has 102 states [2019-05-23 09:29:27,325 INFO L146 ILogger]: Constructing interpolant automaton starting with 102 interpolants. [2019-05-23 09:29:27,325 INFO L146 ILogger]: CoverageRelationStatistics Valid=5052, Invalid=5250, Unknown=0, NotChecked=0, Total=10302 [2019-05-23 09:29:27,325 INFO L146 ILogger]: Start difference. First operand 299 states and 299 transitions. Second operand 102 states. [2019-05-23 09:29:34,099 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:34,099 INFO L146 ILogger]: Finished difference Result 303 states and 303 transitions. [2019-05-23 09:29:34,099 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-05-23 09:29:34,099 INFO L146 ILogger]: Start accepts. Automaton has 102 states. Word has length 298 [2019-05-23 09:29:34,100 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:34,101 INFO L146 ILogger]: With dead ends: 303 [2019-05-23 09:29:34,101 INFO L146 ILogger]: Without dead ends: 303 [2019-05-23 09:29:34,103 INFO L146 ILogger]: 0 DeclaredPredicates, 396 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4851 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15150, Invalid=25050, Unknown=0, NotChecked=0, Total=40200 [2019-05-23 09:29:34,104 INFO L146 ILogger]: Start minimizeSevpa. Operand 303 states. [2019-05-23 09:29:34,105 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 303 to 302. [2019-05-23 09:29:34,105 INFO L146 ILogger]: Start removeUnreachable. Operand 302 states. [2019-05-23 09:29:34,106 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2019-05-23 09:29:34,106 INFO L146 ILogger]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 298 [2019-05-23 09:29:34,106 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:34,106 INFO L146 ILogger]: Abstraction has 302 states and 302 transitions. [2019-05-23 09:29:34,106 INFO L146 ILogger]: Interpolant automaton has 102 states. [2019-05-23 09:29:34,106 INFO L146 ILogger]: Start isEmpty. Operand 302 states and 302 transitions. [2019-05-23 09:29:34,107 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 302 [2019-05-23 09:29:34,107 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:34,107 INFO L146 ILogger]: trace histogram [100, 99, 99, 1, 1, 1] [2019-05-23 09:29:34,108 INFO L146 ILogger]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:34,108 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:34,108 INFO L146 ILogger]: Analyzing trace with hash -1503711638, now seen corresponding path program 99 times [2019-05-23 09:29:34,108 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:34,223 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:34,262 INFO L146 ILogger]: Trace formula consists of 608 conjuncts, 303 conjunts are in the unsatisfiable core [2019-05-23 09:29:34,265 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:34,271 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:29:34,272 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:29:34,284 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:34,284 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:34,284 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:29:39,202 INFO L146 ILogger]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:39,202 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:39,202 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-05-23 09:29:39,203 INFO L146 ILogger]: Interpolant automaton has 103 states [2019-05-23 09:29:39,203 INFO L146 ILogger]: Constructing interpolant automaton starting with 103 interpolants. [2019-05-23 09:29:39,204 INFO L146 ILogger]: CoverageRelationStatistics Valid=5153, Invalid=5353, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:29:39,204 INFO L146 ILogger]: Start difference. First operand 302 states and 302 transitions. Second operand 103 states. [2019-05-23 09:29:45,773 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:45,773 INFO L146 ILogger]: Finished difference Result 306 states and 306 transitions. [2019-05-23 09:29:45,773 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-05-23 09:29:45,774 INFO L146 ILogger]: Start accepts. Automaton has 103 states. Word has length 301 [2019-05-23 09:29:45,774 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:45,776 INFO L146 ILogger]: With dead ends: 306 [2019-05-23 09:29:45,776 INFO L146 ILogger]: Without dead ends: 306 [2019-05-23 09:29:45,779 INFO L146 ILogger]: 0 DeclaredPredicates, 400 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15453, Invalid=25553, Unknown=0, NotChecked=0, Total=41006 [2019-05-23 09:29:45,779 INFO L146 ILogger]: Start minimizeSevpa. Operand 306 states. [2019-05-23 09:29:45,781 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-05-23 09:29:45,781 INFO L146 ILogger]: Start removeUnreachable. Operand 305 states. [2019-05-23 09:29:45,781 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-05-23 09:29:45,781 INFO L146 ILogger]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 301 [2019-05-23 09:29:45,781 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:45,781 INFO L146 ILogger]: Abstraction has 305 states and 305 transitions. [2019-05-23 09:29:45,782 INFO L146 ILogger]: Interpolant automaton has 103 states. [2019-05-23 09:29:45,782 INFO L146 ILogger]: Start isEmpty. Operand 305 states and 305 transitions. [2019-05-23 09:29:45,783 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 305 [2019-05-23 09:29:45,783 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:45,783 INFO L146 ILogger]: trace histogram [101, 100, 100, 1, 1, 1] [2019-05-23 09:29:45,783 INFO L146 ILogger]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:45,783 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:45,784 INFO L146 ILogger]: Analyzing trace with hash -564467869, now seen corresponding path program 100 times [2019-05-23 09:29:45,784 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:45,880 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:45,889 INFO L146 ILogger]: Trace formula consists of 614 conjuncts, 102 conjunts are in the unsatisfiable core [2019-05-23 09:29:45,892 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:50,597 INFO L146 ILogger]: Checked inductivity of 15050 backedges. 15050 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:50,597 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:29:50,597 INFO L146 ILogger]: Number of different interpolants: perfect sequences [103] imperfect sequences [] total 103 [2019-05-23 09:29:50,598 INFO L146 ILogger]: Interpolant automaton has 103 states [2019-05-23 09:29:50,598 INFO L146 ILogger]: Constructing interpolant automaton starting with 103 interpolants. [2019-05-23 09:29:50,599 INFO L146 ILogger]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:29:50,599 INFO L146 ILogger]: Start difference. First operand 305 states and 305 transitions. Second operand 103 states. [2019-05-23 09:29:51,429 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:51,430 INFO L146 ILogger]: Finished difference Result 303 states and 302 transitions. [2019-05-23 09:29:51,430 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-05-23 09:29:51,430 INFO L146 ILogger]: Start accepts. Automaton has 103 states. Word has length 304 [2019-05-23 09:29:51,431 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:51,431 INFO L146 ILogger]: With dead ends: 303 [2019-05-23 09:29:51,431 INFO L146 ILogger]: Without dead ends: 0 [2019-05-23 09:29:51,432 INFO L146 ILogger]: 0 DeclaredPredicates, 303 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:29:51,432 INFO L146 ILogger]: Start minimizeSevpa. Operand 0 states. [2019-05-23 09:29:51,432 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-23 09:29:51,432 INFO L146 ILogger]: Start removeUnreachable. Operand 0 states. [2019-05-23 09:29:51,432 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-23 09:29:51,433 INFO L146 ILogger]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 304 [2019-05-23 09:29:51,433 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:51,433 INFO L146 ILogger]: Abstraction has 0 states and 0 transitions. [2019-05-23 09:29:51,433 INFO L146 ILogger]: Interpolant automaton has 103 states. [2019-05-23 09:29:51,433 INFO L146 ILogger]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-23 09:29:51,433 INFO L146 ILogger]: Finished isEmpty. No accepting run. [2019-05-23 09:29:51,438 INFO L146 ILogger]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.05 09:29:51 BoogieIcfgContainer [2019-05-23 09:29:51,438 INFO L146 ILogger]: ------------------------ END TraceAbstraction---------------------------- [2019-05-23 09:29:51,439 INFO L146 ILogger]: Toolchain (without parser) took 465808.76 ms. Allocated memory was 132.6 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 110.0 MB in the beginning and 1.0 GB in the end (delta: -925.9 MB). Peak memory consumption was 989.8 MB. Max. memory is 7.1 GB. [2019-05-23 09:29:51,439 INFO L146 ILogger]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory was 111.5 MB in the beginning and 111.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-05-23 09:29:51,440 INFO L146 ILogger]: Boogie Procedure Inliner took 46.77 ms. Allocated memory is still 132.6 MB. Free memory was 110.0 MB in the beginning and 108.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-05-23 09:29:51,440 INFO L146 ILogger]: Boogie Preprocessor took 28.85 ms. Allocated memory is still 132.6 MB. Free memory was 108.0 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-05-23 09:29:51,441 INFO L146 ILogger]: RCFGBuilder took 300.86 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 96.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-05-23 09:29:51,441 INFO L146 ILogger]: TraceAbstraction took 465428.15 ms. Allocated memory was 132.6 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 96.7 MB in the beginning and 1.0 GB in the end (delta: -939.2 MB). Peak memory consumption was 976.5 MB. Max. memory is 7.1 GB. [2019-05-23 09:29:51,443 INFO L146 ILogger]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory was 111.5 MB in the beginning and 111.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.77 ms. Allocated memory is still 132.6 MB. Free memory was 110.0 MB in the beginning and 108.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.85 ms. Allocated memory is still 132.6 MB. Free memory was 108.0 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 300.86 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 96.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 465428.15 ms. Allocated memory was 132.6 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 96.7 MB in the beginning and 1.0 GB in the end (delta: -939.2 MB). Peak memory consumption was 976.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 465.3s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 258.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 103 SDtfs, 15656 SDslu, 1 SDs, 0 SdLazy, 17894 SolverSat, 5338 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20503 GetRequests, 10202 SyntacticMatches, 0 SemanticMatches, 10301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166650 ImplicationChecksByTransitivity, 411.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 200.4s InterpolantComputationTime, 15554 NumberOfCodeBlocks, 15554 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 15453 ConstructedInterpolants, 0 QuantifiedInterpolants, 27861153 SizeOfPredicates, 202 NumberOfNonLiveVariables, 31714 ConjunctsInSsa, 15552 ConjunctsInUnsatCore, 101 InterpolantComputations, 2 PerfectInterpolantSequences, 15050/510050 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...