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/CountTillBound-Jupiter.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-7aa59a0 [2019-05-23 09:22:03,888 INFO L146 ILogger]: Resetting all preferences to default values... [2019-05-23 09:22:03,891 INFO L146 ILogger]: Resetting UltimateCore preferences to default values [2019-05-23 09:22:03,910 INFO L146 ILogger]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-23 09:22:03,910 INFO L146 ILogger]: Resetting Boogie Preprocessor preferences to default values [2019-05-23 09:22:03,912 INFO L146 ILogger]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-23 09:22:03,914 INFO L146 ILogger]: Resetting Abstract Interpretation preferences to default values [2019-05-23 09:22:03,918 INFO L146 ILogger]: Resetting LassoRanker preferences to default values [2019-05-23 09:22:03,921 INFO L146 ILogger]: Resetting Reaching Definitions preferences to default values [2019-05-23 09:22:03,922 INFO L146 ILogger]: Resetting SyntaxChecker preferences to default values [2019-05-23 09:22:03,929 INFO L146 ILogger]: Büchi Program Product provides no preferences, ignoring... [2019-05-23 09:22:03,929 INFO L146 ILogger]: Resetting LTL2Aut preferences to default values [2019-05-23 09:22:03,930 INFO L146 ILogger]: Resetting PEA to Boogie preferences to default values [2019-05-23 09:22:03,935 INFO L146 ILogger]: Resetting BlockEncodingV2 preferences to default values [2019-05-23 09:22:03,939 INFO L146 ILogger]: Resetting ChcToBoogie preferences to default values [2019-05-23 09:22:03,940 INFO L146 ILogger]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-23 09:22:03,941 INFO L146 ILogger]: Resetting BuchiAutomizer preferences to default values [2019-05-23 09:22:03,943 INFO L146 ILogger]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-23 09:22:03,945 INFO L146 ILogger]: Resetting CodeCheck preferences to default values [2019-05-23 09:22:03,947 INFO L146 ILogger]: Resetting InvariantSynthesis preferences to default values [2019-05-23 09:22:03,948 INFO L146 ILogger]: Resetting RCFGBuilder preferences to default values [2019-05-23 09:22:03,949 INFO L146 ILogger]: Resetting TraceAbstraction preferences to default values [2019-05-23 09:22:03,951 INFO L146 ILogger]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-23 09:22:03,951 INFO L146 ILogger]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-23 09:22:03,952 INFO L146 ILogger]: Resetting TreeAutomizer preferences to default values [2019-05-23 09:22:03,953 INFO L146 ILogger]: Resetting IcfgToChc preferences to default values [2019-05-23 09:22:03,953 INFO L146 ILogger]: Resetting IcfgTransformer preferences to default values [2019-05-23 09:22:03,956 INFO L146 ILogger]: ReqToTest provides no preferences, ignoring... [2019-05-23 09:22:03,957 INFO L146 ILogger]: Resetting Boogie Printer preferences to default values [2019-05-23 09:22:03,958 INFO L146 ILogger]: Resetting ChcSmtPrinter preferences to default values [2019-05-23 09:22:03,960 INFO L146 ILogger]: Resetting ReqPrinter preferences to default values [2019-05-23 09:22:03,963 INFO L146 ILogger]: Resetting Witness Printer preferences to default values [2019-05-23 09:22:03,964 INFO L146 ILogger]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-23 09:22:03,964 INFO L146 ILogger]: Resetting CDTParser preferences to default values [2019-05-23 09:22:03,965 INFO L146 ILogger]: AutomataScriptParser provides no preferences, ignoring... [2019-05-23 09:22:03,965 INFO L146 ILogger]: ReqParser provides no preferences, ignoring... [2019-05-23 09:22:03,965 INFO L146 ILogger]: Resetting SmtParser preferences to default values [2019-05-23 09:22:03,966 INFO L146 ILogger]: Resetting Witness Parser preferences to default values [2019-05-23 09:22:03,969 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:04,013 INFO L146 ILogger]: Repository-Root is: /tmp [2019-05-23 09:22:04,029 INFO L146 ILogger]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-23 09:22:04,034 INFO L146 ILogger]: [Toolchain 1]: Toolchain selected. [2019-05-23 09:22:04,035 INFO L146 ILogger]: Initializing Boogie PL CUP Parser... [2019-05-23 09:22:04,036 INFO L146 ILogger]: Boogie PL CUP Parser initialized [2019-05-23 09:22:04,037 INFO L146 ILogger]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/CountTillBound-Jupiter.bpl [2019-05-23 09:22:04,037 INFO L146 ILogger]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/CountTillBound-Jupiter.bpl' [2019-05-23 09:22:04,066 INFO L146 ILogger]: ####################### [Toolchain 1] ####################### [2019-05-23 09:22:04,068 INFO L146 ILogger]: Walking toolchain with 4 elements. [2019-05-23 09:22:04,068 INFO L146 ILogger]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-23 09:22:04,069 INFO L146 ILogger]: Initializing Boogie Procedure Inliner... [2019-05-23 09:22:04,069 INFO L146 ILogger]: Boogie Procedure Inliner initialized [2019-05-23 09:22:04,086 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:04" (1/1) ... [2019-05-23 09:22:04,096 INFO L146 ILogger]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:04" (1/1) ... [2019-05-23 09:22:04,102 WARN L146 ILogger]: Program contained no entry procedure! [2019-05-23 09:22:04,103 WARN L146 ILogger]: Missing entry procedures: [ULTIMATE.start] [2019-05-23 09:22:04,103 WARN L146 ILogger]: Fallback enabled. All procedures will be processed. [2019-05-23 09:22:04,106 INFO L146 ILogger]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-23 09:22:04,107 INFO L146 ILogger]: ------------------------Boogie Preprocessor---------------------------- [2019-05-23 09:22:04,107 INFO L146 ILogger]: Initializing Boogie Preprocessor... [2019-05-23 09:22:04,108 INFO L146 ILogger]: Boogie Preprocessor initialized [2019-05-23 09:22:04,119 INFO L146 ILogger]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:04" (1/1) ... [2019-05-23 09:22:04,119 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:04" (1/1) ... [2019-05-23 09:22:04,120 INFO L146 ILogger]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:04" (1/1) ... [2019-05-23 09:22:04,120 INFO L146 ILogger]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:04" (1/1) ... [2019-05-23 09:22:04,123 INFO L146 ILogger]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:04" (1/1) ... [2019-05-23 09:22:04,127 INFO L146 ILogger]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:04" (1/1) ... [2019-05-23 09:22:04,128 INFO L146 ILogger]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:04" (1/1) ... [2019-05-23 09:22:04,129 INFO L146 ILogger]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-23 09:22:04,129 INFO L146 ILogger]: ------------------------RCFGBuilder---------------------------- [2019-05-23 09:22:04,129 INFO L146 ILogger]: Initializing RCFGBuilder... [2019-05-23 09:22:04,130 INFO L146 ILogger]: RCFGBuilder initialized [2019-05-23 09:22:04,130 INFO L146 ILogger]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:04" (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:04,200 INFO L146 ILogger]: Specification and implementation of procedure main given in one single declaration [2019-05-23 09:22:04,201 INFO L146 ILogger]: Found specification of procedure main [2019-05-23 09:22:04,201 INFO L146 ILogger]: Found implementation of procedure main [2019-05-23 09:22:04,449 INFO L146 ILogger]: Using library mode [2019-05-23 09:22:04,450 INFO L146 ILogger]: Removed 0 assume(true) statements. [2019-05-23 09:22:04,451 INFO L146 ILogger]: Adding new model CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:22:04 BoogieIcfgContainer [2019-05-23 09:22:04,451 INFO L146 ILogger]: ------------------------ END RCFGBuilder---------------------------- [2019-05-23 09:22:04,452 INFO L146 ILogger]: ------------------------TraceAbstraction---------------------------- [2019-05-23 09:22:04,452 INFO L146 ILogger]: Initializing TraceAbstraction... [2019-05-23 09:22:04,456 INFO L146 ILogger]: TraceAbstraction initialized [2019-05-23 09:22:04,456 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:04" (1/2) ... [2019-05-23 09:22:04,458 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e039299 and model type CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.05 09:22:04, skipping insertion in model container [2019-05-23 09:22:04,458 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:22:04" (2/2) ... [2019-05-23 09:22:04,460 INFO L146 ILogger]: Analyzing ICFG CountTillBound-Jupiter.bpl [2019-05-23 09:22:04,470 INFO L146 ILogger]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-23 09:22:04,478 INFO L146 ILogger]: Appying trace abstraction to program that has 1 error locations. [2019-05-23 09:22:04,498 INFO L146 ILogger]: Starting to check reachability of 1 error locations. [2019-05-23 09:22:04,531 INFO L146 ILogger]: Using default assertion order modulation [2019-05-23 09:22:04,532 INFO L146 ILogger]: Interprodecural is true [2019-05-23 09:22:04,532 INFO L146 ILogger]: Hoare is false [2019-05-23 09:22:04,532 INFO L146 ILogger]: Compute interpolants for ForwardPredicates [2019-05-23 09:22:04,532 INFO L146 ILogger]: Backedges is STRAIGHT_LINE [2019-05-23 09:22:04,533 INFO L146 ILogger]: Determinization is PREDICATE_ABSTRACTION [2019-05-23 09:22:04,533 INFO L146 ILogger]: Difference is false [2019-05-23 09:22:04,533 INFO L146 ILogger]: Minimize is MINIMIZE_SEVPA [2019-05-23 09:22:04,533 INFO L146 ILogger]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-23 09:22:04,553 INFO L146 ILogger]: Start isEmpty. Operand 10 states. [2019-05-23 09:22:04,572 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 5 [2019-05-23 09:22:04,572 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:04,573 INFO L146 ILogger]: trace histogram [1, 1, 1, 1] [2019-05-23 09:22:04,576 INFO L146 ILogger]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:04,582 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:04,583 INFO L146 ILogger]: Analyzing trace with hash 924963, now seen corresponding path program 1 times [2019-05-23 09:22:04,644 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:04,679 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:04,682 INFO L146 ILogger]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-05-23 09:22:04,687 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:04,792 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:04,800 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:22:04,800 INFO L146 ILogger]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-23 09:22:04,805 INFO L146 ILogger]: Interpolant automaton has 3 states [2019-05-23 09:22:04,817 INFO L146 ILogger]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-23 09:22:04,818 INFO L146 ILogger]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 09:22:04,820 INFO L146 ILogger]: Start difference. First operand 10 states. Second operand 3 states. [2019-05-23 09:22:04,897 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:04,897 INFO L146 ILogger]: Finished difference Result 12 states and 13 transitions. [2019-05-23 09:22:04,903 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-23 09:22:04,905 INFO L146 ILogger]: Start accepts. Automaton has 3 states. Word has length 4 [2019-05-23 09:22:04,906 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:04,940 INFO L146 ILogger]: With dead ends: 12 [2019-05-23 09:22:04,941 INFO L146 ILogger]: Without dead ends: 10 [2019-05-23 09:22:04,947 INFO L146 ILogger]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 09:22:04,998 INFO L146 ILogger]: Start minimizeSevpa. Operand 10 states. [2019-05-23 09:22:05,028 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-05-23 09:22:05,033 INFO L146 ILogger]: Start removeUnreachable. Operand 9 states. [2019-05-23 09:22:05,034 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-05-23 09:22:05,038 INFO L146 ILogger]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 4 [2019-05-23 09:22:05,038 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:05,038 INFO L146 ILogger]: Abstraction has 9 states and 10 transitions. [2019-05-23 09:22:05,039 INFO L146 ILogger]: Interpolant automaton has 3 states. [2019-05-23 09:22:05,039 INFO L146 ILogger]: Start isEmpty. Operand 9 states and 10 transitions. [2019-05-23 09:22:05,039 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 8 [2019-05-23 09:22:05,043 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:05,043 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:05,044 INFO L146 ILogger]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:05,044 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:05,044 INFO L146 ILogger]: Analyzing trace with hash 1776248811, now seen corresponding path program 1 times [2019-05-23 09:22:05,046 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:05,058 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:05,059 INFO L146 ILogger]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-23 09:22:05,060 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:05,122 INFO L146 ILogger]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:05,123 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:05,123 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-05-23 09:22:05,125 INFO L146 ILogger]: Interpolant automaton has 4 states [2019-05-23 09:22:05,125 INFO L146 ILogger]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-23 09:22:05,126 INFO L146 ILogger]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-23 09:22:05,126 INFO L146 ILogger]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2019-05-23 09:22:05,279 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:05,279 INFO L146 ILogger]: Finished difference Result 14 states and 16 transitions. [2019-05-23 09:22:05,280 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-23 09:22:05,280 INFO L146 ILogger]: Start accepts. Automaton has 4 states. Word has length 7 [2019-05-23 09:22:05,281 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:05,282 INFO L146 ILogger]: With dead ends: 14 [2019-05-23 09:22:05,282 INFO L146 ILogger]: Without dead ends: 14 [2019-05-23 09:22:05,283 INFO L146 ILogger]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-23 09:22:05,283 INFO L146 ILogger]: Start minimizeSevpa. Operand 14 states. [2019-05-23 09:22:05,286 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-05-23 09:22:05,286 INFO L146 ILogger]: Start removeUnreachable. Operand 13 states. [2019-05-23 09:22:05,287 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-05-23 09:22:05,287 INFO L146 ILogger]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2019-05-23 09:22:05,288 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:05,288 INFO L146 ILogger]: Abstraction has 13 states and 15 transitions. [2019-05-23 09:22:05,288 INFO L146 ILogger]: Interpolant automaton has 4 states. [2019-05-23 09:22:05,288 INFO L146 ILogger]: Start isEmpty. Operand 13 states and 15 transitions. [2019-05-23 09:22:05,289 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 11 [2019-05-23 09:22:05,289 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:05,290 INFO L146 ILogger]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-05-23 09:22:05,290 INFO L146 ILogger]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:05,290 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:05,291 INFO L146 ILogger]: Analyzing trace with hash -2073245661, now seen corresponding path program 2 times [2019-05-23 09:22:05,292 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:05,302 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:05,303 INFO L146 ILogger]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-23 09:22:05,304 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:05,502 INFO L146 ILogger]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:05,502 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:05,503 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-05-23 09:22:05,503 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 09:22:05,504 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 09:22:05,504 INFO L146 ILogger]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:22:05,504 INFO L146 ILogger]: Start difference. First operand 13 states and 15 transitions. Second operand 5 states. [2019-05-23 09:22:05,574 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:05,574 INFO L146 ILogger]: Finished difference Result 18 states and 21 transitions. [2019-05-23 09:22:05,575 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-23 09:22:05,575 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 10 [2019-05-23 09:22:05,575 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:05,576 INFO L146 ILogger]: With dead ends: 18 [2019-05-23 09:22:05,576 INFO L146 ILogger]: Without dead ends: 18 [2019-05-23 09:22:05,577 INFO L146 ILogger]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:22:05,577 INFO L146 ILogger]: Start minimizeSevpa. Operand 18 states. [2019-05-23 09:22:05,580 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-05-23 09:22:05,580 INFO L146 ILogger]: Start removeUnreachable. Operand 17 states. [2019-05-23 09:22:05,581 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-05-23 09:22:05,581 INFO L146 ILogger]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2019-05-23 09:22:05,581 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:05,581 INFO L146 ILogger]: Abstraction has 17 states and 20 transitions. [2019-05-23 09:22:05,581 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 09:22:05,582 INFO L146 ILogger]: Start isEmpty. Operand 17 states and 20 transitions. [2019-05-23 09:22:05,582 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 14 [2019-05-23 09:22:05,582 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:05,582 INFO L146 ILogger]: trace histogram [3, 3, 3, 1, 1, 1, 1] [2019-05-23 09:22:05,583 INFO L146 ILogger]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:05,583 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:05,583 INFO L146 ILogger]: Analyzing trace with hash 1853676779, now seen corresponding path program 3 times [2019-05-23 09:22:05,584 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:05,593 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:05,595 INFO L146 ILogger]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2019-05-23 09:22:05,596 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:05,715 INFO L146 ILogger]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:05,716 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:05,717 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-23 09:22:05,717 INFO L146 ILogger]: Interpolant automaton has 6 states [2019-05-23 09:22:05,717 INFO L146 ILogger]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-23 09:22:05,718 INFO L146 ILogger]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-05-23 09:22:05,718 INFO L146 ILogger]: Start difference. First operand 17 states and 20 transitions. Second operand 6 states. [2019-05-23 09:22:05,849 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:05,849 INFO L146 ILogger]: Finished difference Result 22 states and 26 transitions. [2019-05-23 09:22:05,850 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 09:22:05,850 INFO L146 ILogger]: Start accepts. Automaton has 6 states. Word has length 13 [2019-05-23 09:22:05,851 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:05,851 INFO L146 ILogger]: With dead ends: 22 [2019-05-23 09:22:05,851 INFO L146 ILogger]: Without dead ends: 22 [2019-05-23 09:22:05,853 INFO L146 ILogger]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-05-23 09:22:05,853 INFO L146 ILogger]: Start minimizeSevpa. Operand 22 states. [2019-05-23 09:22:05,858 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-05-23 09:22:05,858 INFO L146 ILogger]: Start removeUnreachable. Operand 21 states. [2019-05-23 09:22:05,859 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-05-23 09:22:05,859 INFO L146 ILogger]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2019-05-23 09:22:05,859 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:05,860 INFO L146 ILogger]: Abstraction has 21 states and 25 transitions. [2019-05-23 09:22:05,860 INFO L146 ILogger]: Interpolant automaton has 6 states. [2019-05-23 09:22:05,860 INFO L146 ILogger]: Start isEmpty. Operand 21 states and 25 transitions. [2019-05-23 09:22:05,861 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 17 [2019-05-23 09:22:05,861 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:05,861 INFO L146 ILogger]: trace histogram [4, 4, 4, 1, 1, 1, 1] [2019-05-23 09:22:05,862 INFO L146 ILogger]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:05,863 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:05,863 INFO L146 ILogger]: Analyzing trace with hash -1814088925, now seen corresponding path program 4 times [2019-05-23 09:22:05,864 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:05,878 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:05,881 INFO L146 ILogger]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 09:22:05,884 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:06,105 INFO L146 ILogger]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:06,106 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:06,106 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-05-23 09:22:06,107 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 09:22:06,107 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 09:22:06,107 INFO L146 ILogger]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:22:06,108 INFO L146 ILogger]: Start difference. First operand 21 states and 25 transitions. Second operand 7 states. [2019-05-23 09:22:06,174 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:06,174 INFO L146 ILogger]: Finished difference Result 26 states and 31 transitions. [2019-05-23 09:22:06,174 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-05-23 09:22:06,175 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 16 [2019-05-23 09:22:06,175 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:06,177 INFO L146 ILogger]: With dead ends: 26 [2019-05-23 09:22:06,177 INFO L146 ILogger]: Without dead ends: 26 [2019-05-23 09:22:06,178 INFO L146 ILogger]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:22:06,178 INFO L146 ILogger]: Start minimizeSevpa. Operand 26 states. [2019-05-23 09:22:06,181 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-05-23 09:22:06,181 INFO L146 ILogger]: Start removeUnreachable. Operand 25 states. [2019-05-23 09:22:06,182 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-05-23 09:22:06,182 INFO L146 ILogger]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2019-05-23 09:22:06,183 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:06,183 INFO L146 ILogger]: Abstraction has 25 states and 30 transitions. [2019-05-23 09:22:06,183 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 09:22:06,183 INFO L146 ILogger]: Start isEmpty. Operand 25 states and 30 transitions. [2019-05-23 09:22:06,184 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 20 [2019-05-23 09:22:06,184 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:06,184 INFO L146 ILogger]: trace histogram [5, 5, 5, 1, 1, 1, 1] [2019-05-23 09:22:06,184 INFO L146 ILogger]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:06,185 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:06,185 INFO L146 ILogger]: Analyzing trace with hash 40800747, now seen corresponding path program 5 times [2019-05-23 09:22:06,186 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:06,196 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:06,197 INFO L146 ILogger]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-05-23 09:22:06,198 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:06,326 INFO L146 ILogger]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:06,326 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:06,326 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 09:22:06,327 INFO L146 ILogger]: Interpolant automaton has 8 states [2019-05-23 09:22:06,327 INFO L146 ILogger]: Constructing interpolant automaton starting with 8 interpolants. [2019-05-23 09:22:06,328 INFO L146 ILogger]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-05-23 09:22:06,328 INFO L146 ILogger]: Start difference. First operand 25 states and 30 transitions. Second operand 8 states. [2019-05-23 09:22:06,452 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:06,452 INFO L146 ILogger]: Finished difference Result 30 states and 36 transitions. [2019-05-23 09:22:06,453 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-05-23 09:22:06,453 INFO L146 ILogger]: Start accepts. Automaton has 8 states. Word has length 19 [2019-05-23 09:22:06,453 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:06,454 INFO L146 ILogger]: With dead ends: 30 [2019-05-23 09:22:06,454 INFO L146 ILogger]: Without dead ends: 30 [2019-05-23 09:22:06,455 INFO L146 ILogger]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-05-23 09:22:06,456 INFO L146 ILogger]: Start minimizeSevpa. Operand 30 states. [2019-05-23 09:22:06,459 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-05-23 09:22:06,459 INFO L146 ILogger]: Start removeUnreachable. Operand 29 states. [2019-05-23 09:22:06,460 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-05-23 09:22:06,460 INFO L146 ILogger]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 19 [2019-05-23 09:22:06,461 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:06,461 INFO L146 ILogger]: Abstraction has 29 states and 35 transitions. [2019-05-23 09:22:06,461 INFO L146 ILogger]: Interpolant automaton has 8 states. [2019-05-23 09:22:06,461 INFO L146 ILogger]: Start isEmpty. Operand 29 states and 35 transitions. [2019-05-23 09:22:06,462 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 23 [2019-05-23 09:22:06,462 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:06,462 INFO L146 ILogger]: trace histogram [6, 6, 6, 1, 1, 1, 1] [2019-05-23 09:22:06,462 INFO L146 ILogger]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:06,462 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:06,462 INFO L146 ILogger]: Analyzing trace with hash 9788963, now seen corresponding path program 6 times [2019-05-23 09:22:06,463 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:06,475 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:06,476 INFO L146 ILogger]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-23 09:22:06,477 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:06,563 INFO L146 ILogger]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:06,563 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:06,564 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-05-23 09:22:06,564 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 09:22:06,564 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 09:22:06,565 INFO L146 ILogger]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:22:06,565 INFO L146 ILogger]: Start difference. First operand 29 states and 35 transitions. Second operand 9 states. [2019-05-23 09:22:06,634 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:06,634 INFO L146 ILogger]: Finished difference Result 34 states and 41 transitions. [2019-05-23 09:22:06,635 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 09:22:06,635 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 22 [2019-05-23 09:22:06,636 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:06,637 INFO L146 ILogger]: With dead ends: 34 [2019-05-23 09:22:06,637 INFO L146 ILogger]: Without dead ends: 34 [2019-05-23 09:22:06,637 INFO L146 ILogger]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:22:06,638 INFO L146 ILogger]: Start minimizeSevpa. Operand 34 states. [2019-05-23 09:22:06,640 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-05-23 09:22:06,641 INFO L146 ILogger]: Start removeUnreachable. Operand 33 states. [2019-05-23 09:22:06,641 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-05-23 09:22:06,641 INFO L146 ILogger]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 22 [2019-05-23 09:22:06,642 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:06,642 INFO L146 ILogger]: Abstraction has 33 states and 40 transitions. [2019-05-23 09:22:06,642 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 09:22:06,642 INFO L146 ILogger]: Start isEmpty. Operand 33 states and 40 transitions. [2019-05-23 09:22:06,643 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 26 [2019-05-23 09:22:06,643 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:06,643 INFO L146 ILogger]: trace histogram [7, 7, 7, 1, 1, 1, 1] [2019-05-23 09:22:06,644 INFO L146 ILogger]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:06,644 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:06,644 INFO L146 ILogger]: Analyzing trace with hash -444299541, now seen corresponding path program 7 times [2019-05-23 09:22:06,645 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:06,661 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:06,662 INFO L146 ILogger]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-05-23 09:22:06,666 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:07,068 INFO L146 ILogger]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:07,068 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:07,068 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 09:22:07,069 INFO L146 ILogger]: Interpolant automaton has 10 states [2019-05-23 09:22:07,070 INFO L146 ILogger]: Constructing interpolant automaton starting with 10 interpolants. [2019-05-23 09:22:07,070 INFO L146 ILogger]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-05-23 09:22:07,070 INFO L146 ILogger]: Start difference. First operand 33 states and 40 transitions. Second operand 10 states. [2019-05-23 09:22:07,148 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:07,148 INFO L146 ILogger]: Finished difference Result 38 states and 46 transitions. [2019-05-23 09:22:07,149 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-05-23 09:22:07,149 INFO L146 ILogger]: Start accepts. Automaton has 10 states. Word has length 25 [2019-05-23 09:22:07,149 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:07,150 INFO L146 ILogger]: With dead ends: 38 [2019-05-23 09:22:07,150 INFO L146 ILogger]: Without dead ends: 38 [2019-05-23 09:22:07,151 INFO L146 ILogger]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-05-23 09:22:07,151 INFO L146 ILogger]: Start minimizeSevpa. Operand 38 states. [2019-05-23 09:22:07,154 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-05-23 09:22:07,158 INFO L146 ILogger]: Start removeUnreachable. Operand 37 states. [2019-05-23 09:22:07,159 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-05-23 09:22:07,159 INFO L146 ILogger]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 25 [2019-05-23 09:22:07,159 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:07,159 INFO L146 ILogger]: Abstraction has 37 states and 45 transitions. [2019-05-23 09:22:07,160 INFO L146 ILogger]: Interpolant automaton has 10 states. [2019-05-23 09:22:07,160 INFO L146 ILogger]: Start isEmpty. Operand 37 states and 45 transitions. [2019-05-23 09:22:07,161 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 29 [2019-05-23 09:22:07,161 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:07,161 INFO L146 ILogger]: trace histogram [8, 8, 8, 1, 1, 1, 1] [2019-05-23 09:22:07,162 INFO L146 ILogger]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:07,162 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:07,162 INFO L146 ILogger]: Analyzing trace with hash 952060195, now seen corresponding path program 8 times [2019-05-23 09:22:07,164 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:07,195 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:07,197 INFO L146 ILogger]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-23 09:22:07,201 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:07,523 INFO L146 ILogger]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:07,524 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:07,524 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-05-23 09:22:07,525 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 09:22:07,525 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 09:22:07,525 INFO L146 ILogger]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:07,526 INFO L146 ILogger]: Start difference. First operand 37 states and 45 transitions. Second operand 11 states. [2019-05-23 09:22:07,638 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:07,638 INFO L146 ILogger]: Finished difference Result 42 states and 51 transitions. [2019-05-23 09:22:07,639 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-05-23 09:22:07,639 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 28 [2019-05-23 09:22:07,639 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:07,640 INFO L146 ILogger]: With dead ends: 42 [2019-05-23 09:22:07,640 INFO L146 ILogger]: Without dead ends: 42 [2019-05-23 09:22:07,640 INFO L146 ILogger]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:07,641 INFO L146 ILogger]: Start minimizeSevpa. Operand 42 states. [2019-05-23 09:22:07,644 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-05-23 09:22:07,644 INFO L146 ILogger]: Start removeUnreachable. Operand 41 states. [2019-05-23 09:22:07,645 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2019-05-23 09:22:07,645 INFO L146 ILogger]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 28 [2019-05-23 09:22:07,645 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:07,646 INFO L146 ILogger]: Abstraction has 41 states and 50 transitions. [2019-05-23 09:22:07,646 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 09:22:07,646 INFO L146 ILogger]: Start isEmpty. Operand 41 states and 50 transitions. [2019-05-23 09:22:07,647 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 32 [2019-05-23 09:22:07,647 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:07,647 INFO L146 ILogger]: trace histogram [9, 9, 9, 1, 1, 1, 1] [2019-05-23 09:22:07,647 INFO L146 ILogger]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:07,647 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:07,648 INFO L146 ILogger]: Analyzing trace with hash -1148273685, now seen corresponding path program 9 times [2019-05-23 09:22:07,649 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:07,661 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:07,662 INFO L146 ILogger]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-05-23 09:22:07,664 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:07,812 INFO L146 ILogger]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:07,812 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:07,813 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 09:22:07,821 INFO L146 ILogger]: Interpolant automaton has 12 states [2019-05-23 09:22:07,821 INFO L146 ILogger]: Constructing interpolant automaton starting with 12 interpolants. [2019-05-23 09:22:07,822 INFO L146 ILogger]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-05-23 09:22:07,823 INFO L146 ILogger]: Start difference. First operand 41 states and 50 transitions. Second operand 12 states. [2019-05-23 09:22:07,884 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:07,884 INFO L146 ILogger]: Finished difference Result 46 states and 56 transitions. [2019-05-23 09:22:07,884 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 09:22:07,884 INFO L146 ILogger]: Start accepts. Automaton has 12 states. Word has length 31 [2019-05-23 09:22:07,886 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:07,887 INFO L146 ILogger]: With dead ends: 46 [2019-05-23 09:22:07,887 INFO L146 ILogger]: Without dead ends: 46 [2019-05-23 09:22:07,887 INFO L146 ILogger]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-05-23 09:22:07,888 INFO L146 ILogger]: Start minimizeSevpa. Operand 46 states. [2019-05-23 09:22:07,891 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-05-23 09:22:07,891 INFO L146 ILogger]: Start removeUnreachable. Operand 45 states. [2019-05-23 09:22:07,892 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2019-05-23 09:22:07,892 INFO L146 ILogger]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 31 [2019-05-23 09:22:07,892 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:07,892 INFO L146 ILogger]: Abstraction has 45 states and 55 transitions. [2019-05-23 09:22:07,892 INFO L146 ILogger]: Interpolant automaton has 12 states. [2019-05-23 09:22:07,892 INFO L146 ILogger]: Start isEmpty. Operand 45 states and 55 transitions. [2019-05-23 09:22:07,893 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 35 [2019-05-23 09:22:07,894 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:07,894 INFO L146 ILogger]: trace histogram [10, 10, 10, 1, 1, 1, 1] [2019-05-23 09:22:07,894 INFO L146 ILogger]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:07,894 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:07,894 INFO L146 ILogger]: Analyzing trace with hash 1183642659, now seen corresponding path program 10 times [2019-05-23 09:22:07,895 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:07,907 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:07,908 INFO L146 ILogger]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-23 09:22:07,909 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:08,146 INFO L146 ILogger]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:08,146 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:08,146 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-05-23 09:22:08,146 INFO L146 ILogger]: Interpolant automaton has 13 states [2019-05-23 09:22:08,147 INFO L146 ILogger]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-23 09:22:08,147 INFO L146 ILogger]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:22:08,147 INFO L146 ILogger]: Start difference. First operand 45 states and 55 transitions. Second operand 13 states. [2019-05-23 09:22:08,243 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:08,243 INFO L146 ILogger]: Finished difference Result 50 states and 61 transitions. [2019-05-23 09:22:08,243 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-05-23 09:22:08,243 INFO L146 ILogger]: Start accepts. Automaton has 13 states. Word has length 34 [2019-05-23 09:22:08,244 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:08,244 INFO L146 ILogger]: With dead ends: 50 [2019-05-23 09:22:08,244 INFO L146 ILogger]: Without dead ends: 50 [2019-05-23 09:22:08,245 INFO L146 ILogger]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:22:08,245 INFO L146 ILogger]: Start minimizeSevpa. Operand 50 states. [2019-05-23 09:22:08,249 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-05-23 09:22:08,249 INFO L146 ILogger]: Start removeUnreachable. Operand 49 states. [2019-05-23 09:22:08,250 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2019-05-23 09:22:08,250 INFO L146 ILogger]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 34 [2019-05-23 09:22:08,250 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:08,251 INFO L146 ILogger]: Abstraction has 49 states and 60 transitions. [2019-05-23 09:22:08,251 INFO L146 ILogger]: Interpolant automaton has 13 states. [2019-05-23 09:22:08,251 INFO L146 ILogger]: Start isEmpty. Operand 49 states and 60 transitions. [2019-05-23 09:22:08,252 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 38 [2019-05-23 09:22:08,253 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:08,253 INFO L146 ILogger]: trace histogram [11, 11, 11, 1, 1, 1, 1] [2019-05-23 09:22:08,253 INFO L146 ILogger]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:08,253 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:08,254 INFO L146 ILogger]: Analyzing trace with hash 207433963, now seen corresponding path program 11 times [2019-05-23 09:22:08,254 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:08,267 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:08,268 INFO L146 ILogger]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2019-05-23 09:22:08,270 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:08,438 INFO L146 ILogger]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:08,439 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:08,439 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-23 09:22:08,439 INFO L146 ILogger]: Interpolant automaton has 14 states [2019-05-23 09:22:08,440 INFO L146 ILogger]: Constructing interpolant automaton starting with 14 interpolants. [2019-05-23 09:22:08,440 INFO L146 ILogger]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-05-23 09:22:08,440 INFO L146 ILogger]: Start difference. First operand 49 states and 60 transitions. Second operand 14 states. [2019-05-23 09:22:08,531 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:08,531 INFO L146 ILogger]: Finished difference Result 54 states and 66 transitions. [2019-05-23 09:22:08,532 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-05-23 09:22:08,532 INFO L146 ILogger]: Start accepts. Automaton has 14 states. Word has length 37 [2019-05-23 09:22:08,532 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:08,533 INFO L146 ILogger]: With dead ends: 54 [2019-05-23 09:22:08,533 INFO L146 ILogger]: Without dead ends: 54 [2019-05-23 09:22:08,533 INFO L146 ILogger]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-05-23 09:22:08,533 INFO L146 ILogger]: Start minimizeSevpa. Operand 54 states. [2019-05-23 09:22:08,537 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-05-23 09:22:08,537 INFO L146 ILogger]: Start removeUnreachable. Operand 53 states. [2019-05-23 09:22:08,538 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2019-05-23 09:22:08,538 INFO L146 ILogger]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 37 [2019-05-23 09:22:08,539 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:08,539 INFO L146 ILogger]: Abstraction has 53 states and 65 transitions. [2019-05-23 09:22:08,539 INFO L146 ILogger]: Interpolant automaton has 14 states. [2019-05-23 09:22:08,539 INFO L146 ILogger]: Start isEmpty. Operand 53 states and 65 transitions. [2019-05-23 09:22:08,540 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 41 [2019-05-23 09:22:08,540 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:08,540 INFO L146 ILogger]: trace histogram [12, 12, 12, 1, 1, 1, 1] [2019-05-23 09:22:08,541 INFO L146 ILogger]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:08,541 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:08,541 INFO L146 ILogger]: Analyzing trace with hash -802267357, now seen corresponding path program 12 times [2019-05-23 09:22:08,542 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:08,553 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:08,555 INFO L146 ILogger]: Trace formula consists of 56 conjuncts, 14 conjunts are in the unsatisfiable core [2019-05-23 09:22:08,556 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:08,683 INFO L146 ILogger]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:08,684 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:08,684 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-05-23 09:22:08,684 INFO L146 ILogger]: Interpolant automaton has 15 states [2019-05-23 09:22:08,685 INFO L146 ILogger]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-23 09:22:08,685 INFO L146 ILogger]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:08,685 INFO L146 ILogger]: Start difference. First operand 53 states and 65 transitions. Second operand 15 states. [2019-05-23 09:22:08,765 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:08,765 INFO L146 ILogger]: Finished difference Result 58 states and 71 transitions. [2019-05-23 09:22:08,766 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-23 09:22:08,766 INFO L146 ILogger]: Start accepts. Automaton has 15 states. Word has length 40 [2019-05-23 09:22:08,766 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:08,767 INFO L146 ILogger]: With dead ends: 58 [2019-05-23 09:22:08,767 INFO L146 ILogger]: Without dead ends: 58 [2019-05-23 09:22:08,767 INFO L146 ILogger]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:08,768 INFO L146 ILogger]: Start minimizeSevpa. Operand 58 states. [2019-05-23 09:22:08,771 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-05-23 09:22:08,771 INFO L146 ILogger]: Start removeUnreachable. Operand 57 states. [2019-05-23 09:22:08,772 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2019-05-23 09:22:08,772 INFO L146 ILogger]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 40 [2019-05-23 09:22:08,773 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:08,773 INFO L146 ILogger]: Abstraction has 57 states and 70 transitions. [2019-05-23 09:22:08,773 INFO L146 ILogger]: Interpolant automaton has 15 states. [2019-05-23 09:22:08,773 INFO L146 ILogger]: Start isEmpty. Operand 57 states and 70 transitions. [2019-05-23 09:22:08,774 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 44 [2019-05-23 09:22:08,774 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:08,774 INFO L146 ILogger]: trace histogram [13, 13, 13, 1, 1, 1, 1] [2019-05-23 09:22:08,775 INFO L146 ILogger]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:08,775 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:08,775 INFO L146 ILogger]: Analyzing trace with hash 1136649707, now seen corresponding path program 13 times [2019-05-23 09:22:08,776 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:08,789 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:08,791 INFO L146 ILogger]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2019-05-23 09:22:08,793 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,155 INFO L146 ILogger]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:09,156 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:09,156 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-23 09:22:09,156 INFO L146 ILogger]: Interpolant automaton has 16 states [2019-05-23 09:22:09,157 INFO L146 ILogger]: Constructing interpolant automaton starting with 16 interpolants. [2019-05-23 09:22:09,157 INFO L146 ILogger]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-05-23 09:22:09,157 INFO L146 ILogger]: Start difference. First operand 57 states and 70 transitions. Second operand 16 states. [2019-05-23 09:22:09,238 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,238 INFO L146 ILogger]: Finished difference Result 62 states and 76 transitions. [2019-05-23 09:22:09,239 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-05-23 09:22:09,239 INFO L146 ILogger]: Start accepts. Automaton has 16 states. Word has length 43 [2019-05-23 09:22:09,239 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,240 INFO L146 ILogger]: With dead ends: 62 [2019-05-23 09:22:09,240 INFO L146 ILogger]: Without dead ends: 62 [2019-05-23 09:22:09,241 INFO L146 ILogger]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-05-23 09:22:09,241 INFO L146 ILogger]: Start minimizeSevpa. Operand 62 states. [2019-05-23 09:22:09,244 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-05-23 09:22:09,244 INFO L146 ILogger]: Start removeUnreachable. Operand 61 states. [2019-05-23 09:22:09,245 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-05-23 09:22:09,245 INFO L146 ILogger]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 43 [2019-05-23 09:22:09,245 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,246 INFO L146 ILogger]: Abstraction has 61 states and 75 transitions. [2019-05-23 09:22:09,246 INFO L146 ILogger]: Interpolant automaton has 16 states. [2019-05-23 09:22:09,246 INFO L146 ILogger]: Start isEmpty. Operand 61 states and 75 transitions. [2019-05-23 09:22:09,247 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 47 [2019-05-23 09:22:09,247 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,247 INFO L146 ILogger]: trace histogram [14, 14, 14, 1, 1, 1, 1] [2019-05-23 09:22:09,247 INFO L146 ILogger]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,248 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,248 INFO L146 ILogger]: Analyzing trace with hash 399739427, now seen corresponding path program 14 times [2019-05-23 09:22:09,249 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,261 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,263 INFO L146 ILogger]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,265 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,421 INFO L146 ILogger]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:09,422 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:09,422 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-05-23 09:22:09,422 INFO L146 ILogger]: Interpolant automaton has 17 states [2019-05-23 09:22:09,423 INFO L146 ILogger]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-23 09:22:09,423 INFO L146 ILogger]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:22:09,423 INFO L146 ILogger]: Start difference. First operand 61 states and 75 transitions. Second operand 17 states. [2019-05-23 09:22:09,674 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,674 INFO L146 ILogger]: Finished difference Result 66 states and 81 transitions. [2019-05-23 09:22:09,674 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-05-23 09:22:09,675 INFO L146 ILogger]: Start accepts. Automaton has 17 states. Word has length 46 [2019-05-23 09:22:09,675 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,675 INFO L146 ILogger]: With dead ends: 66 [2019-05-23 09:22:09,675 INFO L146 ILogger]: Without dead ends: 66 [2019-05-23 09:22:09,676 INFO L146 ILogger]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:22:09,676 INFO L146 ILogger]: Start minimizeSevpa. Operand 66 states. [2019-05-23 09:22:09,679 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-05-23 09:22:09,679 INFO L146 ILogger]: Start removeUnreachable. Operand 65 states. [2019-05-23 09:22:09,680 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2019-05-23 09:22:09,680 INFO L146 ILogger]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 46 [2019-05-23 09:22:09,681 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,681 INFO L146 ILogger]: Abstraction has 65 states and 80 transitions. [2019-05-23 09:22:09,681 INFO L146 ILogger]: Interpolant automaton has 17 states. [2019-05-23 09:22:09,681 INFO L146 ILogger]: Start isEmpty. Operand 65 states and 80 transitions. [2019-05-23 09:22:09,682 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 50 [2019-05-23 09:22:09,682 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,682 INFO L146 ILogger]: trace histogram [15, 15, 15, 1, 1, 1, 1] [2019-05-23 09:22:09,682 INFO L146 ILogger]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,683 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,683 INFO L146 ILogger]: Analyzing trace with hash -1316562197, now seen corresponding path program 15 times [2019-05-23 09:22:09,684 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,695 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,697 INFO L146 ILogger]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,699 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,894 INFO L146 ILogger]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:09,894 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:09,894 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-23 09:22:09,895 INFO L146 ILogger]: Interpolant automaton has 18 states [2019-05-23 09:22:09,895 INFO L146 ILogger]: Constructing interpolant automaton starting with 18 interpolants. [2019-05-23 09:22:09,895 INFO L146 ILogger]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-05-23 09:22:09,895 INFO L146 ILogger]: Start difference. First operand 65 states and 80 transitions. Second operand 18 states. [2019-05-23 09:22:09,954 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,954 INFO L146 ILogger]: Finished difference Result 70 states and 86 transitions. [2019-05-23 09:22:09,954 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-23 09:22:09,955 INFO L146 ILogger]: Start accepts. Automaton has 18 states. Word has length 49 [2019-05-23 09:22:09,955 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,956 INFO L146 ILogger]: With dead ends: 70 [2019-05-23 09:22:09,956 INFO L146 ILogger]: Without dead ends: 70 [2019-05-23 09:22:09,957 INFO L146 ILogger]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-05-23 09:22:09,957 INFO L146 ILogger]: Start minimizeSevpa. Operand 70 states. [2019-05-23 09:22:09,961 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-05-23 09:22:09,961 INFO L146 ILogger]: Start removeUnreachable. Operand 69 states. [2019-05-23 09:22:09,962 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2019-05-23 09:22:09,962 INFO L146 ILogger]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 49 [2019-05-23 09:22:09,962 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,962 INFO L146 ILogger]: Abstraction has 69 states and 85 transitions. [2019-05-23 09:22:09,962 INFO L146 ILogger]: Interpolant automaton has 18 states. [2019-05-23 09:22:09,963 INFO L146 ILogger]: Start isEmpty. Operand 69 states and 85 transitions. [2019-05-23 09:22:09,963 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 53 [2019-05-23 09:22:09,963 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,964 INFO L146 ILogger]: trace histogram [16, 16, 16, 1, 1, 1, 1] [2019-05-23 09:22:09,964 INFO L146 ILogger]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,964 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,964 INFO L146 ILogger]: Analyzing trace with hash -72583901, now seen corresponding path program 16 times [2019-05-23 09:22:09,965 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,977 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,979 INFO L146 ILogger]: Trace formula consists of 72 conjuncts, 18 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,981 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:10,552 INFO L146 ILogger]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:10,553 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:10,553 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-05-23 09:22:10,553 INFO L146 ILogger]: Interpolant automaton has 19 states [2019-05-23 09:22:10,553 INFO L146 ILogger]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-23 09:22:10,554 INFO L146 ILogger]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:10,554 INFO L146 ILogger]: Start difference. First operand 69 states and 85 transitions. Second operand 19 states. [2019-05-23 09:22:10,652 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:10,652 INFO L146 ILogger]: Finished difference Result 74 states and 91 transitions. [2019-05-23 09:22:10,653 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-05-23 09:22:10,653 INFO L146 ILogger]: Start accepts. Automaton has 19 states. Word has length 52 [2019-05-23 09:22:10,653 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:10,653 INFO L146 ILogger]: With dead ends: 74 [2019-05-23 09:22:10,653 INFO L146 ILogger]: Without dead ends: 74 [2019-05-23 09:22:10,654 INFO L146 ILogger]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:10,654 INFO L146 ILogger]: Start minimizeSevpa. Operand 74 states. [2019-05-23 09:22:10,656 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-05-23 09:22:10,657 INFO L146 ILogger]: Start removeUnreachable. Operand 73 states. [2019-05-23 09:22:10,657 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2019-05-23 09:22:10,657 INFO L146 ILogger]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 52 [2019-05-23 09:22:10,658 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:10,658 INFO L146 ILogger]: Abstraction has 73 states and 90 transitions. [2019-05-23 09:22:10,658 INFO L146 ILogger]: Interpolant automaton has 19 states. [2019-05-23 09:22:10,658 INFO L146 ILogger]: Start isEmpty. Operand 73 states and 90 transitions. [2019-05-23 09:22:10,659 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 56 [2019-05-23 09:22:10,659 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:10,659 INFO L146 ILogger]: trace histogram [17, 17, 17, 1, 1, 1, 1] [2019-05-23 09:22:10,660 INFO L146 ILogger]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:10,660 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:10,660 INFO L146 ILogger]: Analyzing trace with hash -1987964949, now seen corresponding path program 17 times [2019-05-23 09:22:10,661 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:10,672 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:10,674 INFO L146 ILogger]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2019-05-23 09:22:10,677 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:11,286 INFO L146 ILogger]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:11,286 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:11,286 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-23 09:22:11,287 INFO L146 ILogger]: Interpolant automaton has 20 states [2019-05-23 09:22:11,287 INFO L146 ILogger]: Constructing interpolant automaton starting with 20 interpolants. [2019-05-23 09:22:11,287 INFO L146 ILogger]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-05-23 09:22:11,288 INFO L146 ILogger]: Start difference. First operand 73 states and 90 transitions. Second operand 20 states. [2019-05-23 09:22:11,381 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:11,382 INFO L146 ILogger]: Finished difference Result 78 states and 96 transitions. [2019-05-23 09:22:11,382 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-05-23 09:22:11,382 INFO L146 ILogger]: Start accepts. Automaton has 20 states. Word has length 55 [2019-05-23 09:22:11,382 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:11,383 INFO L146 ILogger]: With dead ends: 78 [2019-05-23 09:22:11,383 INFO L146 ILogger]: Without dead ends: 78 [2019-05-23 09:22:11,384 INFO L146 ILogger]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-05-23 09:22:11,384 INFO L146 ILogger]: Start minimizeSevpa. Operand 78 states. [2019-05-23 09:22:11,387 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-05-23 09:22:11,387 INFO L146 ILogger]: Start removeUnreachable. Operand 77 states. [2019-05-23 09:22:11,387 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2019-05-23 09:22:11,388 INFO L146 ILogger]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 55 [2019-05-23 09:22:11,388 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:11,388 INFO L146 ILogger]: Abstraction has 77 states and 95 transitions. [2019-05-23 09:22:11,388 INFO L146 ILogger]: Interpolant automaton has 20 states. [2019-05-23 09:22:11,388 INFO L146 ILogger]: Start isEmpty. Operand 77 states and 95 transitions. [2019-05-23 09:22:11,389 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 59 [2019-05-23 09:22:11,389 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:11,389 INFO L146 ILogger]: trace histogram [18, 18, 18, 1, 1, 1, 1] [2019-05-23 09:22:11,390 INFO L146 ILogger]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:11,390 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:11,390 INFO L146 ILogger]: Analyzing trace with hash -169271261, now seen corresponding path program 18 times [2019-05-23 09:22:11,391 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:11,402 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:11,403 INFO L146 ILogger]: Trace formula consists of 80 conjuncts, 20 conjunts are in the unsatisfiable core [2019-05-23 09:22:11,406 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:11,637 INFO L146 ILogger]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:11,637 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:11,638 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-05-23 09:22:11,638 INFO L146 ILogger]: Interpolant automaton has 21 states [2019-05-23 09:22:11,638 INFO L146 ILogger]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-23 09:22:11,639 INFO L146 ILogger]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:22:11,639 INFO L146 ILogger]: Start difference. First operand 77 states and 95 transitions. Second operand 21 states. [2019-05-23 09:22:11,697 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:11,697 INFO L146 ILogger]: Finished difference Result 82 states and 101 transitions. [2019-05-23 09:22:11,697 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-23 09:22:11,698 INFO L146 ILogger]: Start accepts. Automaton has 21 states. Word has length 58 [2019-05-23 09:22:11,698 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:11,699 INFO L146 ILogger]: With dead ends: 82 [2019-05-23 09:22:11,699 INFO L146 ILogger]: Without dead ends: 82 [2019-05-23 09:22:11,700 INFO L146 ILogger]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:22:11,700 INFO L146 ILogger]: Start minimizeSevpa. Operand 82 states. [2019-05-23 09:22:11,703 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-05-23 09:22:11,703 INFO L146 ILogger]: Start removeUnreachable. Operand 81 states. [2019-05-23 09:22:11,704 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2019-05-23 09:22:11,704 INFO L146 ILogger]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 58 [2019-05-23 09:22:11,704 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:11,704 INFO L146 ILogger]: Abstraction has 81 states and 100 transitions. [2019-05-23 09:22:11,704 INFO L146 ILogger]: Interpolant automaton has 21 states. [2019-05-23 09:22:11,704 INFO L146 ILogger]: Start isEmpty. Operand 81 states and 100 transitions. [2019-05-23 09:22:11,705 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 62 [2019-05-23 09:22:11,705 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:11,706 INFO L146 ILogger]: trace histogram [19, 19, 19, 1, 1, 1, 1] [2019-05-23 09:22:11,706 INFO L146 ILogger]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:11,706 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:11,706 INFO L146 ILogger]: Analyzing trace with hash -478051093, now seen corresponding path program 19 times [2019-05-23 09:22:11,707 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:11,718 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:11,719 INFO L146 ILogger]: Trace formula consists of 84 conjuncts, 21 conjunts are in the unsatisfiable core [2019-05-23 09:22:11,722 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:12,176 INFO L146 ILogger]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:12,176 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:12,177 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-23 09:22:12,177 INFO L146 ILogger]: Interpolant automaton has 22 states [2019-05-23 09:22:12,177 INFO L146 ILogger]: Constructing interpolant automaton starting with 22 interpolants. [2019-05-23 09:22:12,178 INFO L146 ILogger]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-05-23 09:22:12,178 INFO L146 ILogger]: Start difference. First operand 81 states and 100 transitions. Second operand 22 states. [2019-05-23 09:22:12,240 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:12,240 INFO L146 ILogger]: Finished difference Result 86 states and 106 transitions. [2019-05-23 09:22:12,240 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-05-23 09:22:12,241 INFO L146 ILogger]: Start accepts. Automaton has 22 states. Word has length 61 [2019-05-23 09:22:12,241 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:12,242 INFO L146 ILogger]: With dead ends: 86 [2019-05-23 09:22:12,242 INFO L146 ILogger]: Without dead ends: 86 [2019-05-23 09:22:12,243 INFO L146 ILogger]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-05-23 09:22:12,243 INFO L146 ILogger]: Start minimizeSevpa. Operand 86 states. [2019-05-23 09:22:12,245 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-05-23 09:22:12,245 INFO L146 ILogger]: Start removeUnreachable. Operand 85 states. [2019-05-23 09:22:12,246 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2019-05-23 09:22:12,246 INFO L146 ILogger]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 61 [2019-05-23 09:22:12,246 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:12,247 INFO L146 ILogger]: Abstraction has 85 states and 105 transitions. [2019-05-23 09:22:12,247 INFO L146 ILogger]: Interpolant automaton has 22 states. [2019-05-23 09:22:12,247 INFO L146 ILogger]: Start isEmpty. Operand 85 states and 105 transitions. [2019-05-23 09:22:12,248 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 65 [2019-05-23 09:22:12,248 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:12,248 INFO L146 ILogger]: trace histogram [20, 20, 20, 1, 1, 1, 1] [2019-05-23 09:22:12,248 INFO L146 ILogger]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:12,248 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:12,249 INFO L146 ILogger]: Analyzing trace with hash 481921827, now seen corresponding path program 20 times [2019-05-23 09:22:12,249 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:12,260 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:12,261 INFO L146 ILogger]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2019-05-23 09:22:12,263 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:12,522 INFO L146 ILogger]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:12,522 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:12,522 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-05-23 09:22:12,523 INFO L146 ILogger]: Interpolant automaton has 23 states [2019-05-23 09:22:12,523 INFO L146 ILogger]: Constructing interpolant automaton starting with 23 interpolants. [2019-05-23 09:22:12,523 INFO L146 ILogger]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:12,524 INFO L146 ILogger]: Start difference. First operand 85 states and 105 transitions. Second operand 23 states. [2019-05-23 09:22:12,611 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:12,611 INFO L146 ILogger]: Finished difference Result 90 states and 111 transitions. [2019-05-23 09:22:12,612 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-05-23 09:22:12,612 INFO L146 ILogger]: Start accepts. Automaton has 23 states. Word has length 64 [2019-05-23 09:22:12,612 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:12,613 INFO L146 ILogger]: With dead ends: 90 [2019-05-23 09:22:12,613 INFO L146 ILogger]: Without dead ends: 90 [2019-05-23 09:22:12,614 INFO L146 ILogger]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:12,614 INFO L146 ILogger]: Start minimizeSevpa. Operand 90 states. [2019-05-23 09:22:12,616 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-05-23 09:22:12,616 INFO L146 ILogger]: Start removeUnreachable. Operand 89 states. [2019-05-23 09:22:12,617 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2019-05-23 09:22:12,617 INFO L146 ILogger]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 64 [2019-05-23 09:22:12,617 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:12,617 INFO L146 ILogger]: Abstraction has 89 states and 110 transitions. [2019-05-23 09:22:12,617 INFO L146 ILogger]: Interpolant automaton has 23 states. [2019-05-23 09:22:12,618 INFO L146 ILogger]: Start isEmpty. Operand 89 states and 110 transitions. [2019-05-23 09:22:12,618 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 68 [2019-05-23 09:22:12,618 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:12,618 INFO L146 ILogger]: trace histogram [21, 21, 21, 1, 1, 1, 1] [2019-05-23 09:22:12,619 INFO L146 ILogger]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:12,619 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:12,619 INFO L146 ILogger]: Analyzing trace with hash -1152042517, now seen corresponding path program 21 times [2019-05-23 09:22:12,620 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:12,631 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:12,632 INFO L146 ILogger]: Trace formula consists of 92 conjuncts, 23 conjunts are in the unsatisfiable core [2019-05-23 09:22:12,634 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:13,171 INFO L146 ILogger]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:13,171 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:13,172 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-05-23 09:22:13,172 INFO L146 ILogger]: Interpolant automaton has 24 states [2019-05-23 09:22:13,172 INFO L146 ILogger]: Constructing interpolant automaton starting with 24 interpolants. [2019-05-23 09:22:13,173 INFO L146 ILogger]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-05-23 09:22:13,173 INFO L146 ILogger]: Start difference. First operand 89 states and 110 transitions. Second operand 24 states. [2019-05-23 09:22:13,276 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:13,276 INFO L146 ILogger]: Finished difference Result 94 states and 116 transitions. [2019-05-23 09:22:13,277 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-23 09:22:13,277 INFO L146 ILogger]: Start accepts. Automaton has 24 states. Word has length 67 [2019-05-23 09:22:13,277 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:13,278 INFO L146 ILogger]: With dead ends: 94 [2019-05-23 09:22:13,278 INFO L146 ILogger]: Without dead ends: 94 [2019-05-23 09:22:13,278 INFO L146 ILogger]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-05-23 09:22:13,279 INFO L146 ILogger]: Start minimizeSevpa. Operand 94 states. [2019-05-23 09:22:13,280 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-05-23 09:22:13,280 INFO L146 ILogger]: Start removeUnreachable. Operand 93 states. [2019-05-23 09:22:13,281 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2019-05-23 09:22:13,281 INFO L146 ILogger]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 67 [2019-05-23 09:22:13,281 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:13,281 INFO L146 ILogger]: Abstraction has 93 states and 115 transitions. [2019-05-23 09:22:13,281 INFO L146 ILogger]: Interpolant automaton has 24 states. [2019-05-23 09:22:13,281 INFO L146 ILogger]: Start isEmpty. Operand 93 states and 115 transitions. [2019-05-23 09:22:13,282 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 71 [2019-05-23 09:22:13,282 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:13,282 INFO L146 ILogger]: trace histogram [22, 22, 22, 1, 1, 1, 1] [2019-05-23 09:22:13,282 INFO L146 ILogger]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:13,283 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:13,283 INFO L146 ILogger]: Analyzing trace with hash 575518243, now seen corresponding path program 22 times [2019-05-23 09:22:13,284 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:13,295 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:13,297 INFO L146 ILogger]: Trace formula consists of 96 conjuncts, 24 conjunts are in the unsatisfiable core [2019-05-23 09:22:13,300 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:13,626 INFO L146 ILogger]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:13,627 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:13,627 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-05-23 09:22:13,627 INFO L146 ILogger]: Interpolant automaton has 25 states [2019-05-23 09:22:13,628 INFO L146 ILogger]: Constructing interpolant automaton starting with 25 interpolants. [2019-05-23 09:22:13,628 INFO L146 ILogger]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:22:13,628 INFO L146 ILogger]: Start difference. First operand 93 states and 115 transitions. Second operand 25 states. [2019-05-23 09:22:13,702 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:13,702 INFO L146 ILogger]: Finished difference Result 98 states and 121 transitions. [2019-05-23 09:22:13,702 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-05-23 09:22:13,702 INFO L146 ILogger]: Start accepts. Automaton has 25 states. Word has length 70 [2019-05-23 09:22:13,703 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:13,704 INFO L146 ILogger]: With dead ends: 98 [2019-05-23 09:22:13,704 INFO L146 ILogger]: Without dead ends: 98 [2019-05-23 09:22:13,705 INFO L146 ILogger]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:22:13,705 INFO L146 ILogger]: Start minimizeSevpa. Operand 98 states. [2019-05-23 09:22:13,707 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-05-23 09:22:13,708 INFO L146 ILogger]: Start removeUnreachable. Operand 97 states. [2019-05-23 09:22:13,708 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2019-05-23 09:22:13,708 INFO L146 ILogger]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 70 [2019-05-23 09:22:13,708 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:13,709 INFO L146 ILogger]: Abstraction has 97 states and 120 transitions. [2019-05-23 09:22:13,709 INFO L146 ILogger]: Interpolant automaton has 25 states. [2019-05-23 09:22:13,709 INFO L146 ILogger]: Start isEmpty. Operand 97 states and 120 transitions. [2019-05-23 09:22:13,709 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 74 [2019-05-23 09:22:13,709 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:13,710 INFO L146 ILogger]: trace histogram [23, 23, 23, 1, 1, 1, 1] [2019-05-23 09:22:13,710 INFO L146 ILogger]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:13,710 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:13,710 INFO L146 ILogger]: Analyzing trace with hash -254988565, now seen corresponding path program 23 times [2019-05-23 09:22:13,711 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:13,720 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:13,722 INFO L146 ILogger]: Trace formula consists of 100 conjuncts, 25 conjunts are in the unsatisfiable core [2019-05-23 09:22:13,724 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:14,015 INFO L146 ILogger]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:14,015 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:14,015 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-05-23 09:22:14,015 INFO L146 ILogger]: Interpolant automaton has 26 states [2019-05-23 09:22:14,016 INFO L146 ILogger]: Constructing interpolant automaton starting with 26 interpolants. [2019-05-23 09:22:14,016 INFO L146 ILogger]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-05-23 09:22:14,016 INFO L146 ILogger]: Start difference. First operand 97 states and 120 transitions. Second operand 26 states. [2019-05-23 09:22:14,096 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:14,097 INFO L146 ILogger]: Finished difference Result 102 states and 126 transitions. [2019-05-23 09:22:14,097 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-05-23 09:22:14,097 INFO L146 ILogger]: Start accepts. Automaton has 26 states. Word has length 73 [2019-05-23 09:22:14,098 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:14,099 INFO L146 ILogger]: With dead ends: 102 [2019-05-23 09:22:14,099 INFO L146 ILogger]: Without dead ends: 102 [2019-05-23 09:22:14,100 INFO L146 ILogger]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-05-23 09:22:14,100 INFO L146 ILogger]: Start minimizeSevpa. Operand 102 states. [2019-05-23 09:22:14,102 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-05-23 09:22:14,102 INFO L146 ILogger]: Start removeUnreachable. Operand 101 states. [2019-05-23 09:22:14,102 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2019-05-23 09:22:14,102 INFO L146 ILogger]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 73 [2019-05-23 09:22:14,103 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:14,103 INFO L146 ILogger]: Abstraction has 101 states and 125 transitions. [2019-05-23 09:22:14,103 INFO L146 ILogger]: Interpolant automaton has 26 states. [2019-05-23 09:22:14,103 INFO L146 ILogger]: Start isEmpty. Operand 101 states and 125 transitions. [2019-05-23 09:22:14,104 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 77 [2019-05-23 09:22:14,104 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:14,104 INFO L146 ILogger]: trace histogram [24, 24, 24, 1, 1, 1, 1] [2019-05-23 09:22:14,104 INFO L146 ILogger]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:14,104 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:14,104 INFO L146 ILogger]: Analyzing trace with hash 1423286563, now seen corresponding path program 24 times [2019-05-23 09:22:14,105 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:14,113 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:14,115 INFO L146 ILogger]: Trace formula consists of 104 conjuncts, 26 conjunts are in the unsatisfiable core [2019-05-23 09:22:14,117 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:14,887 INFO L146 ILogger]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:14,887 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:14,887 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-05-23 09:22:14,888 INFO L146 ILogger]: Interpolant automaton has 27 states [2019-05-23 09:22:14,888 INFO L146 ILogger]: Constructing interpolant automaton starting with 27 interpolants. [2019-05-23 09:22:14,888 INFO L146 ILogger]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:14,889 INFO L146 ILogger]: Start difference. First operand 101 states and 125 transitions. Second operand 27 states. [2019-05-23 09:22:14,966 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:14,966 INFO L146 ILogger]: Finished difference Result 106 states and 131 transitions. [2019-05-23 09:22:14,967 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-05-23 09:22:14,967 INFO L146 ILogger]: Start accepts. Automaton has 27 states. Word has length 76 [2019-05-23 09:22:14,967 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:14,968 INFO L146 ILogger]: With dead ends: 106 [2019-05-23 09:22:14,968 INFO L146 ILogger]: Without dead ends: 106 [2019-05-23 09:22:14,969 INFO L146 ILogger]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:14,969 INFO L146 ILogger]: Start minimizeSevpa. Operand 106 states. [2019-05-23 09:22:14,972 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-05-23 09:22:14,972 INFO L146 ILogger]: Start removeUnreachable. Operand 105 states. [2019-05-23 09:22:14,972 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2019-05-23 09:22:14,972 INFO L146 ILogger]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 76 [2019-05-23 09:22:14,973 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:14,973 INFO L146 ILogger]: Abstraction has 105 states and 130 transitions. [2019-05-23 09:22:14,973 INFO L146 ILogger]: Interpolant automaton has 27 states. [2019-05-23 09:22:14,973 INFO L146 ILogger]: Start isEmpty. Operand 105 states and 130 transitions. [2019-05-23 09:22:14,974 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 80 [2019-05-23 09:22:14,974 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:14,974 INFO L146 ILogger]: trace histogram [25, 25, 25, 1, 1, 1, 1] [2019-05-23 09:22:14,974 INFO L146 ILogger]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:14,974 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:14,975 INFO L146 ILogger]: Analyzing trace with hash 1203332075, now seen corresponding path program 25 times [2019-05-23 09:22:14,975 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:14,984 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:14,985 INFO L146 ILogger]: Trace formula consists of 108 conjuncts, 27 conjunts are in the unsatisfiable core [2019-05-23 09:22:14,986 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:15,583 INFO L146 ILogger]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:15,583 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:15,583 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-05-23 09:22:15,584 INFO L146 ILogger]: Interpolant automaton has 28 states [2019-05-23 09:22:15,584 INFO L146 ILogger]: Constructing interpolant automaton starting with 28 interpolants. [2019-05-23 09:22:15,584 INFO L146 ILogger]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-05-23 09:22:15,585 INFO L146 ILogger]: Start difference. First operand 105 states and 130 transitions. Second operand 28 states. [2019-05-23 09:22:15,701 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:15,701 INFO L146 ILogger]: Finished difference Result 110 states and 136 transitions. [2019-05-23 09:22:15,701 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-05-23 09:22:15,702 INFO L146 ILogger]: Start accepts. Automaton has 28 states. Word has length 79 [2019-05-23 09:22:15,702 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:15,703 INFO L146 ILogger]: With dead ends: 110 [2019-05-23 09:22:15,703 INFO L146 ILogger]: Without dead ends: 110 [2019-05-23 09:22:15,704 INFO L146 ILogger]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-05-23 09:22:15,704 INFO L146 ILogger]: Start minimizeSevpa. Operand 110 states. [2019-05-23 09:22:15,706 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-05-23 09:22:15,706 INFO L146 ILogger]: Start removeUnreachable. Operand 109 states. [2019-05-23 09:22:15,707 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2019-05-23 09:22:15,707 INFO L146 ILogger]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 79 [2019-05-23 09:22:15,707 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:15,707 INFO L146 ILogger]: Abstraction has 109 states and 135 transitions. [2019-05-23 09:22:15,707 INFO L146 ILogger]: Interpolant automaton has 28 states. [2019-05-23 09:22:15,707 INFO L146 ILogger]: Start isEmpty. Operand 109 states and 135 transitions. [2019-05-23 09:22:15,708 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 83 [2019-05-23 09:22:15,708 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:15,708 INFO L146 ILogger]: trace histogram [26, 26, 26, 1, 1, 1, 1] [2019-05-23 09:22:15,708 INFO L146 ILogger]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:15,708 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:15,708 INFO L146 ILogger]: Analyzing trace with hash -1635693533, now seen corresponding path program 26 times [2019-05-23 09:22:15,709 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:15,718 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:15,719 INFO L146 ILogger]: Trace formula consists of 112 conjuncts, 28 conjunts are in the unsatisfiable core [2019-05-23 09:22:15,721 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:16,896 INFO L146 ILogger]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:16,897 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:16,897 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-05-23 09:22:16,897 INFO L146 ILogger]: Interpolant automaton has 29 states [2019-05-23 09:22:16,897 INFO L146 ILogger]: Constructing interpolant automaton starting with 29 interpolants. [2019-05-23 09:22:16,897 INFO L146 ILogger]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:22:16,898 INFO L146 ILogger]: Start difference. First operand 109 states and 135 transitions. Second operand 29 states. [2019-05-23 09:22:17,086 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:17,086 INFO L146 ILogger]: Finished difference Result 114 states and 141 transitions. [2019-05-23 09:22:17,086 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-05-23 09:22:17,086 INFO L146 ILogger]: Start accepts. Automaton has 29 states. Word has length 82 [2019-05-23 09:22:17,087 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:17,087 INFO L146 ILogger]: With dead ends: 114 [2019-05-23 09:22:17,088 INFO L146 ILogger]: Without dead ends: 114 [2019-05-23 09:22:17,088 INFO L146 ILogger]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:22:17,089 INFO L146 ILogger]: Start minimizeSevpa. Operand 114 states. [2019-05-23 09:22:17,090 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-05-23 09:22:17,090 INFO L146 ILogger]: Start removeUnreachable. Operand 113 states. [2019-05-23 09:22:17,091 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 113 states to 113 states and 140 transitions. [2019-05-23 09:22:17,091 INFO L146 ILogger]: Start accepts. Automaton has 113 states and 140 transitions. Word has length 82 [2019-05-23 09:22:17,091 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:17,091 INFO L146 ILogger]: Abstraction has 113 states and 140 transitions. [2019-05-23 09:22:17,091 INFO L146 ILogger]: Interpolant automaton has 29 states. [2019-05-23 09:22:17,091 INFO L146 ILogger]: Start isEmpty. Operand 113 states and 140 transitions. [2019-05-23 09:22:17,092 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 86 [2019-05-23 09:22:17,092 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:17,092 INFO L146 ILogger]: trace histogram [27, 27, 27, 1, 1, 1, 1] [2019-05-23 09:22:17,092 INFO L146 ILogger]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:17,092 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:17,093 INFO L146 ILogger]: Analyzing trace with hash 1743378667, now seen corresponding path program 27 times [2019-05-23 09:22:17,093 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:17,102 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:17,103 INFO L146 ILogger]: Trace formula consists of 116 conjuncts, 29 conjunts are in the unsatisfiable core [2019-05-23 09:22:17,104 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:17,505 INFO L146 ILogger]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:17,505 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:17,505 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-05-23 09:22:17,506 INFO L146 ILogger]: Interpolant automaton has 30 states [2019-05-23 09:22:17,506 INFO L146 ILogger]: Constructing interpolant automaton starting with 30 interpolants. [2019-05-23 09:22:17,506 INFO L146 ILogger]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-05-23 09:22:17,506 INFO L146 ILogger]: Start difference. First operand 113 states and 140 transitions. Second operand 30 states. [2019-05-23 09:22:17,625 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:17,625 INFO L146 ILogger]: Finished difference Result 118 states and 146 transitions. [2019-05-23 09:22:17,626 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-23 09:22:17,626 INFO L146 ILogger]: Start accepts. Automaton has 30 states. Word has length 85 [2019-05-23 09:22:17,626 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:17,627 INFO L146 ILogger]: With dead ends: 118 [2019-05-23 09:22:17,628 INFO L146 ILogger]: Without dead ends: 118 [2019-05-23 09:22:17,628 INFO L146 ILogger]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-05-23 09:22:17,629 INFO L146 ILogger]: Start minimizeSevpa. Operand 118 states. [2019-05-23 09:22:17,631 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-05-23 09:22:17,631 INFO L146 ILogger]: Start removeUnreachable. Operand 117 states. [2019-05-23 09:22:17,631 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 117 states to 117 states and 145 transitions. [2019-05-23 09:22:17,632 INFO L146 ILogger]: Start accepts. Automaton has 117 states and 145 transitions. Word has length 85 [2019-05-23 09:22:17,632 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:17,632 INFO L146 ILogger]: Abstraction has 117 states and 145 transitions. [2019-05-23 09:22:17,632 INFO L146 ILogger]: Interpolant automaton has 30 states. [2019-05-23 09:22:17,632 INFO L146 ILogger]: Start isEmpty. Operand 117 states and 145 transitions. [2019-05-23 09:22:17,633 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 89 [2019-05-23 09:22:17,633 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:17,633 INFO L146 ILogger]: trace histogram [28, 28, 28, 1, 1, 1, 1] [2019-05-23 09:22:17,633 INFO L146 ILogger]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:17,633 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:17,634 INFO L146 ILogger]: Analyzing trace with hash -2055162077, now seen corresponding path program 28 times [2019-05-23 09:22:17,634 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:17,643 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:17,644 INFO L146 ILogger]: Trace formula consists of 120 conjuncts, 30 conjunts are in the unsatisfiable core [2019-05-23 09:22:17,645 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:18,083 INFO L146 ILogger]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:18,083 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:18,084 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-05-23 09:22:18,084 INFO L146 ILogger]: Interpolant automaton has 31 states [2019-05-23 09:22:18,084 INFO L146 ILogger]: Constructing interpolant automaton starting with 31 interpolants. [2019-05-23 09:22:18,084 INFO L146 ILogger]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:18,085 INFO L146 ILogger]: Start difference. First operand 117 states and 145 transitions. Second operand 31 states. [2019-05-23 09:22:18,235 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:18,236 INFO L146 ILogger]: Finished difference Result 122 states and 151 transitions. [2019-05-23 09:22:18,236 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-05-23 09:22:18,236 INFO L146 ILogger]: Start accepts. Automaton has 31 states. Word has length 88 [2019-05-23 09:22:18,236 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:18,237 INFO L146 ILogger]: With dead ends: 122 [2019-05-23 09:22:18,238 INFO L146 ILogger]: Without dead ends: 122 [2019-05-23 09:22:18,239 INFO L146 ILogger]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:18,239 INFO L146 ILogger]: Start minimizeSevpa. Operand 122 states. [2019-05-23 09:22:18,241 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-05-23 09:22:18,241 INFO L146 ILogger]: Start removeUnreachable. Operand 121 states. [2019-05-23 09:22:18,241 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 121 states to 121 states and 150 transitions. [2019-05-23 09:22:18,241 INFO L146 ILogger]: Start accepts. Automaton has 121 states and 150 transitions. Word has length 88 [2019-05-23 09:22:18,242 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:18,242 INFO L146 ILogger]: Abstraction has 121 states and 150 transitions. [2019-05-23 09:22:18,242 INFO L146 ILogger]: Interpolant automaton has 31 states. [2019-05-23 09:22:18,242 INFO L146 ILogger]: Start isEmpty. Operand 121 states and 150 transitions. [2019-05-23 09:22:18,243 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 92 [2019-05-23 09:22:18,243 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:18,243 INFO L146 ILogger]: trace histogram [29, 29, 29, 1, 1, 1, 1] [2019-05-23 09:22:18,243 INFO L146 ILogger]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:18,243 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:18,243 INFO L146 ILogger]: Analyzing trace with hash -584151573, now seen corresponding path program 29 times [2019-05-23 09:22:18,244 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:18,251 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:18,252 INFO L146 ILogger]: Trace formula consists of 124 conjuncts, 31 conjunts are in the unsatisfiable core [2019-05-23 09:22:18,254 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:18,620 INFO L146 ILogger]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:18,621 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:18,621 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-05-23 09:22:18,621 INFO L146 ILogger]: Interpolant automaton has 32 states [2019-05-23 09:22:18,621 INFO L146 ILogger]: Constructing interpolant automaton starting with 32 interpolants. [2019-05-23 09:22:18,622 INFO L146 ILogger]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-05-23 09:22:18,622 INFO L146 ILogger]: Start difference. First operand 121 states and 150 transitions. Second operand 32 states. [2019-05-23 09:22:18,780 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:18,781 INFO L146 ILogger]: Finished difference Result 126 states and 156 transitions. [2019-05-23 09:22:18,781 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-05-23 09:22:18,781 INFO L146 ILogger]: Start accepts. Automaton has 32 states. Word has length 91 [2019-05-23 09:22:18,781 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:18,782 INFO L146 ILogger]: With dead ends: 126 [2019-05-23 09:22:18,782 INFO L146 ILogger]: Without dead ends: 126 [2019-05-23 09:22:18,783 INFO L146 ILogger]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-05-23 09:22:18,784 INFO L146 ILogger]: Start minimizeSevpa. Operand 126 states. [2019-05-23 09:22:18,786 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-05-23 09:22:18,786 INFO L146 ILogger]: Start removeUnreachable. Operand 125 states. [2019-05-23 09:22:18,787 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2019-05-23 09:22:18,787 INFO L146 ILogger]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 91 [2019-05-23 09:22:18,787 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:18,787 INFO L146 ILogger]: Abstraction has 125 states and 155 transitions. [2019-05-23 09:22:18,787 INFO L146 ILogger]: Interpolant automaton has 32 states. [2019-05-23 09:22:18,787 INFO L146 ILogger]: Start isEmpty. Operand 125 states and 155 transitions. [2019-05-23 09:22:18,788 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 95 [2019-05-23 09:22:18,788 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:18,788 INFO L146 ILogger]: trace histogram [30, 30, 30, 1, 1, 1, 1] [2019-05-23 09:22:18,789 INFO L146 ILogger]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:18,789 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:18,789 INFO L146 ILogger]: Analyzing trace with hash 738452003, now seen corresponding path program 30 times [2019-05-23 09:22:18,790 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:18,798 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:18,799 INFO L146 ILogger]: Trace formula consists of 128 conjuncts, 32 conjunts are in the unsatisfiable core [2019-05-23 09:22:18,801 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:19,314 INFO L146 ILogger]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:19,315 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:19,315 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-05-23 09:22:19,315 INFO L146 ILogger]: Interpolant automaton has 33 states [2019-05-23 09:22:19,315 INFO L146 ILogger]: Constructing interpolant automaton starting with 33 interpolants. [2019-05-23 09:22:19,316 INFO L146 ILogger]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:22:19,316 INFO L146 ILogger]: Start difference. First operand 125 states and 155 transitions. Second operand 33 states. [2019-05-23 09:22:19,458 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:19,458 INFO L146 ILogger]: Finished difference Result 130 states and 161 transitions. [2019-05-23 09:22:19,459 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-05-23 09:22:19,459 INFO L146 ILogger]: Start accepts. Automaton has 33 states. Word has length 94 [2019-05-23 09:22:19,459 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:19,460 INFO L146 ILogger]: With dead ends: 130 [2019-05-23 09:22:19,460 INFO L146 ILogger]: Without dead ends: 130 [2019-05-23 09:22:19,461 INFO L146 ILogger]: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:22:19,461 INFO L146 ILogger]: Start minimizeSevpa. Operand 130 states. [2019-05-23 09:22:19,464 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-05-23 09:22:19,464 INFO L146 ILogger]: Start removeUnreachable. Operand 129 states. [2019-05-23 09:22:19,464 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 129 states to 129 states and 160 transitions. [2019-05-23 09:22:19,465 INFO L146 ILogger]: Start accepts. Automaton has 129 states and 160 transitions. Word has length 94 [2019-05-23 09:22:19,465 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:19,465 INFO L146 ILogger]: Abstraction has 129 states and 160 transitions. [2019-05-23 09:22:19,465 INFO L146 ILogger]: Interpolant automaton has 33 states. [2019-05-23 09:22:19,465 INFO L146 ILogger]: Start isEmpty. Operand 129 states and 160 transitions. [2019-05-23 09:22:19,466 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 98 [2019-05-23 09:22:19,466 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:19,466 INFO L146 ILogger]: trace histogram [31, 31, 31, 1, 1, 1, 1] [2019-05-23 09:22:19,466 INFO L146 ILogger]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:19,466 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:19,466 INFO L146 ILogger]: Analyzing trace with hash 391611115, now seen corresponding path program 31 times [2019-05-23 09:22:19,467 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:19,475 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:19,476 INFO L146 ILogger]: Trace formula consists of 132 conjuncts, 33 conjunts are in the unsatisfiable core [2019-05-23 09:22:19,478 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:19,899 INFO L146 ILogger]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:19,899 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:19,900 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-05-23 09:22:19,900 INFO L146 ILogger]: Interpolant automaton has 34 states [2019-05-23 09:22:19,900 INFO L146 ILogger]: Constructing interpolant automaton starting with 34 interpolants. [2019-05-23 09:22:19,901 INFO L146 ILogger]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 09:22:19,901 INFO L146 ILogger]: Start difference. First operand 129 states and 160 transitions. Second operand 34 states. [2019-05-23 09:22:20,004 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:20,005 INFO L146 ILogger]: Finished difference Result 134 states and 166 transitions. [2019-05-23 09:22:20,005 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-05-23 09:22:20,005 INFO L146 ILogger]: Start accepts. Automaton has 34 states. Word has length 97 [2019-05-23 09:22:20,006 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:20,007 INFO L146 ILogger]: With dead ends: 134 [2019-05-23 09:22:20,007 INFO L146 ILogger]: Without dead ends: 134 [2019-05-23 09:22:20,008 INFO L146 ILogger]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 09:22:20,009 INFO L146 ILogger]: Start minimizeSevpa. Operand 134 states. [2019-05-23 09:22:20,011 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-05-23 09:22:20,011 INFO L146 ILogger]: Start removeUnreachable. Operand 133 states. [2019-05-23 09:22:20,012 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 133 states to 133 states and 165 transitions. [2019-05-23 09:22:20,012 INFO L146 ILogger]: Start accepts. Automaton has 133 states and 165 transitions. Word has length 97 [2019-05-23 09:22:20,012 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:20,012 INFO L146 ILogger]: Abstraction has 133 states and 165 transitions. [2019-05-23 09:22:20,012 INFO L146 ILogger]: Interpolant automaton has 34 states. [2019-05-23 09:22:20,012 INFO L146 ILogger]: Start isEmpty. Operand 133 states and 165 transitions. [2019-05-23 09:22:20,013 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 101 [2019-05-23 09:22:20,013 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:20,013 INFO L146 ILogger]: trace histogram [32, 32, 32, 1, 1, 1, 1] [2019-05-23 09:22:20,013 INFO L146 ILogger]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:20,014 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:20,014 INFO L146 ILogger]: Analyzing trace with hash 1346030883, now seen corresponding path program 32 times [2019-05-23 09:22:20,014 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:20,022 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:20,023 INFO L146 ILogger]: Trace formula consists of 136 conjuncts, 34 conjunts are in the unsatisfiable core [2019-05-23 09:22:20,025 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:20,536 INFO L146 ILogger]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:20,536 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:20,536 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-05-23 09:22:20,537 INFO L146 ILogger]: Interpolant automaton has 35 states [2019-05-23 09:22:20,537 INFO L146 ILogger]: Constructing interpolant automaton starting with 35 interpolants. [2019-05-23 09:22:20,538 INFO L146 ILogger]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:20,538 INFO L146 ILogger]: Start difference. First operand 133 states and 165 transitions. Second operand 35 states. [2019-05-23 09:22:20,686 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:20,686 INFO L146 ILogger]: Finished difference Result 138 states and 171 transitions. [2019-05-23 09:22:20,686 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-05-23 09:22:20,687 INFO L146 ILogger]: Start accepts. Automaton has 35 states. Word has length 100 [2019-05-23 09:22:20,687 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:20,688 INFO L146 ILogger]: With dead ends: 138 [2019-05-23 09:22:20,688 INFO L146 ILogger]: Without dead ends: 138 [2019-05-23 09:22:20,689 INFO L146 ILogger]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:20,690 INFO L146 ILogger]: Start minimizeSevpa. Operand 138 states. [2019-05-23 09:22:20,692 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-05-23 09:22:20,692 INFO L146 ILogger]: Start removeUnreachable. Operand 137 states. [2019-05-23 09:22:20,693 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2019-05-23 09:22:20,693 INFO L146 ILogger]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 100 [2019-05-23 09:22:20,693 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:20,693 INFO L146 ILogger]: Abstraction has 137 states and 170 transitions. [2019-05-23 09:22:20,693 INFO L146 ILogger]: Interpolant automaton has 35 states. [2019-05-23 09:22:20,693 INFO L146 ILogger]: Start isEmpty. Operand 137 states and 170 transitions. [2019-05-23 09:22:20,694 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 104 [2019-05-23 09:22:20,694 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:20,694 INFO L146 ILogger]: trace histogram [33, 33, 33, 1, 1, 1, 1] [2019-05-23 09:22:20,695 INFO L146 ILogger]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:20,695 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:20,695 INFO L146 ILogger]: Analyzing trace with hash 1781839851, now seen corresponding path program 33 times [2019-05-23 09:22:20,696 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:20,704 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:20,706 INFO L146 ILogger]: Trace formula consists of 140 conjuncts, 35 conjunts are in the unsatisfiable core [2019-05-23 09:22:20,707 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:21,840 INFO L146 ILogger]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:21,841 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:21,841 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-05-23 09:22:21,841 INFO L146 ILogger]: Interpolant automaton has 36 states [2019-05-23 09:22:21,842 INFO L146 ILogger]: Constructing interpolant automaton starting with 36 interpolants. [2019-05-23 09:22:21,842 INFO L146 ILogger]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 09:22:21,842 INFO L146 ILogger]: Start difference. First operand 137 states and 170 transitions. Second operand 36 states. [2019-05-23 09:22:22,175 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:22,175 INFO L146 ILogger]: Finished difference Result 142 states and 176 transitions. [2019-05-23 09:22:22,176 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-23 09:22:22,176 INFO L146 ILogger]: Start accepts. Automaton has 36 states. Word has length 103 [2019-05-23 09:22:22,176 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:22,177 INFO L146 ILogger]: With dead ends: 142 [2019-05-23 09:22:22,178 INFO L146 ILogger]: Without dead ends: 142 [2019-05-23 09:22:22,178 INFO L146 ILogger]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 09:22:22,179 INFO L146 ILogger]: Start minimizeSevpa. Operand 142 states. [2019-05-23 09:22:22,182 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-05-23 09:22:22,182 INFO L146 ILogger]: Start removeUnreachable. Operand 141 states. [2019-05-23 09:22:22,183 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 141 states to 141 states and 175 transitions. [2019-05-23 09:22:22,183 INFO L146 ILogger]: Start accepts. Automaton has 141 states and 175 transitions. Word has length 103 [2019-05-23 09:22:22,183 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:22,183 INFO L146 ILogger]: Abstraction has 141 states and 175 transitions. [2019-05-23 09:22:22,183 INFO L146 ILogger]: Interpolant automaton has 36 states. [2019-05-23 09:22:22,184 INFO L146 ILogger]: Start isEmpty. Operand 141 states and 175 transitions. [2019-05-23 09:22:22,184 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 107 [2019-05-23 09:22:22,184 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:22,184 INFO L146 ILogger]: trace histogram [34, 34, 34, 1, 1, 1, 1] [2019-05-23 09:22:22,185 INFO L146 ILogger]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:22,185 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:22,185 INFO L146 ILogger]: Analyzing trace with hash 1280669731, now seen corresponding path program 34 times [2019-05-23 09:22:22,186 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:22,196 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:22,197 INFO L146 ILogger]: Trace formula consists of 144 conjuncts, 36 conjunts are in the unsatisfiable core [2019-05-23 09:22:22,199 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:23,263 INFO L146 ILogger]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:23,263 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:23,263 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-05-23 09:22:23,264 INFO L146 ILogger]: Interpolant automaton has 37 states [2019-05-23 09:22:23,264 INFO L146 ILogger]: Constructing interpolant automaton starting with 37 interpolants. [2019-05-23 09:22:23,264 INFO L146 ILogger]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:22:23,264 INFO L146 ILogger]: Start difference. First operand 141 states and 175 transitions. Second operand 37 states. [2019-05-23 09:22:23,379 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:23,380 INFO L146 ILogger]: Finished difference Result 146 states and 181 transitions. [2019-05-23 09:22:23,380 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-05-23 09:22:23,380 INFO L146 ILogger]: Start accepts. Automaton has 37 states. Word has length 106 [2019-05-23 09:22:23,381 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:23,381 INFO L146 ILogger]: With dead ends: 146 [2019-05-23 09:22:23,382 INFO L146 ILogger]: Without dead ends: 146 [2019-05-23 09:22:23,382 INFO L146 ILogger]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:22:23,383 INFO L146 ILogger]: Start minimizeSevpa. Operand 146 states. [2019-05-23 09:22:23,385 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-05-23 09:22:23,385 INFO L146 ILogger]: Start removeUnreachable. Operand 145 states. [2019-05-23 09:22:23,385 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 145 states to 145 states and 180 transitions. [2019-05-23 09:22:23,385 INFO L146 ILogger]: Start accepts. Automaton has 145 states and 180 transitions. Word has length 106 [2019-05-23 09:22:23,386 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:23,386 INFO L146 ILogger]: Abstraction has 145 states and 180 transitions. [2019-05-23 09:22:23,386 INFO L146 ILogger]: Interpolant automaton has 37 states. [2019-05-23 09:22:23,386 INFO L146 ILogger]: Start isEmpty. Operand 145 states and 180 transitions. [2019-05-23 09:22:23,387 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 110 [2019-05-23 09:22:23,387 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:23,387 INFO L146 ILogger]: trace histogram [35, 35, 35, 1, 1, 1, 1] [2019-05-23 09:22:23,387 INFO L146 ILogger]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:23,387 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:23,387 INFO L146 ILogger]: Analyzing trace with hash 227945707, now seen corresponding path program 35 times [2019-05-23 09:22:23,388 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:23,396 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:23,397 INFO L146 ILogger]: Trace formula consists of 148 conjuncts, 37 conjunts are in the unsatisfiable core [2019-05-23 09:22:23,399 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:23,892 INFO L146 ILogger]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:23,893 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:23,893 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-05-23 09:22:23,893 INFO L146 ILogger]: Interpolant automaton has 38 states [2019-05-23 09:22:23,893 INFO L146 ILogger]: Constructing interpolant automaton starting with 38 interpolants. [2019-05-23 09:22:23,894 INFO L146 ILogger]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 09:22:23,894 INFO L146 ILogger]: Start difference. First operand 145 states and 180 transitions. Second operand 38 states. [2019-05-23 09:22:24,490 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:24,491 INFO L146 ILogger]: Finished difference Result 150 states and 186 transitions. [2019-05-23 09:22:24,491 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-05-23 09:22:24,491 INFO L146 ILogger]: Start accepts. Automaton has 38 states. Word has length 109 [2019-05-23 09:22:24,492 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:24,493 INFO L146 ILogger]: With dead ends: 150 [2019-05-23 09:22:24,493 INFO L146 ILogger]: Without dead ends: 150 [2019-05-23 09:22:24,494 INFO L146 ILogger]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 09:22:24,494 INFO L146 ILogger]: Start minimizeSevpa. Operand 150 states. [2019-05-23 09:22:24,497 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-05-23 09:22:24,497 INFO L146 ILogger]: Start removeUnreachable. Operand 149 states. [2019-05-23 09:22:24,498 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 149 states to 149 states and 185 transitions. [2019-05-23 09:22:24,498 INFO L146 ILogger]: Start accepts. Automaton has 149 states and 185 transitions. Word has length 109 [2019-05-23 09:22:24,498 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:24,499 INFO L146 ILogger]: Abstraction has 149 states and 185 transitions. [2019-05-23 09:22:24,499 INFO L146 ILogger]: Interpolant automaton has 38 states. [2019-05-23 09:22:24,514 INFO L146 ILogger]: Start isEmpty. Operand 149 states and 185 transitions. [2019-05-23 09:22:24,515 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 113 [2019-05-23 09:22:24,515 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:24,515 INFO L146 ILogger]: trace histogram [36, 36, 36, 1, 1, 1, 1] [2019-05-23 09:22:24,516 INFO L146 ILogger]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:24,516 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:24,516 INFO L146 ILogger]: Analyzing trace with hash 377742115, now seen corresponding path program 36 times [2019-05-23 09:22:24,517 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:24,527 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:24,528 INFO L146 ILogger]: Trace formula consists of 152 conjuncts, 38 conjunts are in the unsatisfiable core [2019-05-23 09:22:24,529 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:25,809 INFO L146 ILogger]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:25,810 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:25,810 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-05-23 09:22:25,810 INFO L146 ILogger]: Interpolant automaton has 39 states [2019-05-23 09:22:25,811 INFO L146 ILogger]: Constructing interpolant automaton starting with 39 interpolants. [2019-05-23 09:22:25,811 INFO L146 ILogger]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:25,811 INFO L146 ILogger]: Start difference. First operand 149 states and 185 transitions. Second operand 39 states. [2019-05-23 09:22:25,941 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:25,941 INFO L146 ILogger]: Finished difference Result 154 states and 191 transitions. [2019-05-23 09:22:25,942 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-05-23 09:22:25,942 INFO L146 ILogger]: Start accepts. Automaton has 39 states. Word has length 112 [2019-05-23 09:22:25,942 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:25,943 INFO L146 ILogger]: With dead ends: 154 [2019-05-23 09:22:25,943 INFO L146 ILogger]: Without dead ends: 154 [2019-05-23 09:22:25,944 INFO L146 ILogger]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:25,945 INFO L146 ILogger]: Start minimizeSevpa. Operand 154 states. [2019-05-23 09:22:25,947 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-05-23 09:22:25,948 INFO L146 ILogger]: Start removeUnreachable. Operand 153 states. [2019-05-23 09:22:25,948 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 153 states to 153 states and 190 transitions. [2019-05-23 09:22:25,948 INFO L146 ILogger]: Start accepts. Automaton has 153 states and 190 transitions. Word has length 112 [2019-05-23 09:22:25,949 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:25,949 INFO L146 ILogger]: Abstraction has 153 states and 190 transitions. [2019-05-23 09:22:25,949 INFO L146 ILogger]: Interpolant automaton has 39 states. [2019-05-23 09:22:25,949 INFO L146 ILogger]: Start isEmpty. Operand 153 states and 190 transitions. [2019-05-23 09:22:25,949 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 116 [2019-05-23 09:22:25,950 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:25,950 INFO L146 ILogger]: trace histogram [37, 37, 37, 1, 1, 1, 1] [2019-05-23 09:22:25,950 INFO L146 ILogger]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:25,950 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:25,950 INFO L146 ILogger]: Analyzing trace with hash 491512299, now seen corresponding path program 37 times [2019-05-23 09:22:25,951 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:25,961 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:25,962 INFO L146 ILogger]: Trace formula consists of 156 conjuncts, 39 conjunts are in the unsatisfiable core [2019-05-23 09:22:25,964 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:26,838 INFO L146 ILogger]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:26,838 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:26,838 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-05-23 09:22:26,838 INFO L146 ILogger]: Interpolant automaton has 40 states [2019-05-23 09:22:26,839 INFO L146 ILogger]: Constructing interpolant automaton starting with 40 interpolants. [2019-05-23 09:22:26,839 INFO L146 ILogger]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 09:22:26,839 INFO L146 ILogger]: Start difference. First operand 153 states and 190 transitions. Second operand 40 states. [2019-05-23 09:22:26,964 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:26,964 INFO L146 ILogger]: Finished difference Result 158 states and 196 transitions. [2019-05-23 09:22:26,964 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-05-23 09:22:26,965 INFO L146 ILogger]: Start accepts. Automaton has 40 states. Word has length 115 [2019-05-23 09:22:26,965 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:26,966 INFO L146 ILogger]: With dead ends: 158 [2019-05-23 09:22:26,966 INFO L146 ILogger]: Without dead ends: 158 [2019-05-23 09:22:26,967 INFO L146 ILogger]: 0 DeclaredPredicates, 114 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 09:22:26,968 INFO L146 ILogger]: Start minimizeSevpa. Operand 158 states. [2019-05-23 09:22:26,970 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-05-23 09:22:26,970 INFO L146 ILogger]: Start removeUnreachable. Operand 157 states. [2019-05-23 09:22:26,971 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2019-05-23 09:22:26,971 INFO L146 ILogger]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 115 [2019-05-23 09:22:26,971 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:26,971 INFO L146 ILogger]: Abstraction has 157 states and 195 transitions. [2019-05-23 09:22:26,972 INFO L146 ILogger]: Interpolant automaton has 40 states. [2019-05-23 09:22:26,972 INFO L146 ILogger]: Start isEmpty. Operand 157 states and 195 transitions. [2019-05-23 09:22:26,972 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 119 [2019-05-23 09:22:26,972 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:26,973 INFO L146 ILogger]: trace histogram [38, 38, 38, 1, 1, 1, 1] [2019-05-23 09:22:26,973 INFO L146 ILogger]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:26,973 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:26,973 INFO L146 ILogger]: Analyzing trace with hash 1089867299, now seen corresponding path program 38 times [2019-05-23 09:22:26,974 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:26,983 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:26,984 INFO L146 ILogger]: Trace formula consists of 160 conjuncts, 40 conjunts are in the unsatisfiable core [2019-05-23 09:22:26,986 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:27,582 INFO L146 ILogger]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:27,582 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:27,582 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-05-23 09:22:27,582 INFO L146 ILogger]: Interpolant automaton has 41 states [2019-05-23 09:22:27,583 INFO L146 ILogger]: Constructing interpolant automaton starting with 41 interpolants. [2019-05-23 09:22:27,583 INFO L146 ILogger]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:22:27,583 INFO L146 ILogger]: Start difference. First operand 157 states and 195 transitions. Second operand 41 states. [2019-05-23 09:22:27,794 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:27,795 INFO L146 ILogger]: Finished difference Result 162 states and 201 transitions. [2019-05-23 09:22:27,795 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-05-23 09:22:27,795 INFO L146 ILogger]: Start accepts. Automaton has 41 states. Word has length 118 [2019-05-23 09:22:27,796 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:27,797 INFO L146 ILogger]: With dead ends: 162 [2019-05-23 09:22:27,797 INFO L146 ILogger]: Without dead ends: 162 [2019-05-23 09:22:27,798 INFO L146 ILogger]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:22:27,799 INFO L146 ILogger]: Start minimizeSevpa. Operand 162 states. [2019-05-23 09:22:27,801 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-05-23 09:22:27,801 INFO L146 ILogger]: Start removeUnreachable. Operand 161 states. [2019-05-23 09:22:27,802 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 161 states to 161 states and 200 transitions. [2019-05-23 09:22:27,802 INFO L146 ILogger]: Start accepts. Automaton has 161 states and 200 transitions. Word has length 118 [2019-05-23 09:22:27,802 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:27,802 INFO L146 ILogger]: Abstraction has 161 states and 200 transitions. [2019-05-23 09:22:27,802 INFO L146 ILogger]: Interpolant automaton has 41 states. [2019-05-23 09:22:27,802 INFO L146 ILogger]: Start isEmpty. Operand 161 states and 200 transitions. [2019-05-23 09:22:27,803 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 122 [2019-05-23 09:22:27,803 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:27,803 INFO L146 ILogger]: trace histogram [39, 39, 39, 1, 1, 1, 1] [2019-05-23 09:22:27,803 INFO L146 ILogger]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:27,804 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:27,804 INFO L146 ILogger]: Analyzing trace with hash -1725573397, now seen corresponding path program 39 times [2019-05-23 09:22:27,804 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:27,814 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:27,815 INFO L146 ILogger]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2019-05-23 09:22:27,817 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:28,497 INFO L146 ILogger]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:28,498 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:28,498 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-05-23 09:22:28,498 INFO L146 ILogger]: Interpolant automaton has 42 states [2019-05-23 09:22:28,498 INFO L146 ILogger]: Constructing interpolant automaton starting with 42 interpolants. [2019-05-23 09:22:28,499 INFO L146 ILogger]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 09:22:28,499 INFO L146 ILogger]: Start difference. First operand 161 states and 200 transitions. Second operand 42 states. [2019-05-23 09:22:28,869 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:28,869 INFO L146 ILogger]: Finished difference Result 166 states and 206 transitions. [2019-05-23 09:22:28,869 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-23 09:22:28,870 INFO L146 ILogger]: Start accepts. Automaton has 42 states. Word has length 121 [2019-05-23 09:22:28,870 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:28,871 INFO L146 ILogger]: With dead ends: 166 [2019-05-23 09:22:28,871 INFO L146 ILogger]: Without dead ends: 166 [2019-05-23 09:22:28,873 INFO L146 ILogger]: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 09:22:28,873 INFO L146 ILogger]: Start minimizeSevpa. Operand 166 states. [2019-05-23 09:22:28,875 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-05-23 09:22:28,875 INFO L146 ILogger]: Start removeUnreachable. Operand 165 states. [2019-05-23 09:22:28,877 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 165 states to 165 states and 205 transitions. [2019-05-23 09:22:28,877 INFO L146 ILogger]: Start accepts. Automaton has 165 states and 205 transitions. Word has length 121 [2019-05-23 09:22:28,877 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:28,877 INFO L146 ILogger]: Abstraction has 165 states and 205 transitions. [2019-05-23 09:22:28,877 INFO L146 ILogger]: Interpolant automaton has 42 states. [2019-05-23 09:22:28,877 INFO L146 ILogger]: Start isEmpty. Operand 165 states and 205 transitions. [2019-05-23 09:22:28,878 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 125 [2019-05-23 09:22:28,878 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:28,878 INFO L146 ILogger]: trace histogram [40, 40, 40, 1, 1, 1, 1] [2019-05-23 09:22:28,878 INFO L146 ILogger]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:28,879 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:28,879 INFO L146 ILogger]: Analyzing trace with hash -103024349, now seen corresponding path program 40 times [2019-05-23 09:22:28,879 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:28,889 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:28,890 INFO L146 ILogger]: Trace formula consists of 168 conjuncts, 42 conjunts are in the unsatisfiable core [2019-05-23 09:22:28,892 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:29,535 INFO L146 ILogger]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:29,535 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:29,535 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-05-23 09:22:29,536 INFO L146 ILogger]: Interpolant automaton has 43 states [2019-05-23 09:22:29,536 INFO L146 ILogger]: Constructing interpolant automaton starting with 43 interpolants. [2019-05-23 09:22:29,536 INFO L146 ILogger]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:22:29,537 INFO L146 ILogger]: Start difference. First operand 165 states and 205 transitions. Second operand 43 states. [2019-05-23 09:22:29,678 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:29,679 INFO L146 ILogger]: Finished difference Result 170 states and 211 transitions. [2019-05-23 09:22:29,679 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-05-23 09:22:29,679 INFO L146 ILogger]: Start accepts. Automaton has 43 states. Word has length 124 [2019-05-23 09:22:29,680 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:29,681 INFO L146 ILogger]: With dead ends: 170 [2019-05-23 09:22:29,681 INFO L146 ILogger]: Without dead ends: 170 [2019-05-23 09:22:29,682 INFO L146 ILogger]: 0 DeclaredPredicates, 123 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:22:29,683 INFO L146 ILogger]: Start minimizeSevpa. Operand 170 states. [2019-05-23 09:22:29,685 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-05-23 09:22:29,685 INFO L146 ILogger]: Start removeUnreachable. Operand 169 states. [2019-05-23 09:22:29,686 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 169 states to 169 states and 210 transitions. [2019-05-23 09:22:29,686 INFO L146 ILogger]: Start accepts. Automaton has 169 states and 210 transitions. Word has length 124 [2019-05-23 09:22:29,686 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:29,686 INFO L146 ILogger]: Abstraction has 169 states and 210 transitions. [2019-05-23 09:22:29,686 INFO L146 ILogger]: Interpolant automaton has 43 states. [2019-05-23 09:22:29,687 INFO L146 ILogger]: Start isEmpty. Operand 169 states and 210 transitions. [2019-05-23 09:22:29,687 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 128 [2019-05-23 09:22:29,687 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:29,688 INFO L146 ILogger]: trace histogram [41, 41, 41, 1, 1, 1, 1] [2019-05-23 09:22:29,688 INFO L146 ILogger]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:29,688 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:29,688 INFO L146 ILogger]: Analyzing trace with hash 1693715435, now seen corresponding path program 41 times [2019-05-23 09:22:29,689 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:29,698 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:29,700 INFO L146 ILogger]: Trace formula consists of 172 conjuncts, 43 conjunts are in the unsatisfiable core [2019-05-23 09:22:29,702 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:30,638 INFO L146 ILogger]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:30,638 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:30,638 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-05-23 09:22:30,638 INFO L146 ILogger]: Interpolant automaton has 44 states [2019-05-23 09:22:30,639 INFO L146 ILogger]: Constructing interpolant automaton starting with 44 interpolants. [2019-05-23 09:22:30,640 INFO L146 ILogger]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 09:22:30,640 INFO L146 ILogger]: Start difference. First operand 169 states and 210 transitions. Second operand 44 states. [2019-05-23 09:22:30,776 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:30,777 INFO L146 ILogger]: Finished difference Result 174 states and 216 transitions. [2019-05-23 09:22:30,777 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-05-23 09:22:30,777 INFO L146 ILogger]: Start accepts. Automaton has 44 states. Word has length 127 [2019-05-23 09:22:30,778 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:30,779 INFO L146 ILogger]: With dead ends: 174 [2019-05-23 09:22:30,779 INFO L146 ILogger]: Without dead ends: 174 [2019-05-23 09:22:30,780 INFO L146 ILogger]: 0 DeclaredPredicates, 126 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 09:22:30,780 INFO L146 ILogger]: Start minimizeSevpa. Operand 174 states. [2019-05-23 09:22:30,783 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-05-23 09:22:30,783 INFO L146 ILogger]: Start removeUnreachable. Operand 173 states. [2019-05-23 09:22:30,784 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 173 states to 173 states and 215 transitions. [2019-05-23 09:22:30,784 INFO L146 ILogger]: Start accepts. Automaton has 173 states and 215 transitions. Word has length 127 [2019-05-23 09:22:30,784 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:30,784 INFO L146 ILogger]: Abstraction has 173 states and 215 transitions. [2019-05-23 09:22:30,784 INFO L146 ILogger]: Interpolant automaton has 44 states. [2019-05-23 09:22:30,784 INFO L146 ILogger]: Start isEmpty. Operand 173 states and 215 transitions. [2019-05-23 09:22:30,785 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 131 [2019-05-23 09:22:30,785 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:30,785 INFO L146 ILogger]: trace histogram [42, 42, 42, 1, 1, 1, 1] [2019-05-23 09:22:30,785 INFO L146 ILogger]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:30,786 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:30,786 INFO L146 ILogger]: Analyzing trace with hash 191210531, now seen corresponding path program 42 times [2019-05-23 09:22:30,787 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:30,797 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:30,798 INFO L146 ILogger]: Trace formula consists of 176 conjuncts, 44 conjunts are in the unsatisfiable core [2019-05-23 09:22:30,800 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:31,892 INFO L146 ILogger]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:31,892 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:31,892 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-05-23 09:22:31,893 INFO L146 ILogger]: Interpolant automaton has 45 states [2019-05-23 09:22:31,893 INFO L146 ILogger]: Constructing interpolant automaton starting with 45 interpolants. [2019-05-23 09:22:31,893 INFO L146 ILogger]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:22:31,894 INFO L146 ILogger]: Start difference. First operand 173 states and 215 transitions. Second operand 45 states. [2019-05-23 09:22:32,038 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:32,038 INFO L146 ILogger]: Finished difference Result 178 states and 221 transitions. [2019-05-23 09:22:32,038 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-05-23 09:22:32,038 INFO L146 ILogger]: Start accepts. Automaton has 45 states. Word has length 130 [2019-05-23 09:22:32,039 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:32,040 INFO L146 ILogger]: With dead ends: 178 [2019-05-23 09:22:32,041 INFO L146 ILogger]: Without dead ends: 178 [2019-05-23 09:22:32,042 INFO L146 ILogger]: 0 DeclaredPredicates, 129 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:22:32,043 INFO L146 ILogger]: Start minimizeSevpa. Operand 178 states. [2019-05-23 09:22:32,045 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-05-23 09:22:32,045 INFO L146 ILogger]: Start removeUnreachable. Operand 177 states. [2019-05-23 09:22:32,046 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 177 states to 177 states and 220 transitions. [2019-05-23 09:22:32,046 INFO L146 ILogger]: Start accepts. Automaton has 177 states and 220 transitions. Word has length 130 [2019-05-23 09:22:32,046 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:32,046 INFO L146 ILogger]: Abstraction has 177 states and 220 transitions. [2019-05-23 09:22:32,046 INFO L146 ILogger]: Interpolant automaton has 45 states. [2019-05-23 09:22:32,047 INFO L146 ILogger]: Start isEmpty. Operand 177 states and 220 transitions. [2019-05-23 09:22:32,047 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 134 [2019-05-23 09:22:32,047 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:32,047 INFO L146 ILogger]: trace histogram [43, 43, 43, 1, 1, 1, 1] [2019-05-23 09:22:32,048 INFO L146 ILogger]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:32,048 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:32,048 INFO L146 ILogger]: Analyzing trace with hash 1216774379, now seen corresponding path program 43 times [2019-05-23 09:22:32,049 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:32,059 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:32,060 INFO L146 ILogger]: Trace formula consists of 180 conjuncts, 45 conjunts are in the unsatisfiable core [2019-05-23 09:22:32,062 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:32,893 INFO L146 ILogger]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:32,893 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:32,893 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-05-23 09:22:32,894 INFO L146 ILogger]: Interpolant automaton has 46 states [2019-05-23 09:22:32,894 INFO L146 ILogger]: Constructing interpolant automaton starting with 46 interpolants. [2019-05-23 09:22:32,894 INFO L146 ILogger]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 09:22:32,895 INFO L146 ILogger]: Start difference. First operand 177 states and 220 transitions. Second operand 46 states. [2019-05-23 09:22:33,050 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:33,050 INFO L146 ILogger]: Finished difference Result 182 states and 226 transitions. [2019-05-23 09:22:33,051 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-05-23 09:22:33,051 INFO L146 ILogger]: Start accepts. Automaton has 46 states. Word has length 133 [2019-05-23 09:22:33,051 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:33,052 INFO L146 ILogger]: With dead ends: 182 [2019-05-23 09:22:33,053 INFO L146 ILogger]: Without dead ends: 182 [2019-05-23 09:22:33,053 INFO L146 ILogger]: 0 DeclaredPredicates, 132 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 09:22:33,054 INFO L146 ILogger]: Start minimizeSevpa. Operand 182 states. [2019-05-23 09:22:33,055 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-05-23 09:22:33,056 INFO L146 ILogger]: Start removeUnreachable. Operand 181 states. [2019-05-23 09:22:33,056 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 181 states to 181 states and 225 transitions. [2019-05-23 09:22:33,056 INFO L146 ILogger]: Start accepts. Automaton has 181 states and 225 transitions. Word has length 133 [2019-05-23 09:22:33,056 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:33,056 INFO L146 ILogger]: Abstraction has 181 states and 225 transitions. [2019-05-23 09:22:33,056 INFO L146 ILogger]: Interpolant automaton has 46 states. [2019-05-23 09:22:33,056 INFO L146 ILogger]: Start isEmpty. Operand 181 states and 225 transitions. [2019-05-23 09:22:33,057 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 137 [2019-05-23 09:22:33,057 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:33,057 INFO L146 ILogger]: trace histogram [44, 44, 44, 1, 1, 1, 1] [2019-05-23 09:22:33,057 INFO L146 ILogger]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:33,057 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:33,058 INFO L146 ILogger]: Analyzing trace with hash -607973597, now seen corresponding path program 44 times [2019-05-23 09:22:33,058 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:33,068 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:33,069 INFO L146 ILogger]: Trace formula consists of 184 conjuncts, 46 conjunts are in the unsatisfiable core [2019-05-23 09:22:33,071 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:33,856 INFO L146 ILogger]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:33,856 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:33,856 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-05-23 09:22:33,856 INFO L146 ILogger]: Interpolant automaton has 47 states [2019-05-23 09:22:33,857 INFO L146 ILogger]: Constructing interpolant automaton starting with 47 interpolants. [2019-05-23 09:22:33,857 INFO L146 ILogger]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:22:33,857 INFO L146 ILogger]: Start difference. First operand 181 states and 225 transitions. Second operand 47 states. [2019-05-23 09:22:34,036 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:34,036 INFO L146 ILogger]: Finished difference Result 186 states and 231 transitions. [2019-05-23 09:22:34,036 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-05-23 09:22:34,037 INFO L146 ILogger]: Start accepts. Automaton has 47 states. Word has length 136 [2019-05-23 09:22:34,037 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:34,038 INFO L146 ILogger]: With dead ends: 186 [2019-05-23 09:22:34,038 INFO L146 ILogger]: Without dead ends: 186 [2019-05-23 09:22:34,039 INFO L146 ILogger]: 0 DeclaredPredicates, 135 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:22:34,039 INFO L146 ILogger]: Start minimizeSevpa. Operand 186 states. [2019-05-23 09:22:34,041 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-05-23 09:22:34,041 INFO L146 ILogger]: Start removeUnreachable. Operand 185 states. [2019-05-23 09:22:34,042 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 185 states to 185 states and 230 transitions. [2019-05-23 09:22:34,042 INFO L146 ILogger]: Start accepts. Automaton has 185 states and 230 transitions. Word has length 136 [2019-05-23 09:22:34,042 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:34,042 INFO L146 ILogger]: Abstraction has 185 states and 230 transitions. [2019-05-23 09:22:34,042 INFO L146 ILogger]: Interpolant automaton has 47 states. [2019-05-23 09:22:34,042 INFO L146 ILogger]: Start isEmpty. Operand 185 states and 230 transitions. [2019-05-23 09:22:34,043 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 140 [2019-05-23 09:22:34,043 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:34,043 INFO L146 ILogger]: trace histogram [45, 45, 45, 1, 1, 1, 1] [2019-05-23 09:22:34,043 INFO L146 ILogger]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:34,043 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:34,043 INFO L146 ILogger]: Analyzing trace with hash -273861141, now seen corresponding path program 45 times [2019-05-23 09:22:34,044 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:34,053 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:34,055 INFO L146 ILogger]: Trace formula consists of 188 conjuncts, 47 conjunts are in the unsatisfiable core [2019-05-23 09:22:34,057 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:35,021 INFO L146 ILogger]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:35,021 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:35,021 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-05-23 09:22:35,022 INFO L146 ILogger]: Interpolant automaton has 48 states [2019-05-23 09:22:35,022 INFO L146 ILogger]: Constructing interpolant automaton starting with 48 interpolants. [2019-05-23 09:22:35,022 INFO L146 ILogger]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 09:22:35,022 INFO L146 ILogger]: Start difference. First operand 185 states and 230 transitions. Second operand 48 states. [2019-05-23 09:22:35,178 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:35,179 INFO L146 ILogger]: Finished difference Result 190 states and 236 transitions. [2019-05-23 09:22:35,179 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-23 09:22:35,179 INFO L146 ILogger]: Start accepts. Automaton has 48 states. Word has length 139 [2019-05-23 09:22:35,180 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:35,181 INFO L146 ILogger]: With dead ends: 190 [2019-05-23 09:22:35,181 INFO L146 ILogger]: Without dead ends: 190 [2019-05-23 09:22:35,181 INFO L146 ILogger]: 0 DeclaredPredicates, 138 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 09:22:35,182 INFO L146 ILogger]: Start minimizeSevpa. Operand 190 states. [2019-05-23 09:22:35,184 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-05-23 09:22:35,184 INFO L146 ILogger]: Start removeUnreachable. Operand 189 states. [2019-05-23 09:22:35,185 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 189 states to 189 states and 235 transitions. [2019-05-23 09:22:35,185 INFO L146 ILogger]: Start accepts. Automaton has 189 states and 235 transitions. Word has length 139 [2019-05-23 09:22:35,185 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:35,185 INFO L146 ILogger]: Abstraction has 189 states and 235 transitions. [2019-05-23 09:22:35,185 INFO L146 ILogger]: Interpolant automaton has 48 states. [2019-05-23 09:22:35,185 INFO L146 ILogger]: Start isEmpty. Operand 189 states and 235 transitions. [2019-05-23 09:22:35,186 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 143 [2019-05-23 09:22:35,186 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:35,186 INFO L146 ILogger]: trace histogram [46, 46, 46, 1, 1, 1, 1] [2019-05-23 09:22:35,186 INFO L146 ILogger]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:35,187 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:35,187 INFO L146 ILogger]: Analyzing trace with hash 1831090723, now seen corresponding path program 46 times [2019-05-23 09:22:35,187 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:35,197 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:35,198 INFO L146 ILogger]: Trace formula consists of 192 conjuncts, 48 conjunts are in the unsatisfiable core [2019-05-23 09:22:35,200 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:36,106 INFO L146 ILogger]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:36,106 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:36,106 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-05-23 09:22:36,107 INFO L146 ILogger]: Interpolant automaton has 49 states [2019-05-23 09:22:36,107 INFO L146 ILogger]: Constructing interpolant automaton starting with 49 interpolants. [2019-05-23 09:22:36,107 INFO L146 ILogger]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:22:36,107 INFO L146 ILogger]: Start difference. First operand 189 states and 235 transitions. Second operand 49 states. [2019-05-23 09:22:36,316 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:36,316 INFO L146 ILogger]: Finished difference Result 194 states and 241 transitions. [2019-05-23 09:22:36,316 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-05-23 09:22:36,316 INFO L146 ILogger]: Start accepts. Automaton has 49 states. Word has length 142 [2019-05-23 09:22:36,316 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:36,317 INFO L146 ILogger]: With dead ends: 194 [2019-05-23 09:22:36,317 INFO L146 ILogger]: Without dead ends: 194 [2019-05-23 09:22:36,318 INFO L146 ILogger]: 0 DeclaredPredicates, 141 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:22:36,318 INFO L146 ILogger]: Start minimizeSevpa. Operand 194 states. [2019-05-23 09:22:36,319 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-05-23 09:22:36,320 INFO L146 ILogger]: Start removeUnreachable. Operand 193 states. [2019-05-23 09:22:36,320 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 193 states to 193 states and 240 transitions. [2019-05-23 09:22:36,320 INFO L146 ILogger]: Start accepts. Automaton has 193 states and 240 transitions. Word has length 142 [2019-05-23 09:22:36,320 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:36,321 INFO L146 ILogger]: Abstraction has 193 states and 240 transitions. [2019-05-23 09:22:36,321 INFO L146 ILogger]: Interpolant automaton has 49 states. [2019-05-23 09:22:36,321 INFO L146 ILogger]: Start isEmpty. Operand 193 states and 240 transitions. [2019-05-23 09:22:36,322 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 146 [2019-05-23 09:22:36,322 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:36,322 INFO L146 ILogger]: trace histogram [47, 47, 47, 1, 1, 1, 1] [2019-05-23 09:22:36,322 INFO L146 ILogger]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:36,322 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:36,322 INFO L146 ILogger]: Analyzing trace with hash -365417749, now seen corresponding path program 47 times [2019-05-23 09:22:36,323 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:36,333 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:36,334 INFO L146 ILogger]: Trace formula consists of 196 conjuncts, 49 conjunts are in the unsatisfiable core [2019-05-23 09:22:36,336 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:37,339 INFO L146 ILogger]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:37,339 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:37,339 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-05-23 09:22:37,340 INFO L146 ILogger]: Interpolant automaton has 50 states [2019-05-23 09:22:37,340 INFO L146 ILogger]: Constructing interpolant automaton starting with 50 interpolants. [2019-05-23 09:22:37,340 INFO L146 ILogger]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 09:22:37,340 INFO L146 ILogger]: Start difference. First operand 193 states and 240 transitions. Second operand 50 states. [2019-05-23 09:22:37,509 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:37,510 INFO L146 ILogger]: Finished difference Result 198 states and 246 transitions. [2019-05-23 09:22:37,510 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-05-23 09:22:37,510 INFO L146 ILogger]: Start accepts. Automaton has 50 states. Word has length 145 [2019-05-23 09:22:37,510 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:37,512 INFO L146 ILogger]: With dead ends: 198 [2019-05-23 09:22:37,512 INFO L146 ILogger]: Without dead ends: 198 [2019-05-23 09:22:37,512 INFO L146 ILogger]: 0 DeclaredPredicates, 144 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 09:22:37,513 INFO L146 ILogger]: Start minimizeSevpa. Operand 198 states. [2019-05-23 09:22:37,515 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-05-23 09:22:37,515 INFO L146 ILogger]: Start removeUnreachable. Operand 197 states. [2019-05-23 09:22:37,515 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 197 states to 197 states and 245 transitions. [2019-05-23 09:22:37,515 INFO L146 ILogger]: Start accepts. Automaton has 197 states and 245 transitions. Word has length 145 [2019-05-23 09:22:37,515 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:37,515 INFO L146 ILogger]: Abstraction has 197 states and 245 transitions. [2019-05-23 09:22:37,515 INFO L146 ILogger]: Interpolant automaton has 50 states. [2019-05-23 09:22:37,516 INFO L146 ILogger]: Start isEmpty. Operand 197 states and 245 transitions. [2019-05-23 09:22:37,516 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 149 [2019-05-23 09:22:37,516 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:37,516 INFO L146 ILogger]: trace histogram [48, 48, 48, 1, 1, 1, 1] [2019-05-23 09:22:37,516 INFO L146 ILogger]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:37,517 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:37,517 INFO L146 ILogger]: Analyzing trace with hash 1572414755, now seen corresponding path program 48 times [2019-05-23 09:22:37,517 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:37,528 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:37,529 INFO L146 ILogger]: Trace formula consists of 200 conjuncts, 50 conjunts are in the unsatisfiable core [2019-05-23 09:22:37,531 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:38,557 INFO L146 ILogger]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:38,557 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:38,557 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-05-23 09:22:38,557 INFO L146 ILogger]: Interpolant automaton has 51 states [2019-05-23 09:22:38,558 INFO L146 ILogger]: Constructing interpolant automaton starting with 51 interpolants. [2019-05-23 09:22:38,558 INFO L146 ILogger]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:22:38,558 INFO L146 ILogger]: Start difference. First operand 197 states and 245 transitions. Second operand 51 states. [2019-05-23 09:22:38,725 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:38,726 INFO L146 ILogger]: Finished difference Result 202 states and 251 transitions. [2019-05-23 09:22:38,726 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-05-23 09:22:38,726 INFO L146 ILogger]: Start accepts. Automaton has 51 states. Word has length 148 [2019-05-23 09:22:38,726 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:38,728 INFO L146 ILogger]: With dead ends: 202 [2019-05-23 09:22:38,728 INFO L146 ILogger]: Without dead ends: 202 [2019-05-23 09:22:38,729 INFO L146 ILogger]: 0 DeclaredPredicates, 147 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:22:38,729 INFO L146 ILogger]: Start minimizeSevpa. Operand 202 states. [2019-05-23 09:22:38,731 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-05-23 09:22:38,731 INFO L146 ILogger]: Start removeUnreachable. Operand 201 states. [2019-05-23 09:22:38,731 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 201 states to 201 states and 250 transitions. [2019-05-23 09:22:38,731 INFO L146 ILogger]: Start accepts. Automaton has 201 states and 250 transitions. Word has length 148 [2019-05-23 09:22:38,731 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:38,732 INFO L146 ILogger]: Abstraction has 201 states and 250 transitions. [2019-05-23 09:22:38,732 INFO L146 ILogger]: Interpolant automaton has 51 states. [2019-05-23 09:22:38,732 INFO L146 ILogger]: Start isEmpty. Operand 201 states and 250 transitions. [2019-05-23 09:22:38,732 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 152 [2019-05-23 09:22:38,732 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:38,732 INFO L146 ILogger]: trace histogram [49, 49, 49, 1, 1, 1, 1] [2019-05-23 09:22:38,733 INFO L146 ILogger]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:38,733 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:38,733 INFO L146 ILogger]: Analyzing trace with hash -1409851413, now seen corresponding path program 49 times [2019-05-23 09:22:38,734 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:38,744 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:38,745 INFO L146 ILogger]: Trace formula consists of 204 conjuncts, 51 conjunts are in the unsatisfiable core [2019-05-23 09:22:38,747 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:39,687 INFO L146 ILogger]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:39,688 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:39,688 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-05-23 09:22:39,688 INFO L146 ILogger]: Interpolant automaton has 52 states [2019-05-23 09:22:39,689 INFO L146 ILogger]: Constructing interpolant automaton starting with 52 interpolants. [2019-05-23 09:22:39,689 INFO L146 ILogger]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 09:22:39,689 INFO L146 ILogger]: Start difference. First operand 201 states and 250 transitions. Second operand 52 states. [2019-05-23 09:22:39,870 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:39,870 INFO L146 ILogger]: Finished difference Result 206 states and 256 transitions. [2019-05-23 09:22:39,870 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-05-23 09:22:39,871 INFO L146 ILogger]: Start accepts. Automaton has 52 states. Word has length 151 [2019-05-23 09:22:39,871 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:39,872 INFO L146 ILogger]: With dead ends: 206 [2019-05-23 09:22:39,872 INFO L146 ILogger]: Without dead ends: 206 [2019-05-23 09:22:39,873 INFO L146 ILogger]: 0 DeclaredPredicates, 150 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 09:22:39,874 INFO L146 ILogger]: Start minimizeSevpa. Operand 206 states. [2019-05-23 09:22:39,876 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-05-23 09:22:39,876 INFO L146 ILogger]: Start removeUnreachable. Operand 205 states. [2019-05-23 09:22:39,877 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 205 states to 205 states and 255 transitions. [2019-05-23 09:22:39,877 INFO L146 ILogger]: Start accepts. Automaton has 205 states and 255 transitions. Word has length 151 [2019-05-23 09:22:39,877 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:39,877 INFO L146 ILogger]: Abstraction has 205 states and 255 transitions. [2019-05-23 09:22:39,877 INFO L146 ILogger]: Interpolant automaton has 52 states. [2019-05-23 09:22:39,877 INFO L146 ILogger]: Start isEmpty. Operand 205 states and 255 transitions. [2019-05-23 09:22:39,878 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 155 [2019-05-23 09:22:39,878 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:39,879 INFO L146 ILogger]: trace histogram [50, 50, 50, 1, 1, 1, 1] [2019-05-23 09:22:39,879 INFO L146 ILogger]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:39,879 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:39,879 INFO L146 ILogger]: Analyzing trace with hash -407777245, now seen corresponding path program 50 times [2019-05-23 09:22:39,880 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:39,890 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:39,891 INFO L146 ILogger]: Trace formula consists of 208 conjuncts, 52 conjunts are in the unsatisfiable core [2019-05-23 09:22:39,893 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:40,934 INFO L146 ILogger]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:40,935 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:40,935 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-05-23 09:22:40,935 INFO L146 ILogger]: Interpolant automaton has 53 states [2019-05-23 09:22:40,936 INFO L146 ILogger]: Constructing interpolant automaton starting with 53 interpolants. [2019-05-23 09:22:40,936 INFO L146 ILogger]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:22:40,936 INFO L146 ILogger]: Start difference. First operand 205 states and 255 transitions. Second operand 53 states. [2019-05-23 09:22:41,127 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:41,127 INFO L146 ILogger]: Finished difference Result 210 states and 261 transitions. [2019-05-23 09:22:41,128 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-05-23 09:22:41,128 INFO L146 ILogger]: Start accepts. Automaton has 53 states. Word has length 154 [2019-05-23 09:22:41,128 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:41,130 INFO L146 ILogger]: With dead ends: 210 [2019-05-23 09:22:41,130 INFO L146 ILogger]: Without dead ends: 210 [2019-05-23 09:22:41,131 INFO L146 ILogger]: 0 DeclaredPredicates, 153 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:22:41,131 INFO L146 ILogger]: Start minimizeSevpa. Operand 210 states. [2019-05-23 09:22:41,133 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-05-23 09:22:41,133 INFO L146 ILogger]: Start removeUnreachable. Operand 209 states. [2019-05-23 09:22:41,134 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 209 states to 209 states and 260 transitions. [2019-05-23 09:22:41,134 INFO L146 ILogger]: Start accepts. Automaton has 209 states and 260 transitions. Word has length 154 [2019-05-23 09:22:41,134 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:41,134 INFO L146 ILogger]: Abstraction has 209 states and 260 transitions. [2019-05-23 09:22:41,134 INFO L146 ILogger]: Interpolant automaton has 53 states. [2019-05-23 09:22:41,134 INFO L146 ILogger]: Start isEmpty. Operand 209 states and 260 transitions. [2019-05-23 09:22:41,135 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 158 [2019-05-23 09:22:41,135 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:41,135 INFO L146 ILogger]: trace histogram [51, 51, 51, 1, 1, 1, 1] [2019-05-23 09:22:41,136 INFO L146 ILogger]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:41,136 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:41,136 INFO L146 ILogger]: Analyzing trace with hash -1933912853, now seen corresponding path program 51 times [2019-05-23 09:22:41,137 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:41,147 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:41,148 INFO L146 ILogger]: Trace formula consists of 212 conjuncts, 53 conjunts are in the unsatisfiable core [2019-05-23 09:22:41,150 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:42,593 INFO L146 ILogger]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:42,594 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:42,594 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-05-23 09:22:42,594 INFO L146 ILogger]: Interpolant automaton has 54 states [2019-05-23 09:22:42,594 INFO L146 ILogger]: Constructing interpolant automaton starting with 54 interpolants. [2019-05-23 09:22:42,594 INFO L146 ILogger]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 09:22:42,595 INFO L146 ILogger]: Start difference. First operand 209 states and 260 transitions. Second operand 54 states. [2019-05-23 09:22:42,802 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:42,802 INFO L146 ILogger]: Finished difference Result 214 states and 266 transitions. [2019-05-23 09:22:42,802 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-23 09:22:42,802 INFO L146 ILogger]: Start accepts. Automaton has 54 states. Word has length 157 [2019-05-23 09:22:42,803 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:42,804 INFO L146 ILogger]: With dead ends: 214 [2019-05-23 09:22:42,804 INFO L146 ILogger]: Without dead ends: 214 [2019-05-23 09:22:42,805 INFO L146 ILogger]: 0 DeclaredPredicates, 156 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 09:22:42,805 INFO L146 ILogger]: Start minimizeSevpa. Operand 214 states. [2019-05-23 09:22:42,808 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-05-23 09:22:42,808 INFO L146 ILogger]: Start removeUnreachable. Operand 213 states. [2019-05-23 09:22:42,809 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 213 states to 213 states and 265 transitions. [2019-05-23 09:22:42,809 INFO L146 ILogger]: Start accepts. Automaton has 213 states and 265 transitions. Word has length 157 [2019-05-23 09:22:42,809 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:42,809 INFO L146 ILogger]: Abstraction has 213 states and 265 transitions. [2019-05-23 09:22:42,809 INFO L146 ILogger]: Interpolant automaton has 54 states. [2019-05-23 09:22:42,809 INFO L146 ILogger]: Start isEmpty. Operand 213 states and 265 transitions. [2019-05-23 09:22:42,810 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 161 [2019-05-23 09:22:42,810 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:42,811 INFO L146 ILogger]: trace histogram [52, 52, 52, 1, 1, 1, 1] [2019-05-23 09:22:42,811 INFO L146 ILogger]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:42,811 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:42,811 INFO L146 ILogger]: Analyzing trace with hash -516015325, now seen corresponding path program 52 times [2019-05-23 09:22:42,812 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:42,822 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:42,824 INFO L146 ILogger]: Trace formula consists of 216 conjuncts, 54 conjunts are in the unsatisfiable core [2019-05-23 09:22:42,827 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:43,816 INFO L146 ILogger]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:43,816 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:43,816 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-05-23 09:22:43,816 INFO L146 ILogger]: Interpolant automaton has 55 states [2019-05-23 09:22:43,817 INFO L146 ILogger]: Constructing interpolant automaton starting with 55 interpolants. [2019-05-23 09:22:43,817 INFO L146 ILogger]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:22:43,817 INFO L146 ILogger]: Start difference. First operand 213 states and 265 transitions. Second operand 55 states. [2019-05-23 09:22:44,034 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:44,034 INFO L146 ILogger]: Finished difference Result 218 states and 271 transitions. [2019-05-23 09:22:44,034 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-05-23 09:22:44,034 INFO L146 ILogger]: Start accepts. Automaton has 55 states. Word has length 160 [2019-05-23 09:22:44,035 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:44,036 INFO L146 ILogger]: With dead ends: 218 [2019-05-23 09:22:44,036 INFO L146 ILogger]: Without dead ends: 218 [2019-05-23 09:22:44,037 INFO L146 ILogger]: 0 DeclaredPredicates, 159 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:22:44,037 INFO L146 ILogger]: Start minimizeSevpa. Operand 218 states. [2019-05-23 09:22:44,040 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-05-23 09:22:44,040 INFO L146 ILogger]: Start removeUnreachable. Operand 217 states. [2019-05-23 09:22:44,040 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 217 states to 217 states and 270 transitions. [2019-05-23 09:22:44,040 INFO L146 ILogger]: Start accepts. Automaton has 217 states and 270 transitions. Word has length 160 [2019-05-23 09:22:44,041 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:44,041 INFO L146 ILogger]: Abstraction has 217 states and 270 transitions. [2019-05-23 09:22:44,041 INFO L146 ILogger]: Interpolant automaton has 55 states. [2019-05-23 09:22:44,041 INFO L146 ILogger]: Start isEmpty. Operand 217 states and 270 transitions. [2019-05-23 09:22:44,049 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 164 [2019-05-23 09:22:44,050 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:44,050 INFO L146 ILogger]: trace histogram [53, 53, 53, 1, 1, 1, 1] [2019-05-23 09:22:44,050 INFO L146 ILogger]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:44,051 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:44,051 INFO L146 ILogger]: Analyzing trace with hash -934114837, now seen corresponding path program 53 times [2019-05-23 09:22:44,052 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:44,064 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:44,066 INFO L146 ILogger]: Trace formula consists of 220 conjuncts, 55 conjunts are in the unsatisfiable core [2019-05-23 09:22:44,068 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:47,192 INFO L146 ILogger]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:47,192 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:47,192 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-05-23 09:22:47,193 INFO L146 ILogger]: Interpolant automaton has 56 states [2019-05-23 09:22:47,193 INFO L146 ILogger]: Constructing interpolant automaton starting with 56 interpolants. [2019-05-23 09:22:47,194 INFO L146 ILogger]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 09:22:47,194 INFO L146 ILogger]: Start difference. First operand 217 states and 270 transitions. Second operand 56 states. [2019-05-23 09:22:47,450 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:47,450 INFO L146 ILogger]: Finished difference Result 222 states and 276 transitions. [2019-05-23 09:22:47,451 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-05-23 09:22:47,451 INFO L146 ILogger]: Start accepts. Automaton has 56 states. Word has length 163 [2019-05-23 09:22:47,451 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:47,452 INFO L146 ILogger]: With dead ends: 222 [2019-05-23 09:22:47,453 INFO L146 ILogger]: Without dead ends: 222 [2019-05-23 09:22:47,453 INFO L146 ILogger]: 0 DeclaredPredicates, 162 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 09:22:47,454 INFO L146 ILogger]: Start minimizeSevpa. Operand 222 states. [2019-05-23 09:22:47,456 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-05-23 09:22:47,456 INFO L146 ILogger]: Start removeUnreachable. Operand 221 states. [2019-05-23 09:22:47,456 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 221 states to 221 states and 275 transitions. [2019-05-23 09:22:47,456 INFO L146 ILogger]: Start accepts. Automaton has 221 states and 275 transitions. Word has length 163 [2019-05-23 09:22:47,457 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:47,457 INFO L146 ILogger]: Abstraction has 221 states and 275 transitions. [2019-05-23 09:22:47,457 INFO L146 ILogger]: Interpolant automaton has 56 states. [2019-05-23 09:22:47,457 INFO L146 ILogger]: Start isEmpty. Operand 221 states and 275 transitions. [2019-05-23 09:22:47,458 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 167 [2019-05-23 09:22:47,458 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:47,458 INFO L146 ILogger]: trace histogram [54, 54, 54, 1, 1, 1, 1] [2019-05-23 09:22:47,458 INFO L146 ILogger]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:47,458 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:47,458 INFO L146 ILogger]: Analyzing trace with hash -1131518429, now seen corresponding path program 54 times [2019-05-23 09:22:47,459 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:47,468 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:47,470 INFO L146 ILogger]: Trace formula consists of 224 conjuncts, 56 conjunts are in the unsatisfiable core [2019-05-23 09:22:47,472 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:48,677 INFO L146 ILogger]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:48,677 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:48,677 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-05-23 09:22:48,677 INFO L146 ILogger]: Interpolant automaton has 57 states [2019-05-23 09:22:48,678 INFO L146 ILogger]: Constructing interpolant automaton starting with 57 interpolants. [2019-05-23 09:22:48,678 INFO L146 ILogger]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:22:48,678 INFO L146 ILogger]: Start difference. First operand 221 states and 275 transitions. Second operand 57 states. [2019-05-23 09:22:48,889 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:48,889 INFO L146 ILogger]: Finished difference Result 226 states and 281 transitions. [2019-05-23 09:22:48,889 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-05-23 09:22:48,890 INFO L146 ILogger]: Start accepts. Automaton has 57 states. Word has length 166 [2019-05-23 09:22:48,890 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:48,891 INFO L146 ILogger]: With dead ends: 226 [2019-05-23 09:22:48,892 INFO L146 ILogger]: Without dead ends: 226 [2019-05-23 09:22:48,892 INFO L146 ILogger]: 0 DeclaredPredicates, 165 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:22:48,892 INFO L146 ILogger]: Start minimizeSevpa. Operand 226 states. [2019-05-23 09:22:48,894 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-05-23 09:22:48,894 INFO L146 ILogger]: Start removeUnreachable. Operand 225 states. [2019-05-23 09:22:48,895 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 225 states to 225 states and 280 transitions. [2019-05-23 09:22:48,895 INFO L146 ILogger]: Start accepts. Automaton has 225 states and 280 transitions. Word has length 166 [2019-05-23 09:22:48,895 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:48,895 INFO L146 ILogger]: Abstraction has 225 states and 280 transitions. [2019-05-23 09:22:48,895 INFO L146 ILogger]: Interpolant automaton has 57 states. [2019-05-23 09:22:48,895 INFO L146 ILogger]: Start isEmpty. Operand 225 states and 280 transitions. [2019-05-23 09:22:48,896 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 170 [2019-05-23 09:22:48,896 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:48,896 INFO L146 ILogger]: trace histogram [55, 55, 55, 1, 1, 1, 1] [2019-05-23 09:22:48,897 INFO L146 ILogger]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:48,897 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:48,897 INFO L146 ILogger]: Analyzing trace with hash 2123267819, now seen corresponding path program 55 times [2019-05-23 09:22:48,898 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:48,908 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:48,909 INFO L146 ILogger]: Trace formula consists of 228 conjuncts, 57 conjunts are in the unsatisfiable core [2019-05-23 09:22:48,912 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:50,033 INFO L146 ILogger]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:50,033 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:50,033 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-05-23 09:22:50,033 INFO L146 ILogger]: Interpolant automaton has 58 states [2019-05-23 09:22:50,034 INFO L146 ILogger]: Constructing interpolant automaton starting with 58 interpolants. [2019-05-23 09:22:50,034 INFO L146 ILogger]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 09:22:50,034 INFO L146 ILogger]: Start difference. First operand 225 states and 280 transitions. Second operand 58 states. [2019-05-23 09:22:50,278 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:50,279 INFO L146 ILogger]: Finished difference Result 230 states and 286 transitions. [2019-05-23 09:22:50,279 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-05-23 09:22:50,280 INFO L146 ILogger]: Start accepts. Automaton has 58 states. Word has length 169 [2019-05-23 09:22:50,280 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:50,281 INFO L146 ILogger]: With dead ends: 230 [2019-05-23 09:22:50,281 INFO L146 ILogger]: Without dead ends: 230 [2019-05-23 09:22:50,282 INFO L146 ILogger]: 0 DeclaredPredicates, 168 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 09:22:50,282 INFO L146 ILogger]: Start minimizeSevpa. Operand 230 states. [2019-05-23 09:22:50,284 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-05-23 09:22:50,284 INFO L146 ILogger]: Start removeUnreachable. Operand 229 states. [2019-05-23 09:22:50,285 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 229 states to 229 states and 285 transitions. [2019-05-23 09:22:50,285 INFO L146 ILogger]: Start accepts. Automaton has 229 states and 285 transitions. Word has length 169 [2019-05-23 09:22:50,285 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:50,285 INFO L146 ILogger]: Abstraction has 229 states and 285 transitions. [2019-05-23 09:22:50,285 INFO L146 ILogger]: Interpolant automaton has 58 states. [2019-05-23 09:22:50,286 INFO L146 ILogger]: Start isEmpty. Operand 229 states and 285 transitions. [2019-05-23 09:22:50,286 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 173 [2019-05-23 09:22:50,286 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:50,287 INFO L146 ILogger]: trace histogram [56, 56, 56, 1, 1, 1, 1] [2019-05-23 09:22:50,287 INFO L146 ILogger]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:50,287 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:50,287 INFO L146 ILogger]: Analyzing trace with hash -2016259805, now seen corresponding path program 56 times [2019-05-23 09:22:50,288 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:50,298 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:50,300 INFO L146 ILogger]: Trace formula consists of 232 conjuncts, 58 conjunts are in the unsatisfiable core [2019-05-23 09:22:50,302 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:51,717 INFO L146 ILogger]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:51,718 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:51,718 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-05-23 09:22:51,718 INFO L146 ILogger]: Interpolant automaton has 59 states [2019-05-23 09:22:51,719 INFO L146 ILogger]: Constructing interpolant automaton starting with 59 interpolants. [2019-05-23 09:22:51,719 INFO L146 ILogger]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:22:51,719 INFO L146 ILogger]: Start difference. First operand 229 states and 285 transitions. Second operand 59 states. [2019-05-23 09:22:51,962 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:51,962 INFO L146 ILogger]: Finished difference Result 234 states and 291 transitions. [2019-05-23 09:22:51,962 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-05-23 09:22:51,962 INFO L146 ILogger]: Start accepts. Automaton has 59 states. Word has length 172 [2019-05-23 09:22:51,963 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:51,964 INFO L146 ILogger]: With dead ends: 234 [2019-05-23 09:22:51,964 INFO L146 ILogger]: Without dead ends: 234 [2019-05-23 09:22:51,965 INFO L146 ILogger]: 0 DeclaredPredicates, 171 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:22:51,965 INFO L146 ILogger]: Start minimizeSevpa. Operand 234 states. [2019-05-23 09:22:51,967 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-05-23 09:22:51,967 INFO L146 ILogger]: Start removeUnreachable. Operand 233 states. [2019-05-23 09:22:51,967 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 233 states to 233 states and 290 transitions. [2019-05-23 09:22:51,968 INFO L146 ILogger]: Start accepts. Automaton has 233 states and 290 transitions. Word has length 172 [2019-05-23 09:22:51,968 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:51,968 INFO L146 ILogger]: Abstraction has 233 states and 290 transitions. [2019-05-23 09:22:51,968 INFO L146 ILogger]: Interpolant automaton has 59 states. [2019-05-23 09:22:51,968 INFO L146 ILogger]: Start isEmpty. Operand 233 states and 290 transitions. [2019-05-23 09:22:51,969 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 176 [2019-05-23 09:22:51,969 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:51,969 INFO L146 ILogger]: trace histogram [57, 57, 57, 1, 1, 1, 1] [2019-05-23 09:22:51,969 INFO L146 ILogger]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:51,969 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:51,970 INFO L146 ILogger]: Analyzing trace with hash -1287736341, now seen corresponding path program 57 times [2019-05-23 09:22:51,970 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:51,981 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:51,983 INFO L146 ILogger]: Trace formula consists of 236 conjuncts, 59 conjunts are in the unsatisfiable core [2019-05-23 09:22:51,985 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:53,259 INFO L146 ILogger]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:53,260 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:53,260 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-05-23 09:22:53,260 INFO L146 ILogger]: Interpolant automaton has 60 states [2019-05-23 09:22:53,260 INFO L146 ILogger]: Constructing interpolant automaton starting with 60 interpolants. [2019-05-23 09:22:53,261 INFO L146 ILogger]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 09:22:53,261 INFO L146 ILogger]: Start difference. First operand 233 states and 290 transitions. Second operand 60 states. [2019-05-23 09:22:53,502 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:53,502 INFO L146 ILogger]: Finished difference Result 238 states and 296 transitions. [2019-05-23 09:22:53,502 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-23 09:22:53,502 INFO L146 ILogger]: Start accepts. Automaton has 60 states. Word has length 175 [2019-05-23 09:22:53,503 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:53,504 INFO L146 ILogger]: With dead ends: 238 [2019-05-23 09:22:53,504 INFO L146 ILogger]: Without dead ends: 238 [2019-05-23 09:22:53,505 INFO L146 ILogger]: 0 DeclaredPredicates, 174 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 09:22:53,505 INFO L146 ILogger]: Start minimizeSevpa. Operand 238 states. [2019-05-23 09:22:53,507 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-05-23 09:22:53,507 INFO L146 ILogger]: Start removeUnreachable. Operand 237 states. [2019-05-23 09:22:53,507 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 237 states to 237 states and 295 transitions. [2019-05-23 09:22:53,508 INFO L146 ILogger]: Start accepts. Automaton has 237 states and 295 transitions. Word has length 175 [2019-05-23 09:22:53,508 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:53,508 INFO L146 ILogger]: Abstraction has 237 states and 295 transitions. [2019-05-23 09:22:53,508 INFO L146 ILogger]: Interpolant automaton has 60 states. [2019-05-23 09:22:53,508 INFO L146 ILogger]: Start isEmpty. Operand 237 states and 295 transitions. [2019-05-23 09:22:53,509 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 179 [2019-05-23 09:22:53,509 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:53,509 INFO L146 ILogger]: trace histogram [58, 58, 58, 1, 1, 1, 1] [2019-05-23 09:22:53,509 INFO L146 ILogger]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:53,509 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:53,509 INFO L146 ILogger]: Analyzing trace with hash -314967005, now seen corresponding path program 58 times [2019-05-23 09:22:53,510 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:53,520 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:53,522 INFO L146 ILogger]: Trace formula consists of 240 conjuncts, 60 conjunts are in the unsatisfiable core [2019-05-23 09:22:53,524 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:54,946 INFO L146 ILogger]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:54,946 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:54,946 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-05-23 09:22:54,947 INFO L146 ILogger]: Interpolant automaton has 61 states [2019-05-23 09:22:54,947 INFO L146 ILogger]: Constructing interpolant automaton starting with 61 interpolants. [2019-05-23 09:22:54,948 INFO L146 ILogger]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:22:54,948 INFO L146 ILogger]: Start difference. First operand 237 states and 295 transitions. Second operand 61 states. [2019-05-23 09:22:55,261 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:55,261 INFO L146 ILogger]: Finished difference Result 242 states and 301 transitions. [2019-05-23 09:22:55,261 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-05-23 09:22:55,262 INFO L146 ILogger]: Start accepts. Automaton has 61 states. Word has length 178 [2019-05-23 09:22:55,262 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:55,263 INFO L146 ILogger]: With dead ends: 242 [2019-05-23 09:22:55,263 INFO L146 ILogger]: Without dead ends: 242 [2019-05-23 09:22:55,264 INFO L146 ILogger]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:22:55,264 INFO L146 ILogger]: Start minimizeSevpa. Operand 242 states. [2019-05-23 09:22:55,267 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-05-23 09:22:55,267 INFO L146 ILogger]: Start removeUnreachable. Operand 241 states. [2019-05-23 09:22:55,267 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 241 states to 241 states and 300 transitions. [2019-05-23 09:22:55,267 INFO L146 ILogger]: Start accepts. Automaton has 241 states and 300 transitions. Word has length 178 [2019-05-23 09:22:55,267 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:55,268 INFO L146 ILogger]: Abstraction has 241 states and 300 transitions. [2019-05-23 09:22:55,268 INFO L146 ILogger]: Interpolant automaton has 61 states. [2019-05-23 09:22:55,268 INFO L146 ILogger]: Start isEmpty. Operand 241 states and 300 transitions. [2019-05-23 09:22:55,268 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 182 [2019-05-23 09:22:55,268 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:55,268 INFO L146 ILogger]: trace histogram [59, 59, 59, 1, 1, 1, 1] [2019-05-23 09:22:55,269 INFO L146 ILogger]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:55,269 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:55,269 INFO L146 ILogger]: Analyzing trace with hash 1311975659, now seen corresponding path program 59 times [2019-05-23 09:22:55,269 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:55,282 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:55,283 INFO L146 ILogger]: Trace formula consists of 244 conjuncts, 61 conjunts are in the unsatisfiable core [2019-05-23 09:22:55,286 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:57,378 INFO L146 ILogger]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:57,379 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:57,379 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-05-23 09:22:57,379 INFO L146 ILogger]: Interpolant automaton has 62 states [2019-05-23 09:22:57,380 INFO L146 ILogger]: Constructing interpolant automaton starting with 62 interpolants. [2019-05-23 09:22:57,380 INFO L146 ILogger]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 09:22:57,380 INFO L146 ILogger]: Start difference. First operand 241 states and 300 transitions. Second operand 62 states. [2019-05-23 09:22:57,713 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:57,714 INFO L146 ILogger]: Finished difference Result 246 states and 306 transitions. [2019-05-23 09:22:57,714 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-05-23 09:22:57,714 INFO L146 ILogger]: Start accepts. Automaton has 62 states. Word has length 181 [2019-05-23 09:22:57,714 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:57,716 INFO L146 ILogger]: With dead ends: 246 [2019-05-23 09:22:57,716 INFO L146 ILogger]: Without dead ends: 246 [2019-05-23 09:22:57,717 INFO L146 ILogger]: 0 DeclaredPredicates, 180 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 09:22:57,717 INFO L146 ILogger]: Start minimizeSevpa. Operand 246 states. [2019-05-23 09:22:57,719 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-05-23 09:22:57,720 INFO L146 ILogger]: Start removeUnreachable. Operand 245 states. [2019-05-23 09:22:57,720 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 245 states to 245 states and 305 transitions. [2019-05-23 09:22:57,720 INFO L146 ILogger]: Start accepts. Automaton has 245 states and 305 transitions. Word has length 181 [2019-05-23 09:22:57,720 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:57,721 INFO L146 ILogger]: Abstraction has 245 states and 305 transitions. [2019-05-23 09:22:57,721 INFO L146 ILogger]: Interpolant automaton has 62 states. [2019-05-23 09:22:57,721 INFO L146 ILogger]: Start isEmpty. Operand 245 states and 305 transitions. [2019-05-23 09:22:57,722 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 185 [2019-05-23 09:22:57,722 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:57,722 INFO L146 ILogger]: trace histogram [60, 60, 60, 1, 1, 1, 1] [2019-05-23 09:22:57,722 INFO L146 ILogger]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:57,722 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:57,722 INFO L146 ILogger]: Analyzing trace with hash 854943523, now seen corresponding path program 60 times [2019-05-23 09:22:57,723 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:57,734 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:57,736 INFO L146 ILogger]: Trace formula consists of 248 conjuncts, 62 conjunts are in the unsatisfiable core [2019-05-23 09:22:57,739 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:59,586 INFO L146 ILogger]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:59,586 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:59,586 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-05-23 09:22:59,587 INFO L146 ILogger]: Interpolant automaton has 63 states [2019-05-23 09:22:59,587 INFO L146 ILogger]: Constructing interpolant automaton starting with 63 interpolants. [2019-05-23 09:22:59,587 INFO L146 ILogger]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:22:59,587 INFO L146 ILogger]: Start difference. First operand 245 states and 305 transitions. Second operand 63 states. [2019-05-23 09:22:59,852 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:59,852 INFO L146 ILogger]: Finished difference Result 250 states and 311 transitions. [2019-05-23 09:22:59,853 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-05-23 09:22:59,853 INFO L146 ILogger]: Start accepts. Automaton has 63 states. Word has length 184 [2019-05-23 09:22:59,853 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:59,855 INFO L146 ILogger]: With dead ends: 250 [2019-05-23 09:22:59,855 INFO L146 ILogger]: Without dead ends: 250 [2019-05-23 09:22:59,855 INFO L146 ILogger]: 0 DeclaredPredicates, 183 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:22:59,856 INFO L146 ILogger]: Start minimizeSevpa. Operand 250 states. [2019-05-23 09:22:59,858 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-05-23 09:22:59,858 INFO L146 ILogger]: Start removeUnreachable. Operand 249 states. [2019-05-23 09:22:59,858 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 249 states to 249 states and 310 transitions. [2019-05-23 09:22:59,858 INFO L146 ILogger]: Start accepts. Automaton has 249 states and 310 transitions. Word has length 184 [2019-05-23 09:22:59,859 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:59,859 INFO L146 ILogger]: Abstraction has 249 states and 310 transitions. [2019-05-23 09:22:59,859 INFO L146 ILogger]: Interpolant automaton has 63 states. [2019-05-23 09:22:59,859 INFO L146 ILogger]: Start isEmpty. Operand 249 states and 310 transitions. [2019-05-23 09:22:59,860 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 188 [2019-05-23 09:22:59,860 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:59,860 INFO L146 ILogger]: trace histogram [61, 61, 61, 1, 1, 1, 1] [2019-05-23 09:22:59,860 INFO L146 ILogger]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:59,861 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:59,861 INFO L146 ILogger]: Analyzing trace with hash 456908267, now seen corresponding path program 61 times [2019-05-23 09:22:59,861 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:59,873 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:59,874 INFO L146 ILogger]: Trace formula consists of 252 conjuncts, 63 conjunts are in the unsatisfiable core [2019-05-23 09:22:59,877 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:01,239 INFO L146 ILogger]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:01,239 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:01,239 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-05-23 09:23:01,240 INFO L146 ILogger]: Interpolant automaton has 64 states [2019-05-23 09:23:01,240 INFO L146 ILogger]: Constructing interpolant automaton starting with 64 interpolants. [2019-05-23 09:23:01,241 INFO L146 ILogger]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 09:23:01,241 INFO L146 ILogger]: Start difference. First operand 249 states and 310 transitions. Second operand 64 states. [2019-05-23 09:23:01,567 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:01,567 INFO L146 ILogger]: Finished difference Result 254 states and 316 transitions. [2019-05-23 09:23:01,567 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-05-23 09:23:01,567 INFO L146 ILogger]: Start accepts. Automaton has 64 states. Word has length 187 [2019-05-23 09:23:01,568 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:01,568 INFO L146 ILogger]: With dead ends: 254 [2019-05-23 09:23:01,568 INFO L146 ILogger]: Without dead ends: 254 [2019-05-23 09:23:01,569 INFO L146 ILogger]: 0 DeclaredPredicates, 186 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 09:23:01,569 INFO L146 ILogger]: Start minimizeSevpa. Operand 254 states. [2019-05-23 09:23:01,571 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-05-23 09:23:01,572 INFO L146 ILogger]: Start removeUnreachable. Operand 253 states. [2019-05-23 09:23:01,572 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 253 states to 253 states and 315 transitions. [2019-05-23 09:23:01,572 INFO L146 ILogger]: Start accepts. Automaton has 253 states and 315 transitions. Word has length 187 [2019-05-23 09:23:01,572 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:01,572 INFO L146 ILogger]: Abstraction has 253 states and 315 transitions. [2019-05-23 09:23:01,572 INFO L146 ILogger]: Interpolant automaton has 64 states. [2019-05-23 09:23:01,572 INFO L146 ILogger]: Start isEmpty. Operand 253 states and 315 transitions. [2019-05-23 09:23:01,573 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 191 [2019-05-23 09:23:01,573 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:01,574 INFO L146 ILogger]: trace histogram [62, 62, 62, 1, 1, 1, 1] [2019-05-23 09:23:01,574 INFO L146 ILogger]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:01,574 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:01,574 INFO L146 ILogger]: Analyzing trace with hash 993301027, now seen corresponding path program 62 times [2019-05-23 09:23:01,575 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:01,587 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:01,589 INFO L146 ILogger]: Trace formula consists of 256 conjuncts, 64 conjunts are in the unsatisfiable core [2019-05-23 09:23:01,591 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:03,373 INFO L146 ILogger]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:03,373 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:03,374 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-05-23 09:23:03,374 INFO L146 ILogger]: Interpolant automaton has 65 states [2019-05-23 09:23:03,374 INFO L146 ILogger]: Constructing interpolant automaton starting with 65 interpolants. [2019-05-23 09:23:03,375 INFO L146 ILogger]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:23:03,375 INFO L146 ILogger]: Start difference. First operand 253 states and 315 transitions. Second operand 65 states. [2019-05-23 09:23:03,659 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:03,659 INFO L146 ILogger]: Finished difference Result 258 states and 321 transitions. [2019-05-23 09:23:03,660 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-05-23 09:23:03,660 INFO L146 ILogger]: Start accepts. Automaton has 65 states. Word has length 190 [2019-05-23 09:23:03,660 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:03,662 INFO L146 ILogger]: With dead ends: 258 [2019-05-23 09:23:03,662 INFO L146 ILogger]: Without dead ends: 258 [2019-05-23 09:23:03,662 INFO L146 ILogger]: 0 DeclaredPredicates, 189 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:23:03,662 INFO L146 ILogger]: Start minimizeSevpa. Operand 258 states. [2019-05-23 09:23:03,665 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-05-23 09:23:03,665 INFO L146 ILogger]: Start removeUnreachable. Operand 257 states. [2019-05-23 09:23:03,665 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 257 states to 257 states and 320 transitions. [2019-05-23 09:23:03,665 INFO L146 ILogger]: Start accepts. Automaton has 257 states and 320 transitions. Word has length 190 [2019-05-23 09:23:03,666 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:03,666 INFO L146 ILogger]: Abstraction has 257 states and 320 transitions. [2019-05-23 09:23:03,666 INFO L146 ILogger]: Interpolant automaton has 65 states. [2019-05-23 09:23:03,666 INFO L146 ILogger]: Start isEmpty. Operand 257 states and 320 transitions. [2019-05-23 09:23:03,666 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 194 [2019-05-23 09:23:03,667 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:03,667 INFO L146 ILogger]: trace histogram [63, 63, 63, 1, 1, 1, 1] [2019-05-23 09:23:03,667 INFO L146 ILogger]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:03,667 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:03,667 INFO L146 ILogger]: Analyzing trace with hash -903294229, now seen corresponding path program 63 times [2019-05-23 09:23:03,668 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:03,679 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:03,681 INFO L146 ILogger]: Trace formula consists of 260 conjuncts, 65 conjunts are in the unsatisfiable core [2019-05-23 09:23:03,683 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:05,144 INFO L146 ILogger]: Checked inductivity of 5922 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:05,145 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:05,145 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-05-23 09:23:05,145 INFO L146 ILogger]: Interpolant automaton has 66 states [2019-05-23 09:23:05,146 INFO L146 ILogger]: Constructing interpolant automaton starting with 66 interpolants. [2019-05-23 09:23:05,146 INFO L146 ILogger]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-05-23 09:23:05,146 INFO L146 ILogger]: Start difference. First operand 257 states and 320 transitions. Second operand 66 states. [2019-05-23 09:23:05,446 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:05,446 INFO L146 ILogger]: Finished difference Result 262 states and 326 transitions. [2019-05-23 09:23:05,446 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-23 09:23:05,446 INFO L146 ILogger]: Start accepts. Automaton has 66 states. Word has length 193 [2019-05-23 09:23:05,447 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:05,448 INFO L146 ILogger]: With dead ends: 262 [2019-05-23 09:23:05,448 INFO L146 ILogger]: Without dead ends: 262 [2019-05-23 09:23:05,449 INFO L146 ILogger]: 0 DeclaredPredicates, 192 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-05-23 09:23:05,449 INFO L146 ILogger]: Start minimizeSevpa. Operand 262 states. [2019-05-23 09:23:05,452 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-05-23 09:23:05,452 INFO L146 ILogger]: Start removeUnreachable. Operand 261 states. [2019-05-23 09:23:05,453 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 261 states to 261 states and 325 transitions. [2019-05-23 09:23:05,453 INFO L146 ILogger]: Start accepts. Automaton has 261 states and 325 transitions. Word has length 193 [2019-05-23 09:23:05,453 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:05,453 INFO L146 ILogger]: Abstraction has 261 states and 325 transitions. [2019-05-23 09:23:05,453 INFO L146 ILogger]: Interpolant automaton has 66 states. [2019-05-23 09:23:05,454 INFO L146 ILogger]: Start isEmpty. Operand 261 states and 325 transitions. [2019-05-23 09:23:05,454 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 197 [2019-05-23 09:23:05,454 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:05,455 INFO L146 ILogger]: trace histogram [64, 64, 64, 1, 1, 1, 1] [2019-05-23 09:23:05,455 INFO L146 ILogger]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:05,455 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:05,455 INFO L146 ILogger]: Analyzing trace with hash -2077786845, now seen corresponding path program 64 times [2019-05-23 09:23:05,456 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:05,468 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:05,470 INFO L146 ILogger]: Trace formula consists of 264 conjuncts, 66 conjunts are in the unsatisfiable core [2019-05-23 09:23:05,472 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:07,199 INFO L146 ILogger]: Checked inductivity of 6112 backedges. 0 proven. 6112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:07,200 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:07,200 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-05-23 09:23:07,200 INFO L146 ILogger]: Interpolant automaton has 67 states [2019-05-23 09:23:07,201 INFO L146 ILogger]: Constructing interpolant automaton starting with 67 interpolants. [2019-05-23 09:23:07,201 INFO L146 ILogger]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:23:07,201 INFO L146 ILogger]: Start difference. First operand 261 states and 325 transitions. Second operand 67 states. [2019-05-23 09:23:07,516 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:07,516 INFO L146 ILogger]: Finished difference Result 266 states and 331 transitions. [2019-05-23 09:23:07,516 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-05-23 09:23:07,516 INFO L146 ILogger]: Start accepts. Automaton has 67 states. Word has length 196 [2019-05-23 09:23:07,517 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:07,518 INFO L146 ILogger]: With dead ends: 266 [2019-05-23 09:23:07,518 INFO L146 ILogger]: Without dead ends: 266 [2019-05-23 09:23:07,519 INFO L146 ILogger]: 0 DeclaredPredicates, 195 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:23:07,519 INFO L146 ILogger]: Start minimizeSevpa. Operand 266 states. [2019-05-23 09:23:07,522 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-05-23 09:23:07,522 INFO L146 ILogger]: Start removeUnreachable. Operand 265 states. [2019-05-23 09:23:07,522 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 265 states to 265 states and 330 transitions. [2019-05-23 09:23:07,523 INFO L146 ILogger]: Start accepts. Automaton has 265 states and 330 transitions. Word has length 196 [2019-05-23 09:23:07,523 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:07,523 INFO L146 ILogger]: Abstraction has 265 states and 330 transitions. [2019-05-23 09:23:07,523 INFO L146 ILogger]: Interpolant automaton has 67 states. [2019-05-23 09:23:07,523 INFO L146 ILogger]: Start isEmpty. Operand 265 states and 330 transitions. [2019-05-23 09:23:07,524 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 200 [2019-05-23 09:23:07,524 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:07,524 INFO L146 ILogger]: trace histogram [65, 65, 65, 1, 1, 1, 1] [2019-05-23 09:23:07,524 INFO L146 ILogger]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:07,525 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:07,525 INFO L146 ILogger]: Analyzing trace with hash -288749589, now seen corresponding path program 65 times [2019-05-23 09:23:07,525 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:07,538 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:07,540 INFO L146 ILogger]: Trace formula consists of 268 conjuncts, 67 conjunts are in the unsatisfiable core [2019-05-23 09:23:07,543 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:09,924 INFO L146 ILogger]: Checked inductivity of 6305 backedges. 0 proven. 6305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:09,924 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:09,924 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-05-23 09:23:09,924 INFO L146 ILogger]: Interpolant automaton has 68 states [2019-05-23 09:23:09,925 INFO L146 ILogger]: Constructing interpolant automaton starting with 68 interpolants. [2019-05-23 09:23:09,925 INFO L146 ILogger]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 09:23:09,925 INFO L146 ILogger]: Start difference. First operand 265 states and 330 transitions. Second operand 68 states. [2019-05-23 09:23:11,101 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:11,101 INFO L146 ILogger]: Finished difference Result 270 states and 336 transitions. [2019-05-23 09:23:11,101 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-05-23 09:23:11,101 INFO L146 ILogger]: Start accepts. Automaton has 68 states. Word has length 199 [2019-05-23 09:23:11,102 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:11,103 INFO L146 ILogger]: With dead ends: 270 [2019-05-23 09:23:11,103 INFO L146 ILogger]: Without dead ends: 270 [2019-05-23 09:23:11,104 INFO L146 ILogger]: 0 DeclaredPredicates, 198 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 09:23:11,104 INFO L146 ILogger]: Start minimizeSevpa. Operand 270 states. [2019-05-23 09:23:11,106 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-05-23 09:23:11,106 INFO L146 ILogger]: Start removeUnreachable. Operand 269 states. [2019-05-23 09:23:11,107 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 269 states to 269 states and 335 transitions. [2019-05-23 09:23:11,107 INFO L146 ILogger]: Start accepts. Automaton has 269 states and 335 transitions. Word has length 199 [2019-05-23 09:23:11,107 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:11,107 INFO L146 ILogger]: Abstraction has 269 states and 335 transitions. [2019-05-23 09:23:11,107 INFO L146 ILogger]: Interpolant automaton has 68 states. [2019-05-23 09:23:11,107 INFO L146 ILogger]: Start isEmpty. Operand 269 states and 335 transitions. [2019-05-23 09:23:11,108 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 203 [2019-05-23 09:23:11,108 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:11,109 INFO L146 ILogger]: trace histogram [66, 66, 66, 1, 1, 1, 1] [2019-05-23 09:23:11,109 INFO L146 ILogger]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:11,109 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:11,109 INFO L146 ILogger]: Analyzing trace with hash 670967843, now seen corresponding path program 66 times [2019-05-23 09:23:11,110 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:11,122 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:11,124 INFO L146 ILogger]: Trace formula consists of 272 conjuncts, 68 conjunts are in the unsatisfiable core [2019-05-23 09:23:11,127 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:13,190 INFO L146 ILogger]: Checked inductivity of 6501 backedges. 0 proven. 6501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:13,191 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:13,191 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-05-23 09:23:13,191 INFO L146 ILogger]: Interpolant automaton has 69 states [2019-05-23 09:23:13,192 INFO L146 ILogger]: Constructing interpolant automaton starting with 69 interpolants. [2019-05-23 09:23:13,192 INFO L146 ILogger]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:23:13,192 INFO L146 ILogger]: Start difference. First operand 269 states and 335 transitions. Second operand 69 states. [2019-05-23 09:23:13,536 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:13,536 INFO L146 ILogger]: Finished difference Result 274 states and 341 transitions. [2019-05-23 09:23:13,536 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-05-23 09:23:13,537 INFO L146 ILogger]: Start accepts. Automaton has 69 states. Word has length 202 [2019-05-23 09:23:13,537 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:13,538 INFO L146 ILogger]: With dead ends: 274 [2019-05-23 09:23:13,538 INFO L146 ILogger]: Without dead ends: 274 [2019-05-23 09:23:13,539 INFO L146 ILogger]: 0 DeclaredPredicates, 201 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:23:13,539 INFO L146 ILogger]: Start minimizeSevpa. Operand 274 states. [2019-05-23 09:23:13,542 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-05-23 09:23:13,542 INFO L146 ILogger]: Start removeUnreachable. Operand 273 states. [2019-05-23 09:23:13,542 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 273 states to 273 states and 340 transitions. [2019-05-23 09:23:13,542 INFO L146 ILogger]: Start accepts. Automaton has 273 states and 340 transitions. Word has length 202 [2019-05-23 09:23:13,542 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:13,543 INFO L146 ILogger]: Abstraction has 273 states and 340 transitions. [2019-05-23 09:23:13,543 INFO L146 ILogger]: Interpolant automaton has 69 states. [2019-05-23 09:23:13,543 INFO L146 ILogger]: Start isEmpty. Operand 273 states and 340 transitions. [2019-05-23 09:23:13,543 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 206 [2019-05-23 09:23:13,543 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:13,544 INFO L146 ILogger]: trace histogram [67, 67, 67, 1, 1, 1, 1] [2019-05-23 09:23:13,544 INFO L146 ILogger]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:13,544 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:13,544 INFO L146 ILogger]: Analyzing trace with hash 15695083, now seen corresponding path program 67 times [2019-05-23 09:23:13,545 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:13,556 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:13,558 INFO L146 ILogger]: Trace formula consists of 276 conjuncts, 69 conjunts are in the unsatisfiable core [2019-05-23 09:23:13,561 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:15,186 INFO L146 ILogger]: Checked inductivity of 6700 backedges. 0 proven. 6700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:15,186 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:15,186 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-05-23 09:23:15,187 INFO L146 ILogger]: Interpolant automaton has 70 states [2019-05-23 09:23:15,187 INFO L146 ILogger]: Constructing interpolant automaton starting with 70 interpolants. [2019-05-23 09:23:15,188 INFO L146 ILogger]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 09:23:15,188 INFO L146 ILogger]: Start difference. First operand 273 states and 340 transitions. Second operand 70 states. [2019-05-23 09:23:15,591 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:15,592 INFO L146 ILogger]: Finished difference Result 278 states and 346 transitions. [2019-05-23 09:23:15,592 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-05-23 09:23:15,592 INFO L146 ILogger]: Start accepts. Automaton has 70 states. Word has length 205 [2019-05-23 09:23:15,592 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:15,594 INFO L146 ILogger]: With dead ends: 278 [2019-05-23 09:23:15,594 INFO L146 ILogger]: Without dead ends: 278 [2019-05-23 09:23:15,595 INFO L146 ILogger]: 0 DeclaredPredicates, 204 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 09:23:15,595 INFO L146 ILogger]: Start minimizeSevpa. Operand 278 states. [2019-05-23 09:23:15,597 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-05-23 09:23:15,597 INFO L146 ILogger]: Start removeUnreachable. Operand 277 states. [2019-05-23 09:23:15,598 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 277 states to 277 states and 345 transitions. [2019-05-23 09:23:15,598 INFO L146 ILogger]: Start accepts. Automaton has 277 states and 345 transitions. Word has length 205 [2019-05-23 09:23:15,598 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:15,598 INFO L146 ILogger]: Abstraction has 277 states and 345 transitions. [2019-05-23 09:23:15,598 INFO L146 ILogger]: Interpolant automaton has 70 states. [2019-05-23 09:23:15,598 INFO L146 ILogger]: Start isEmpty. Operand 277 states and 345 transitions. [2019-05-23 09:23:15,599 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 209 [2019-05-23 09:23:15,599 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:15,599 INFO L146 ILogger]: trace histogram [68, 68, 68, 1, 1, 1, 1] [2019-05-23 09:23:15,600 INFO L146 ILogger]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:15,600 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:15,600 INFO L146 ILogger]: Analyzing trace with hash -588737757, now seen corresponding path program 68 times [2019-05-23 09:23:15,601 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:15,615 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:15,617 INFO L146 ILogger]: Trace formula consists of 280 conjuncts, 70 conjunts are in the unsatisfiable core [2019-05-23 09:23:15,619 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:17,663 INFO L146 ILogger]: Checked inductivity of 6902 backedges. 0 proven. 6902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:17,664 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:17,664 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-05-23 09:23:17,665 INFO L146 ILogger]: Interpolant automaton has 71 states [2019-05-23 09:23:17,665 INFO L146 ILogger]: Constructing interpolant automaton starting with 71 interpolants. [2019-05-23 09:23:17,665 INFO L146 ILogger]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:23:17,665 INFO L146 ILogger]: Start difference. First operand 277 states and 345 transitions. Second operand 71 states. [2019-05-23 09:23:18,048 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:18,048 INFO L146 ILogger]: Finished difference Result 282 states and 351 transitions. [2019-05-23 09:23:18,048 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-05-23 09:23:18,048 INFO L146 ILogger]: Start accepts. Automaton has 71 states. Word has length 208 [2019-05-23 09:23:18,049 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:18,050 INFO L146 ILogger]: With dead ends: 282 [2019-05-23 09:23:18,050 INFO L146 ILogger]: Without dead ends: 282 [2019-05-23 09:23:18,051 INFO L146 ILogger]: 0 DeclaredPredicates, 207 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:23:18,051 INFO L146 ILogger]: Start minimizeSevpa. Operand 282 states. [2019-05-23 09:23:18,054 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-05-23 09:23:18,054 INFO L146 ILogger]: Start removeUnreachable. Operand 281 states. [2019-05-23 09:23:18,054 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 281 states to 281 states and 350 transitions. [2019-05-23 09:23:18,054 INFO L146 ILogger]: Start accepts. Automaton has 281 states and 350 transitions. Word has length 208 [2019-05-23 09:23:18,055 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:18,055 INFO L146 ILogger]: Abstraction has 281 states and 350 transitions. [2019-05-23 09:23:18,055 INFO L146 ILogger]: Interpolant automaton has 71 states. [2019-05-23 09:23:18,055 INFO L146 ILogger]: Start isEmpty. Operand 281 states and 350 transitions. [2019-05-23 09:23:18,056 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 212 [2019-05-23 09:23:18,056 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:18,056 INFO L146 ILogger]: trace histogram [69, 69, 69, 1, 1, 1, 1] [2019-05-23 09:23:18,056 INFO L146 ILogger]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:18,056 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:18,057 INFO L146 ILogger]: Analyzing trace with hash 1550397931, now seen corresponding path program 69 times [2019-05-23 09:23:18,057 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:18,070 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:18,072 INFO L146 ILogger]: Trace formula consists of 284 conjuncts, 71 conjunts are in the unsatisfiable core [2019-05-23 09:23:18,074 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:19,998 INFO L146 ILogger]: Checked inductivity of 7107 backedges. 0 proven. 7107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:19,998 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:19,998 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-05-23 09:23:19,998 INFO L146 ILogger]: Interpolant automaton has 72 states [2019-05-23 09:23:19,999 INFO L146 ILogger]: Constructing interpolant automaton starting with 72 interpolants. [2019-05-23 09:23:19,999 INFO L146 ILogger]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 09:23:19,999 INFO L146 ILogger]: Start difference. First operand 281 states and 350 transitions. Second operand 72 states. [2019-05-23 09:23:20,411 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:20,412 INFO L146 ILogger]: Finished difference Result 286 states and 356 transitions. [2019-05-23 09:23:20,412 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-23 09:23:20,412 INFO L146 ILogger]: Start accepts. Automaton has 72 states. Word has length 211 [2019-05-23 09:23:20,413 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:20,414 INFO L146 ILogger]: With dead ends: 286 [2019-05-23 09:23:20,414 INFO L146 ILogger]: Without dead ends: 286 [2019-05-23 09:23:20,415 INFO L146 ILogger]: 0 DeclaredPredicates, 210 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 09:23:20,415 INFO L146 ILogger]: Start minimizeSevpa. Operand 286 states. [2019-05-23 09:23:20,418 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-05-23 09:23:20,418 INFO L146 ILogger]: Start removeUnreachable. Operand 285 states. [2019-05-23 09:23:20,419 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 285 states to 285 states and 355 transitions. [2019-05-23 09:23:20,419 INFO L146 ILogger]: Start accepts. Automaton has 285 states and 355 transitions. Word has length 211 [2019-05-23 09:23:20,419 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:20,419 INFO L146 ILogger]: Abstraction has 285 states and 355 transitions. [2019-05-23 09:23:20,419 INFO L146 ILogger]: Interpolant automaton has 72 states. [2019-05-23 09:23:20,419 INFO L146 ILogger]: Start isEmpty. Operand 285 states and 355 transitions. [2019-05-23 09:23:20,420 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 215 [2019-05-23 09:23:20,420 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:20,420 INFO L146 ILogger]: trace histogram [70, 70, 70, 1, 1, 1, 1] [2019-05-23 09:23:20,421 INFO L146 ILogger]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:20,421 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:20,421 INFO L146 ILogger]: Analyzing trace with hash -183058909, now seen corresponding path program 70 times [2019-05-23 09:23:20,422 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:20,434 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:20,436 INFO L146 ILogger]: Trace formula consists of 288 conjuncts, 72 conjunts are in the unsatisfiable core [2019-05-23 09:23:20,438 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:22,384 INFO L146 ILogger]: Checked inductivity of 7315 backedges. 0 proven. 7315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:22,384 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:22,385 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-05-23 09:23:22,385 INFO L146 ILogger]: Interpolant automaton has 73 states [2019-05-23 09:23:22,385 INFO L146 ILogger]: Constructing interpolant automaton starting with 73 interpolants. [2019-05-23 09:23:22,386 INFO L146 ILogger]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:23:22,386 INFO L146 ILogger]: Start difference. First operand 285 states and 355 transitions. Second operand 73 states. [2019-05-23 09:23:22,839 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:22,839 INFO L146 ILogger]: Finished difference Result 290 states and 361 transitions. [2019-05-23 09:23:22,840 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-05-23 09:23:22,840 INFO L146 ILogger]: Start accepts. Automaton has 73 states. Word has length 214 [2019-05-23 09:23:22,840 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:22,842 INFO L146 ILogger]: With dead ends: 290 [2019-05-23 09:23:22,842 INFO L146 ILogger]: Without dead ends: 290 [2019-05-23 09:23:22,843 INFO L146 ILogger]: 0 DeclaredPredicates, 213 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:23:22,843 INFO L146 ILogger]: Start minimizeSevpa. Operand 290 states. [2019-05-23 09:23:22,845 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-05-23 09:23:22,845 INFO L146 ILogger]: Start removeUnreachable. Operand 289 states. [2019-05-23 09:23:22,846 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 289 states to 289 states and 360 transitions. [2019-05-23 09:23:22,846 INFO L146 ILogger]: Start accepts. Automaton has 289 states and 360 transitions. Word has length 214 [2019-05-23 09:23:22,846 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:22,846 INFO L146 ILogger]: Abstraction has 289 states and 360 transitions. [2019-05-23 09:23:22,846 INFO L146 ILogger]: Interpolant automaton has 73 states. [2019-05-23 09:23:22,846 INFO L146 ILogger]: Start isEmpty. Operand 289 states and 360 transitions. [2019-05-23 09:23:22,847 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 218 [2019-05-23 09:23:22,847 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:22,847 INFO L146 ILogger]: trace histogram [71, 71, 71, 1, 1, 1, 1] [2019-05-23 09:23:22,847 INFO L146 ILogger]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:22,847 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:22,848 INFO L146 ILogger]: Analyzing trace with hash 1090987755, now seen corresponding path program 71 times [2019-05-23 09:23:22,848 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:22,860 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:22,862 INFO L146 ILogger]: Trace formula consists of 292 conjuncts, 73 conjunts are in the unsatisfiable core [2019-05-23 09:23:22,865 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:24,682 INFO L146 ILogger]: Checked inductivity of 7526 backedges. 0 proven. 7526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:24,682 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:24,682 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-05-23 09:23:24,683 INFO L146 ILogger]: Interpolant automaton has 74 states [2019-05-23 09:23:24,683 INFO L146 ILogger]: Constructing interpolant automaton starting with 74 interpolants. [2019-05-23 09:23:24,683 INFO L146 ILogger]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 09:23:24,684 INFO L146 ILogger]: Start difference. First operand 289 states and 360 transitions. Second operand 74 states. [2019-05-23 09:23:25,106 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:25,106 INFO L146 ILogger]: Finished difference Result 294 states and 366 transitions. [2019-05-23 09:23:25,106 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-05-23 09:23:25,107 INFO L146 ILogger]: Start accepts. Automaton has 74 states. Word has length 217 [2019-05-23 09:23:25,107 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:25,108 INFO L146 ILogger]: With dead ends: 294 [2019-05-23 09:23:25,108 INFO L146 ILogger]: Without dead ends: 294 [2019-05-23 09:23:25,108 INFO L146 ILogger]: 0 DeclaredPredicates, 216 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 09:23:25,109 INFO L146 ILogger]: Start minimizeSevpa. Operand 294 states. [2019-05-23 09:23:25,110 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-05-23 09:23:25,110 INFO L146 ILogger]: Start removeUnreachable. Operand 293 states. [2019-05-23 09:23:25,111 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 293 states to 293 states and 365 transitions. [2019-05-23 09:23:25,111 INFO L146 ILogger]: Start accepts. Automaton has 293 states and 365 transitions. Word has length 217 [2019-05-23 09:23:25,111 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:25,111 INFO L146 ILogger]: Abstraction has 293 states and 365 transitions. [2019-05-23 09:23:25,111 INFO L146 ILogger]: Interpolant automaton has 74 states. [2019-05-23 09:23:25,111 INFO L146 ILogger]: Start isEmpty. Operand 293 states and 365 transitions. [2019-05-23 09:23:25,112 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 221 [2019-05-23 09:23:25,112 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:25,112 INFO L146 ILogger]: trace histogram [72, 72, 72, 1, 1, 1, 1] [2019-05-23 09:23:25,113 INFO L146 ILogger]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:25,113 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:25,113 INFO L146 ILogger]: Analyzing trace with hash 1589160227, now seen corresponding path program 72 times [2019-05-23 09:23:25,114 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:25,126 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:25,128 INFO L146 ILogger]: Trace formula consists of 296 conjuncts, 74 conjunts are in the unsatisfiable core [2019-05-23 09:23:25,130 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:27,118 INFO L146 ILogger]: Checked inductivity of 7740 backedges. 0 proven. 7740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:27,119 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:27,119 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-05-23 09:23:27,119 INFO L146 ILogger]: Interpolant automaton has 75 states [2019-05-23 09:23:27,120 INFO L146 ILogger]: Constructing interpolant automaton starting with 75 interpolants. [2019-05-23 09:23:27,120 INFO L146 ILogger]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:23:27,120 INFO L146 ILogger]: Start difference. First operand 293 states and 365 transitions. Second operand 75 states. [2019-05-23 09:23:27,645 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:27,645 INFO L146 ILogger]: Finished difference Result 298 states and 371 transitions. [2019-05-23 09:23:27,645 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-05-23 09:23:27,646 INFO L146 ILogger]: Start accepts. Automaton has 75 states. Word has length 220 [2019-05-23 09:23:27,646 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:27,649 INFO L146 ILogger]: With dead ends: 298 [2019-05-23 09:23:27,649 INFO L146 ILogger]: Without dead ends: 298 [2019-05-23 09:23:27,650 INFO L146 ILogger]: 0 DeclaredPredicates, 219 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:23:27,650 INFO L146 ILogger]: Start minimizeSevpa. Operand 298 states. [2019-05-23 09:23:27,652 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-05-23 09:23:27,652 INFO L146 ILogger]: Start removeUnreachable. Operand 297 states. [2019-05-23 09:23:27,653 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 297 states to 297 states and 370 transitions. [2019-05-23 09:23:27,653 INFO L146 ILogger]: Start accepts. Automaton has 297 states and 370 transitions. Word has length 220 [2019-05-23 09:23:27,653 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:27,653 INFO L146 ILogger]: Abstraction has 297 states and 370 transitions. [2019-05-23 09:23:27,653 INFO L146 ILogger]: Interpolant automaton has 75 states. [2019-05-23 09:23:27,653 INFO L146 ILogger]: Start isEmpty. Operand 297 states and 370 transitions. [2019-05-23 09:23:27,654 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 224 [2019-05-23 09:23:27,654 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:27,654 INFO L146 ILogger]: trace histogram [73, 73, 73, 1, 1, 1, 1] [2019-05-23 09:23:27,654 INFO L146 ILogger]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:27,654 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:27,655 INFO L146 ILogger]: Analyzing trace with hash -761701397, now seen corresponding path program 73 times [2019-05-23 09:23:27,655 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:27,668 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:27,670 INFO L146 ILogger]: Trace formula consists of 300 conjuncts, 75 conjunts are in the unsatisfiable core [2019-05-23 09:23:27,672 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:30,092 INFO L146 ILogger]: Checked inductivity of 7957 backedges. 0 proven. 7957 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:30,092 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:30,092 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-05-23 09:23:30,093 INFO L146 ILogger]: Interpolant automaton has 76 states [2019-05-23 09:23:30,093 INFO L146 ILogger]: Constructing interpolant automaton starting with 76 interpolants. [2019-05-23 09:23:30,093 INFO L146 ILogger]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 09:23:30,093 INFO L146 ILogger]: Start difference. First operand 297 states and 370 transitions. Second operand 76 states. [2019-05-23 09:23:30,540 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:30,540 INFO L146 ILogger]: Finished difference Result 302 states and 376 transitions. [2019-05-23 09:23:30,541 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-05-23 09:23:30,541 INFO L146 ILogger]: Start accepts. Automaton has 76 states. Word has length 223 [2019-05-23 09:23:30,541 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:30,543 INFO L146 ILogger]: With dead ends: 302 [2019-05-23 09:23:30,543 INFO L146 ILogger]: Without dead ends: 302 [2019-05-23 09:23:30,544 INFO L146 ILogger]: 0 DeclaredPredicates, 222 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 09:23:30,544 INFO L146 ILogger]: Start minimizeSevpa. Operand 302 states. [2019-05-23 09:23:30,546 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-05-23 09:23:30,546 INFO L146 ILogger]: Start removeUnreachable. Operand 301 states. [2019-05-23 09:23:30,546 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 301 states to 301 states and 375 transitions. [2019-05-23 09:23:30,546 INFO L146 ILogger]: Start accepts. Automaton has 301 states and 375 transitions. Word has length 223 [2019-05-23 09:23:30,547 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:30,547 INFO L146 ILogger]: Abstraction has 301 states and 375 transitions. [2019-05-23 09:23:30,547 INFO L146 ILogger]: Interpolant automaton has 76 states. [2019-05-23 09:23:30,547 INFO L146 ILogger]: Start isEmpty. Operand 301 states and 375 transitions. [2019-05-23 09:23:30,548 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 227 [2019-05-23 09:23:30,548 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:30,548 INFO L146 ILogger]: trace histogram [74, 74, 74, 1, 1, 1, 1] [2019-05-23 09:23:30,548 INFO L146 ILogger]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:30,548 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:30,548 INFO L146 ILogger]: Analyzing trace with hash -1543613405, now seen corresponding path program 74 times [2019-05-23 09:23:30,549 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:30,562 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:30,564 INFO L146 ILogger]: Trace formula consists of 304 conjuncts, 76 conjunts are in the unsatisfiable core [2019-05-23 09:23:30,566 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:32,844 INFO L146 ILogger]: Checked inductivity of 8177 backedges. 0 proven. 8177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:32,844 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:32,844 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-05-23 09:23:32,844 INFO L146 ILogger]: Interpolant automaton has 77 states [2019-05-23 09:23:32,845 INFO L146 ILogger]: Constructing interpolant automaton starting with 77 interpolants. [2019-05-23 09:23:32,845 INFO L146 ILogger]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:23:32,845 INFO L146 ILogger]: Start difference. First operand 301 states and 375 transitions. Second operand 77 states. [2019-05-23 09:23:33,393 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:33,393 INFO L146 ILogger]: Finished difference Result 306 states and 381 transitions. [2019-05-23 09:23:33,393 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-05-23 09:23:33,394 INFO L146 ILogger]: Start accepts. Automaton has 77 states. Word has length 226 [2019-05-23 09:23:33,394 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:33,396 INFO L146 ILogger]: With dead ends: 306 [2019-05-23 09:23:33,396 INFO L146 ILogger]: Without dead ends: 306 [2019-05-23 09:23:33,396 INFO L146 ILogger]: 0 DeclaredPredicates, 225 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:23:33,397 INFO L146 ILogger]: Start minimizeSevpa. Operand 306 states. [2019-05-23 09:23:33,399 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-05-23 09:23:33,399 INFO L146 ILogger]: Start removeUnreachable. Operand 305 states. [2019-05-23 09:23:33,399 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 305 states to 305 states and 380 transitions. [2019-05-23 09:23:33,399 INFO L146 ILogger]: Start accepts. Automaton has 305 states and 380 transitions. Word has length 226 [2019-05-23 09:23:33,400 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:33,400 INFO L146 ILogger]: Abstraction has 305 states and 380 transitions. [2019-05-23 09:23:33,400 INFO L146 ILogger]: Interpolant automaton has 77 states. [2019-05-23 09:23:33,400 INFO L146 ILogger]: Start isEmpty. Operand 305 states and 380 transitions. [2019-05-23 09:23:33,401 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 230 [2019-05-23 09:23:33,401 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:33,401 INFO L146 ILogger]: trace histogram [75, 75, 75, 1, 1, 1, 1] [2019-05-23 09:23:33,401 INFO L146 ILogger]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:33,401 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:33,401 INFO L146 ILogger]: Analyzing trace with hash 418369771, now seen corresponding path program 75 times [2019-05-23 09:23:33,402 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:33,415 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:33,417 INFO L146 ILogger]: Trace formula consists of 308 conjuncts, 77 conjunts are in the unsatisfiable core [2019-05-23 09:23:33,420 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:35,828 INFO L146 ILogger]: Checked inductivity of 8400 backedges. 0 proven. 8400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:35,828 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:35,828 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-05-23 09:23:35,829 INFO L146 ILogger]: Interpolant automaton has 78 states [2019-05-23 09:23:35,829 INFO L146 ILogger]: Constructing interpolant automaton starting with 78 interpolants. [2019-05-23 09:23:35,829 INFO L146 ILogger]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 09:23:35,829 INFO L146 ILogger]: Start difference. First operand 305 states and 380 transitions. Second operand 78 states. [2019-05-23 09:23:36,309 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:36,309 INFO L146 ILogger]: Finished difference Result 310 states and 386 transitions. [2019-05-23 09:23:36,309 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-23 09:23:36,309 INFO L146 ILogger]: Start accepts. Automaton has 78 states. Word has length 229 [2019-05-23 09:23:36,310 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:36,311 INFO L146 ILogger]: With dead ends: 310 [2019-05-23 09:23:36,311 INFO L146 ILogger]: Without dead ends: 310 [2019-05-23 09:23:36,312 INFO L146 ILogger]: 0 DeclaredPredicates, 228 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 09:23:36,312 INFO L146 ILogger]: Start minimizeSevpa. Operand 310 states. [2019-05-23 09:23:36,314 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-05-23 09:23:36,314 INFO L146 ILogger]: Start removeUnreachable. Operand 309 states. [2019-05-23 09:23:36,315 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 309 states to 309 states and 385 transitions. [2019-05-23 09:23:36,315 INFO L146 ILogger]: Start accepts. Automaton has 309 states and 385 transitions. Word has length 229 [2019-05-23 09:23:36,315 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:36,315 INFO L146 ILogger]: Abstraction has 309 states and 385 transitions. [2019-05-23 09:23:36,316 INFO L146 ILogger]: Interpolant automaton has 78 states. [2019-05-23 09:23:36,316 INFO L146 ILogger]: Start isEmpty. Operand 309 states and 385 transitions. [2019-05-23 09:23:36,317 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 233 [2019-05-23 09:23:36,317 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:36,317 INFO L146 ILogger]: trace histogram [76, 76, 76, 1, 1, 1, 1] [2019-05-23 09:23:36,317 INFO L146 ILogger]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:36,317 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:36,318 INFO L146 ILogger]: Analyzing trace with hash -350765277, now seen corresponding path program 76 times [2019-05-23 09:23:36,318 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:36,330 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:36,333 INFO L146 ILogger]: Trace formula consists of 312 conjuncts, 78 conjunts are in the unsatisfiable core [2019-05-23 09:23:36,335 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:38,757 INFO L146 ILogger]: Checked inductivity of 8626 backedges. 0 proven. 8626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:38,758 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:38,758 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-05-23 09:23:38,758 INFO L146 ILogger]: Interpolant automaton has 79 states [2019-05-23 09:23:38,759 INFO L146 ILogger]: Constructing interpolant automaton starting with 79 interpolants. [2019-05-23 09:23:38,759 INFO L146 ILogger]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:23:38,759 INFO L146 ILogger]: Start difference. First operand 309 states and 385 transitions. Second operand 79 states. [2019-05-23 09:23:39,268 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:39,268 INFO L146 ILogger]: Finished difference Result 314 states and 391 transitions. [2019-05-23 09:23:39,268 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-05-23 09:23:39,268 INFO L146 ILogger]: Start accepts. Automaton has 79 states. Word has length 232 [2019-05-23 09:23:39,269 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:39,270 INFO L146 ILogger]: With dead ends: 314 [2019-05-23 09:23:39,270 INFO L146 ILogger]: Without dead ends: 314 [2019-05-23 09:23:39,270 INFO L146 ILogger]: 0 DeclaredPredicates, 231 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:23:39,270 INFO L146 ILogger]: Start minimizeSevpa. Operand 314 states. [2019-05-23 09:23:39,272 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-05-23 09:23:39,272 INFO L146 ILogger]: Start removeUnreachable. Operand 313 states. [2019-05-23 09:23:39,273 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 313 states to 313 states and 390 transitions. [2019-05-23 09:23:39,273 INFO L146 ILogger]: Start accepts. Automaton has 313 states and 390 transitions. Word has length 232 [2019-05-23 09:23:39,273 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:39,273 INFO L146 ILogger]: Abstraction has 313 states and 390 transitions. [2019-05-23 09:23:39,273 INFO L146 ILogger]: Interpolant automaton has 79 states. [2019-05-23 09:23:39,273 INFO L146 ILogger]: Start isEmpty. Operand 313 states and 390 transitions. [2019-05-23 09:23:39,274 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 236 [2019-05-23 09:23:39,274 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:39,274 INFO L146 ILogger]: trace histogram [77, 77, 77, 1, 1, 1, 1] [2019-05-23 09:23:39,274 INFO L146 ILogger]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:39,274 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:39,275 INFO L146 ILogger]: Analyzing trace with hash -2456085, now seen corresponding path program 77 times [2019-05-23 09:23:39,275 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:39,285 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:39,287 INFO L146 ILogger]: Trace formula consists of 316 conjuncts, 79 conjunts are in the unsatisfiable core [2019-05-23 09:23:39,289 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:41,424 INFO L146 ILogger]: Checked inductivity of 8855 backedges. 0 proven. 8855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:41,424 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:41,424 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-05-23 09:23:41,424 INFO L146 ILogger]: Interpolant automaton has 80 states [2019-05-23 09:23:41,425 INFO L146 ILogger]: Constructing interpolant automaton starting with 80 interpolants. [2019-05-23 09:23:41,425 INFO L146 ILogger]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 09:23:41,425 INFO L146 ILogger]: Start difference. First operand 313 states and 390 transitions. Second operand 80 states. [2019-05-23 09:23:41,919 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:41,919 INFO L146 ILogger]: Finished difference Result 318 states and 396 transitions. [2019-05-23 09:23:41,920 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-05-23 09:23:41,920 INFO L146 ILogger]: Start accepts. Automaton has 80 states. Word has length 235 [2019-05-23 09:23:41,920 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:41,922 INFO L146 ILogger]: With dead ends: 318 [2019-05-23 09:23:41,922 INFO L146 ILogger]: Without dead ends: 318 [2019-05-23 09:23:41,923 INFO L146 ILogger]: 0 DeclaredPredicates, 234 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 09:23:41,923 INFO L146 ILogger]: Start minimizeSevpa. Operand 318 states. [2019-05-23 09:23:41,925 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-05-23 09:23:41,925 INFO L146 ILogger]: Start removeUnreachable. Operand 317 states. [2019-05-23 09:23:41,926 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 317 states to 317 states and 395 transitions. [2019-05-23 09:23:41,926 INFO L146 ILogger]: Start accepts. Automaton has 317 states and 395 transitions. Word has length 235 [2019-05-23 09:23:41,926 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:41,926 INFO L146 ILogger]: Abstraction has 317 states and 395 transitions. [2019-05-23 09:23:41,926 INFO L146 ILogger]: Interpolant automaton has 80 states. [2019-05-23 09:23:41,926 INFO L146 ILogger]: Start isEmpty. Operand 317 states and 395 transitions. [2019-05-23 09:23:41,927 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 239 [2019-05-23 09:23:41,927 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:41,928 INFO L146 ILogger]: trace histogram [78, 78, 78, 1, 1, 1, 1] [2019-05-23 09:23:41,928 INFO L146 ILogger]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:41,928 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:41,928 INFO L146 ILogger]: Analyzing trace with hash -164304349, now seen corresponding path program 78 times [2019-05-23 09:23:41,929 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:41,941 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:41,943 INFO L146 ILogger]: Trace formula consists of 320 conjuncts, 80 conjunts are in the unsatisfiable core [2019-05-23 09:23:41,946 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:44,617 INFO L146 ILogger]: Checked inductivity of 9087 backedges. 0 proven. 9087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:44,617 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:44,618 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-05-23 09:23:44,618 INFO L146 ILogger]: Interpolant automaton has 81 states [2019-05-23 09:23:44,619 INFO L146 ILogger]: Constructing interpolant automaton starting with 81 interpolants. [2019-05-23 09:23:44,619 INFO L146 ILogger]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:23:44,619 INFO L146 ILogger]: Start difference. First operand 317 states and 395 transitions. Second operand 81 states. [2019-05-23 09:23:45,165 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:45,165 INFO L146 ILogger]: Finished difference Result 322 states and 401 transitions. [2019-05-23 09:23:45,165 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-05-23 09:23:45,165 INFO L146 ILogger]: Start accepts. Automaton has 81 states. Word has length 238 [2019-05-23 09:23:45,166 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:45,168 INFO L146 ILogger]: With dead ends: 322 [2019-05-23 09:23:45,168 INFO L146 ILogger]: Without dead ends: 322 [2019-05-23 09:23:45,168 INFO L146 ILogger]: 0 DeclaredPredicates, 237 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:23:45,169 INFO L146 ILogger]: Start minimizeSevpa. Operand 322 states. [2019-05-23 09:23:45,171 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-05-23 09:23:45,171 INFO L146 ILogger]: Start removeUnreachable. Operand 321 states. [2019-05-23 09:23:45,171 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 321 states to 321 states and 400 transitions. [2019-05-23 09:23:45,172 INFO L146 ILogger]: Start accepts. Automaton has 321 states and 400 transitions. Word has length 238 [2019-05-23 09:23:45,172 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:45,172 INFO L146 ILogger]: Abstraction has 321 states and 400 transitions. [2019-05-23 09:23:45,172 INFO L146 ILogger]: Interpolant automaton has 81 states. [2019-05-23 09:23:45,172 INFO L146 ILogger]: Start isEmpty. Operand 321 states and 400 transitions. [2019-05-23 09:23:45,173 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 242 [2019-05-23 09:23:45,173 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:45,173 INFO L146 ILogger]: trace histogram [79, 79, 79, 1, 1, 1, 1] [2019-05-23 09:23:45,173 INFO L146 ILogger]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:45,173 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:45,173 INFO L146 ILogger]: Analyzing trace with hash 1462336235, now seen corresponding path program 79 times [2019-05-23 09:23:45,174 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:45,187 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:45,189 INFO L146 ILogger]: Trace formula consists of 324 conjuncts, 81 conjunts are in the unsatisfiable core [2019-05-23 09:23:45,191 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:47,577 INFO L146 ILogger]: Checked inductivity of 9322 backedges. 0 proven. 9322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:47,578 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:47,578 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-05-23 09:23:47,578 INFO L146 ILogger]: Interpolant automaton has 82 states [2019-05-23 09:23:47,579 INFO L146 ILogger]: Constructing interpolant automaton starting with 82 interpolants. [2019-05-23 09:23:47,579 INFO L146 ILogger]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 09:23:47,579 INFO L146 ILogger]: Start difference. First operand 321 states and 400 transitions. Second operand 82 states. [2019-05-23 09:23:48,172 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:48,172 INFO L146 ILogger]: Finished difference Result 326 states and 406 transitions. [2019-05-23 09:23:48,172 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-05-23 09:23:48,172 INFO L146 ILogger]: Start accepts. Automaton has 82 states. Word has length 241 [2019-05-23 09:23:48,173 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:48,174 INFO L146 ILogger]: With dead ends: 326 [2019-05-23 09:23:48,174 INFO L146 ILogger]: Without dead ends: 326 [2019-05-23 09:23:48,174 INFO L146 ILogger]: 0 DeclaredPredicates, 240 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 09:23:48,174 INFO L146 ILogger]: Start minimizeSevpa. Operand 326 states. [2019-05-23 09:23:48,176 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-05-23 09:23:48,176 INFO L146 ILogger]: Start removeUnreachable. Operand 325 states. [2019-05-23 09:23:48,177 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 325 states to 325 states and 405 transitions. [2019-05-23 09:23:48,177 INFO L146 ILogger]: Start accepts. Automaton has 325 states and 405 transitions. Word has length 241 [2019-05-23 09:23:48,177 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:48,177 INFO L146 ILogger]: Abstraction has 325 states and 405 transitions. [2019-05-23 09:23:48,177 INFO L146 ILogger]: Interpolant automaton has 82 states. [2019-05-23 09:23:48,177 INFO L146 ILogger]: Start isEmpty. Operand 325 states and 405 transitions. [2019-05-23 09:23:48,178 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 245 [2019-05-23 09:23:48,178 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:48,178 INFO L146 ILogger]: trace histogram [80, 80, 80, 1, 1, 1, 1] [2019-05-23 09:23:48,178 INFO L146 ILogger]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:48,179 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:48,179 INFO L146 ILogger]: Analyzing trace with hash 595973411, now seen corresponding path program 80 times [2019-05-23 09:23:48,179 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:48,191 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:48,193 INFO L146 ILogger]: Trace formula consists of 328 conjuncts, 82 conjunts are in the unsatisfiable core [2019-05-23 09:23:48,195 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:50,447 INFO L146 ILogger]: Checked inductivity of 9560 backedges. 0 proven. 9560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:50,448 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:50,448 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-05-23 09:23:50,448 INFO L146 ILogger]: Interpolant automaton has 83 states [2019-05-23 09:23:50,449 INFO L146 ILogger]: Constructing interpolant automaton starting with 83 interpolants. [2019-05-23 09:23:50,449 INFO L146 ILogger]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:23:50,449 INFO L146 ILogger]: Start difference. First operand 325 states and 405 transitions. Second operand 83 states. [2019-05-23 09:23:51,068 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:51,069 INFO L146 ILogger]: Finished difference Result 330 states and 411 transitions. [2019-05-23 09:23:51,069 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-05-23 09:23:51,069 INFO L146 ILogger]: Start accepts. Automaton has 83 states. Word has length 244 [2019-05-23 09:23:51,070 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:51,071 INFO L146 ILogger]: With dead ends: 330 [2019-05-23 09:23:51,072 INFO L146 ILogger]: Without dead ends: 330 [2019-05-23 09:23:51,072 INFO L146 ILogger]: 0 DeclaredPredicates, 243 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:23:51,073 INFO L146 ILogger]: Start minimizeSevpa. Operand 330 states. [2019-05-23 09:23:51,075 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-05-23 09:23:51,075 INFO L146 ILogger]: Start removeUnreachable. Operand 329 states. [2019-05-23 09:23:51,076 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 329 states to 329 states and 410 transitions. [2019-05-23 09:23:51,076 INFO L146 ILogger]: Start accepts. Automaton has 329 states and 410 transitions. Word has length 244 [2019-05-23 09:23:51,076 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:51,076 INFO L146 ILogger]: Abstraction has 329 states and 410 transitions. [2019-05-23 09:23:51,076 INFO L146 ILogger]: Interpolant automaton has 83 states. [2019-05-23 09:23:51,076 INFO L146 ILogger]: Start isEmpty. Operand 329 states and 410 transitions. [2019-05-23 09:23:51,077 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 248 [2019-05-23 09:23:51,077 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:51,077 INFO L146 ILogger]: trace histogram [81, 81, 81, 1, 1, 1, 1] [2019-05-23 09:23:51,077 INFO L146 ILogger]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:51,077 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:51,078 INFO L146 ILogger]: Analyzing trace with hash -760434709, now seen corresponding path program 81 times [2019-05-23 09:23:51,078 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:51,089 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:51,091 INFO L146 ILogger]: Trace formula consists of 332 conjuncts, 83 conjunts are in the unsatisfiable core [2019-05-23 09:23:51,093 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:53,718 INFO L146 ILogger]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:53,719 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:53,719 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-05-23 09:23:53,719 INFO L146 ILogger]: Interpolant automaton has 84 states [2019-05-23 09:23:53,720 INFO L146 ILogger]: Constructing interpolant automaton starting with 84 interpolants. [2019-05-23 09:23:53,720 INFO L146 ILogger]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 09:23:53,720 INFO L146 ILogger]: Start difference. First operand 329 states and 410 transitions. Second operand 84 states. [2019-05-23 09:23:54,320 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:54,320 INFO L146 ILogger]: Finished difference Result 334 states and 416 transitions. [2019-05-23 09:23:54,321 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-23 09:23:54,321 INFO L146 ILogger]: Start accepts. Automaton has 84 states. Word has length 247 [2019-05-23 09:23:54,321 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:54,323 INFO L146 ILogger]: With dead ends: 334 [2019-05-23 09:23:54,323 INFO L146 ILogger]: Without dead ends: 334 [2019-05-23 09:23:54,324 INFO L146 ILogger]: 0 DeclaredPredicates, 246 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 09:23:54,324 INFO L146 ILogger]: Start minimizeSevpa. Operand 334 states. [2019-05-23 09:23:54,326 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-05-23 09:23:54,326 INFO L146 ILogger]: Start removeUnreachable. Operand 333 states. [2019-05-23 09:23:54,326 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 333 states to 333 states and 415 transitions. [2019-05-23 09:23:54,326 INFO L146 ILogger]: Start accepts. Automaton has 333 states and 415 transitions. Word has length 247 [2019-05-23 09:23:54,327 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:54,327 INFO L146 ILogger]: Abstraction has 333 states and 415 transitions. [2019-05-23 09:23:54,327 INFO L146 ILogger]: Interpolant automaton has 84 states. [2019-05-23 09:23:54,327 INFO L146 ILogger]: Start isEmpty. Operand 333 states and 415 transitions. [2019-05-23 09:23:54,328 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 251 [2019-05-23 09:23:54,328 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:54,328 INFO L146 ILogger]: trace histogram [82, 82, 82, 1, 1, 1, 1] [2019-05-23 09:23:54,328 INFO L146 ILogger]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:54,328 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:54,328 INFO L146 ILogger]: Analyzing trace with hash 1832550435, now seen corresponding path program 82 times [2019-05-23 09:23:54,329 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:54,340 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:54,342 INFO L146 ILogger]: Trace formula consists of 336 conjuncts, 84 conjunts are in the unsatisfiable core [2019-05-23 09:23:54,344 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:56,960 INFO L146 ILogger]: Checked inductivity of 10045 backedges. 0 proven. 10045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:56,961 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:56,961 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-05-23 09:23:56,961 INFO L146 ILogger]: Interpolant automaton has 85 states [2019-05-23 09:23:56,961 INFO L146 ILogger]: Constructing interpolant automaton starting with 85 interpolants. [2019-05-23 09:23:56,962 INFO L146 ILogger]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:23:56,962 INFO L146 ILogger]: Start difference. First operand 333 states and 415 transitions. Second operand 85 states. [2019-05-23 09:23:57,581 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:57,581 INFO L146 ILogger]: Finished difference Result 338 states and 421 transitions. [2019-05-23 09:23:57,581 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-05-23 09:23:57,582 INFO L146 ILogger]: Start accepts. Automaton has 85 states. Word has length 250 [2019-05-23 09:23:57,582 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:57,584 INFO L146 ILogger]: With dead ends: 338 [2019-05-23 09:23:57,584 INFO L146 ILogger]: Without dead ends: 338 [2019-05-23 09:23:57,584 INFO L146 ILogger]: 0 DeclaredPredicates, 249 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:23:57,585 INFO L146 ILogger]: Start minimizeSevpa. Operand 338 states. [2019-05-23 09:23:57,587 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-05-23 09:23:57,587 INFO L146 ILogger]: Start removeUnreachable. Operand 337 states. [2019-05-23 09:23:57,587 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 337 states to 337 states and 420 transitions. [2019-05-23 09:23:57,588 INFO L146 ILogger]: Start accepts. Automaton has 337 states and 420 transitions. Word has length 250 [2019-05-23 09:23:57,588 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:57,588 INFO L146 ILogger]: Abstraction has 337 states and 420 transitions. [2019-05-23 09:23:57,588 INFO L146 ILogger]: Interpolant automaton has 85 states. [2019-05-23 09:23:57,588 INFO L146 ILogger]: Start isEmpty. Operand 337 states and 420 transitions. [2019-05-23 09:23:57,589 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 254 [2019-05-23 09:23:57,589 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:57,589 INFO L146 ILogger]: trace histogram [83, 83, 83, 1, 1, 1, 1] [2019-05-23 09:23:57,589 INFO L146 ILogger]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:57,589 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:57,589 INFO L146 ILogger]: Analyzing trace with hash 171189483, now seen corresponding path program 83 times [2019-05-23 09:23:57,590 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:57,603 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:57,605 INFO L146 ILogger]: Trace formula consists of 340 conjuncts, 85 conjunts are in the unsatisfiable core [2019-05-23 09:23:57,607 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:00,320 INFO L146 ILogger]: Checked inductivity of 10292 backedges. 0 proven. 10292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:00,320 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:00,320 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-05-23 09:24:00,320 INFO L146 ILogger]: Interpolant automaton has 86 states [2019-05-23 09:24:00,321 INFO L146 ILogger]: Constructing interpolant automaton starting with 86 interpolants. [2019-05-23 09:24:00,321 INFO L146 ILogger]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 09:24:00,321 INFO L146 ILogger]: Start difference. First operand 337 states and 420 transitions. Second operand 86 states. [2019-05-23 09:24:00,991 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:00,991 INFO L146 ILogger]: Finished difference Result 342 states and 426 transitions. [2019-05-23 09:24:00,991 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-05-23 09:24:00,992 INFO L146 ILogger]: Start accepts. Automaton has 86 states. Word has length 253 [2019-05-23 09:24:00,992 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:00,994 INFO L146 ILogger]: With dead ends: 342 [2019-05-23 09:24:00,994 INFO L146 ILogger]: Without dead ends: 342 [2019-05-23 09:24:00,994 INFO L146 ILogger]: 0 DeclaredPredicates, 252 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 09:24:00,995 INFO L146 ILogger]: Start minimizeSevpa. Operand 342 states. [2019-05-23 09:24:00,998 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-05-23 09:24:00,998 INFO L146 ILogger]: Start removeUnreachable. Operand 341 states. [2019-05-23 09:24:00,998 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 341 states to 341 states and 425 transitions. [2019-05-23 09:24:00,998 INFO L146 ILogger]: Start accepts. Automaton has 341 states and 425 transitions. Word has length 253 [2019-05-23 09:24:00,998 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:00,998 INFO L146 ILogger]: Abstraction has 341 states and 425 transitions. [2019-05-23 09:24:00,999 INFO L146 ILogger]: Interpolant automaton has 86 states. [2019-05-23 09:24:00,999 INFO L146 ILogger]: Start isEmpty. Operand 341 states and 425 transitions. [2019-05-23 09:24:00,999 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 257 [2019-05-23 09:24:00,999 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:01,000 INFO L146 ILogger]: trace histogram [84, 84, 84, 1, 1, 1, 1] [2019-05-23 09:24:01,000 INFO L146 ILogger]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:01,000 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:01,000 INFO L146 ILogger]: Analyzing trace with hash 1770187555, now seen corresponding path program 84 times [2019-05-23 09:24:01,001 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:01,010 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:01,012 INFO L146 ILogger]: Trace formula consists of 344 conjuncts, 86 conjunts are in the unsatisfiable core [2019-05-23 09:24:01,013 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:03,863 INFO L146 ILogger]: Checked inductivity of 10542 backedges. 0 proven. 10542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:03,863 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:03,863 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-05-23 09:24:03,864 INFO L146 ILogger]: Interpolant automaton has 87 states [2019-05-23 09:24:03,864 INFO L146 ILogger]: Constructing interpolant automaton starting with 87 interpolants. [2019-05-23 09:24:03,865 INFO L146 ILogger]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:24:03,865 INFO L146 ILogger]: Start difference. First operand 341 states and 425 transitions. Second operand 87 states. [2019-05-23 09:24:04,494 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:04,494 INFO L146 ILogger]: Finished difference Result 346 states and 431 transitions. [2019-05-23 09:24:04,494 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-05-23 09:24:04,494 INFO L146 ILogger]: Start accepts. Automaton has 87 states. Word has length 256 [2019-05-23 09:24:04,495 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:04,496 INFO L146 ILogger]: With dead ends: 346 [2019-05-23 09:24:04,496 INFO L146 ILogger]: Without dead ends: 346 [2019-05-23 09:24:04,497 INFO L146 ILogger]: 0 DeclaredPredicates, 255 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:24:04,498 INFO L146 ILogger]: Start minimizeSevpa. Operand 346 states. [2019-05-23 09:24:04,500 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-05-23 09:24:04,500 INFO L146 ILogger]: Start removeUnreachable. Operand 345 states. [2019-05-23 09:24:04,500 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 345 states to 345 states and 430 transitions. [2019-05-23 09:24:04,501 INFO L146 ILogger]: Start accepts. Automaton has 345 states and 430 transitions. Word has length 256 [2019-05-23 09:24:04,501 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:04,501 INFO L146 ILogger]: Abstraction has 345 states and 430 transitions. [2019-05-23 09:24:04,501 INFO L146 ILogger]: Interpolant automaton has 87 states. [2019-05-23 09:24:04,501 INFO L146 ILogger]: Start isEmpty. Operand 345 states and 430 transitions. [2019-05-23 09:24:04,502 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 260 [2019-05-23 09:24:04,502 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:04,502 INFO L146 ILogger]: trace histogram [85, 85, 85, 1, 1, 1, 1] [2019-05-23 09:24:04,503 INFO L146 ILogger]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:04,503 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:04,503 INFO L146 ILogger]: Analyzing trace with hash 2039470571, now seen corresponding path program 85 times [2019-05-23 09:24:04,504 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:04,513 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:04,515 INFO L146 ILogger]: Trace formula consists of 348 conjuncts, 87 conjunts are in the unsatisfiable core [2019-05-23 09:24:04,517 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:07,060 INFO L146 ILogger]: Checked inductivity of 10795 backedges. 0 proven. 10795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:07,061 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:07,061 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-05-23 09:24:07,061 INFO L146 ILogger]: Interpolant automaton has 88 states [2019-05-23 09:24:07,062 INFO L146 ILogger]: Constructing interpolant automaton starting with 88 interpolants. [2019-05-23 09:24:07,062 INFO L146 ILogger]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 09:24:07,062 INFO L146 ILogger]: Start difference. First operand 345 states and 430 transitions. Second operand 88 states. [2019-05-23 09:24:07,782 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:07,783 INFO L146 ILogger]: Finished difference Result 350 states and 436 transitions. [2019-05-23 09:24:07,783 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-05-23 09:24:07,783 INFO L146 ILogger]: Start accepts. Automaton has 88 states. Word has length 259 [2019-05-23 09:24:07,784 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:07,785 INFO L146 ILogger]: With dead ends: 350 [2019-05-23 09:24:07,786 INFO L146 ILogger]: Without dead ends: 350 [2019-05-23 09:24:07,786 INFO L146 ILogger]: 0 DeclaredPredicates, 258 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 09:24:07,787 INFO L146 ILogger]: Start minimizeSevpa. Operand 350 states. [2019-05-23 09:24:07,789 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-05-23 09:24:07,789 INFO L146 ILogger]: Start removeUnreachable. Operand 349 states. [2019-05-23 09:24:07,790 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 349 states to 349 states and 435 transitions. [2019-05-23 09:24:07,790 INFO L146 ILogger]: Start accepts. Automaton has 349 states and 435 transitions. Word has length 259 [2019-05-23 09:24:07,790 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:07,790 INFO L146 ILogger]: Abstraction has 349 states and 435 transitions. [2019-05-23 09:24:07,790 INFO L146 ILogger]: Interpolant automaton has 88 states. [2019-05-23 09:24:07,790 INFO L146 ILogger]: Start isEmpty. Operand 349 states and 435 transitions. [2019-05-23 09:24:07,791 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 263 [2019-05-23 09:24:07,791 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:07,791 INFO L146 ILogger]: trace histogram [86, 86, 86, 1, 1, 1, 1] [2019-05-23 09:24:07,792 INFO L146 ILogger]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:07,792 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:07,792 INFO L146 ILogger]: Analyzing trace with hash 1250891299, now seen corresponding path program 86 times [2019-05-23 09:24:07,792 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:07,801 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:07,804 INFO L146 ILogger]: Trace formula consists of 352 conjuncts, 88 conjunts are in the unsatisfiable core [2019-05-23 09:24:07,806 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:10,767 INFO L146 ILogger]: Checked inductivity of 11051 backedges. 0 proven. 11051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:10,768 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:10,768 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-05-23 09:24:10,768 INFO L146 ILogger]: Interpolant automaton has 89 states [2019-05-23 09:24:10,769 INFO L146 ILogger]: Constructing interpolant automaton starting with 89 interpolants. [2019-05-23 09:24:10,769 INFO L146 ILogger]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:24:10,769 INFO L146 ILogger]: Start difference. First operand 349 states and 435 transitions. Second operand 89 states. [2019-05-23 09:24:11,521 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:11,521 INFO L146 ILogger]: Finished difference Result 354 states and 441 transitions. [2019-05-23 09:24:11,521 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-05-23 09:24:11,522 INFO L146 ILogger]: Start accepts. Automaton has 89 states. Word has length 262 [2019-05-23 09:24:11,522 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:11,524 INFO L146 ILogger]: With dead ends: 354 [2019-05-23 09:24:11,524 INFO L146 ILogger]: Without dead ends: 354 [2019-05-23 09:24:11,525 INFO L146 ILogger]: 0 DeclaredPredicates, 261 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:24:11,525 INFO L146 ILogger]: Start minimizeSevpa. Operand 354 states. [2019-05-23 09:24:11,527 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-05-23 09:24:11,528 INFO L146 ILogger]: Start removeUnreachable. Operand 353 states. [2019-05-23 09:24:11,528 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 353 states to 353 states and 440 transitions. [2019-05-23 09:24:11,528 INFO L146 ILogger]: Start accepts. Automaton has 353 states and 440 transitions. Word has length 262 [2019-05-23 09:24:11,528 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:11,528 INFO L146 ILogger]: Abstraction has 353 states and 440 transitions. [2019-05-23 09:24:11,528 INFO L146 ILogger]: Interpolant automaton has 89 states. [2019-05-23 09:24:11,528 INFO L146 ILogger]: Start isEmpty. Operand 353 states and 440 transitions. [2019-05-23 09:24:11,529 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 266 [2019-05-23 09:24:11,529 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:11,530 INFO L146 ILogger]: trace histogram [87, 87, 87, 1, 1, 1, 1] [2019-05-23 09:24:11,530 INFO L146 ILogger]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:11,530 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:11,530 INFO L146 ILogger]: Analyzing trace with hash -2138059029, now seen corresponding path program 87 times [2019-05-23 09:24:11,531 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:11,540 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:11,542 INFO L146 ILogger]: Trace formula consists of 356 conjuncts, 89 conjunts are in the unsatisfiable core [2019-05-23 09:24:11,544 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:14,374 INFO L146 ILogger]: Checked inductivity of 11310 backedges. 0 proven. 11310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:14,374 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:14,374 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-05-23 09:24:14,374 INFO L146 ILogger]: Interpolant automaton has 90 states [2019-05-23 09:24:14,375 INFO L146 ILogger]: Constructing interpolant automaton starting with 90 interpolants. [2019-05-23 09:24:14,375 INFO L146 ILogger]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 09:24:14,375 INFO L146 ILogger]: Start difference. First operand 353 states and 440 transitions. Second operand 90 states. [2019-05-23 09:24:15,112 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:15,113 INFO L146 ILogger]: Finished difference Result 358 states and 446 transitions. [2019-05-23 09:24:15,113 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-23 09:24:15,113 INFO L146 ILogger]: Start accepts. Automaton has 90 states. Word has length 265 [2019-05-23 09:24:15,114 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:15,116 INFO L146 ILogger]: With dead ends: 358 [2019-05-23 09:24:15,116 INFO L146 ILogger]: Without dead ends: 358 [2019-05-23 09:24:15,116 INFO L146 ILogger]: 0 DeclaredPredicates, 264 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 09:24:15,117 INFO L146 ILogger]: Start minimizeSevpa. Operand 358 states. [2019-05-23 09:24:15,119 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-05-23 09:24:15,119 INFO L146 ILogger]: Start removeUnreachable. Operand 357 states. [2019-05-23 09:24:15,120 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 357 states to 357 states and 445 transitions. [2019-05-23 09:24:15,120 INFO L146 ILogger]: Start accepts. Automaton has 357 states and 445 transitions. Word has length 265 [2019-05-23 09:24:15,120 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:15,120 INFO L146 ILogger]: Abstraction has 357 states and 445 transitions. [2019-05-23 09:24:15,120 INFO L146 ILogger]: Interpolant automaton has 90 states. [2019-05-23 09:24:15,120 INFO L146 ILogger]: Start isEmpty. Operand 357 states and 445 transitions. [2019-05-23 09:24:15,121 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 269 [2019-05-23 09:24:15,121 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:15,121 INFO L146 ILogger]: trace histogram [88, 88, 88, 1, 1, 1, 1] [2019-05-23 09:24:15,121 INFO L146 ILogger]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:15,122 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:15,122 INFO L146 ILogger]: Analyzing trace with hash -561053405, now seen corresponding path program 88 times [2019-05-23 09:24:15,122 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:15,135 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:15,138 INFO L146 ILogger]: Trace formula consists of 360 conjuncts, 90 conjunts are in the unsatisfiable core [2019-05-23 09:24:15,141 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:18,000 INFO L146 ILogger]: Checked inductivity of 11572 backedges. 0 proven. 11572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:18,000 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:18,001 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-05-23 09:24:18,001 INFO L146 ILogger]: Interpolant automaton has 91 states [2019-05-23 09:24:18,001 INFO L146 ILogger]: Constructing interpolant automaton starting with 91 interpolants. [2019-05-23 09:24:18,002 INFO L146 ILogger]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:24:18,002 INFO L146 ILogger]: Start difference. First operand 357 states and 445 transitions. Second operand 91 states. [2019-05-23 09:24:19,061 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:19,062 INFO L146 ILogger]: Finished difference Result 362 states and 451 transitions. [2019-05-23 09:24:19,062 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-05-23 09:24:19,062 INFO L146 ILogger]: Start accepts. Automaton has 91 states. Word has length 268 [2019-05-23 09:24:19,063 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:19,065 INFO L146 ILogger]: With dead ends: 362 [2019-05-23 09:24:19,065 INFO L146 ILogger]: Without dead ends: 362 [2019-05-23 09:24:19,065 INFO L146 ILogger]: 0 DeclaredPredicates, 267 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:24:19,066 INFO L146 ILogger]: Start minimizeSevpa. Operand 362 states. [2019-05-23 09:24:19,069 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-05-23 09:24:19,070 INFO L146 ILogger]: Start removeUnreachable. Operand 361 states. [2019-05-23 09:24:19,070 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 361 states to 361 states and 450 transitions. [2019-05-23 09:24:19,070 INFO L146 ILogger]: Start accepts. Automaton has 361 states and 450 transitions. Word has length 268 [2019-05-23 09:24:19,071 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:19,071 INFO L146 ILogger]: Abstraction has 361 states and 450 transitions. [2019-05-23 09:24:19,071 INFO L146 ILogger]: Interpolant automaton has 91 states. [2019-05-23 09:24:19,071 INFO L146 ILogger]: Start isEmpty. Operand 361 states and 450 transitions. [2019-05-23 09:24:19,072 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 272 [2019-05-23 09:24:19,072 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:19,072 INFO L146 ILogger]: trace histogram [89, 89, 89, 1, 1, 1, 1] [2019-05-23 09:24:19,072 INFO L146 ILogger]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:19,072 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:19,073 INFO L146 ILogger]: Analyzing trace with hash 1661207531, now seen corresponding path program 89 times [2019-05-23 09:24:19,073 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:19,084 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:19,087 INFO L146 ILogger]: Trace formula consists of 364 conjuncts, 91 conjunts are in the unsatisfiable core [2019-05-23 09:24:19,089 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:21,978 INFO L146 ILogger]: Checked inductivity of 11837 backedges. 0 proven. 11837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:21,979 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:21,979 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-05-23 09:24:21,979 INFO L146 ILogger]: Interpolant automaton has 92 states [2019-05-23 09:24:21,980 INFO L146 ILogger]: Constructing interpolant automaton starting with 92 interpolants. [2019-05-23 09:24:21,980 INFO L146 ILogger]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 09:24:21,980 INFO L146 ILogger]: Start difference. First operand 361 states and 450 transitions. Second operand 92 states. [2019-05-23 09:24:22,784 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:22,784 INFO L146 ILogger]: Finished difference Result 366 states and 456 transitions. [2019-05-23 09:24:22,784 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-05-23 09:24:22,784 INFO L146 ILogger]: Start accepts. Automaton has 92 states. Word has length 271 [2019-05-23 09:24:22,785 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:22,787 INFO L146 ILogger]: With dead ends: 366 [2019-05-23 09:24:22,787 INFO L146 ILogger]: Without dead ends: 366 [2019-05-23 09:24:22,788 INFO L146 ILogger]: 0 DeclaredPredicates, 270 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 09:24:22,788 INFO L146 ILogger]: Start minimizeSevpa. Operand 366 states. [2019-05-23 09:24:22,791 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 366 to 365. [2019-05-23 09:24:22,791 INFO L146 ILogger]: Start removeUnreachable. Operand 365 states. [2019-05-23 09:24:22,791 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 365 states to 365 states and 455 transitions. [2019-05-23 09:24:22,791 INFO L146 ILogger]: Start accepts. Automaton has 365 states and 455 transitions. Word has length 271 [2019-05-23 09:24:22,791 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:22,791 INFO L146 ILogger]: Abstraction has 365 states and 455 transitions. [2019-05-23 09:24:22,791 INFO L146 ILogger]: Interpolant automaton has 92 states. [2019-05-23 09:24:22,792 INFO L146 ILogger]: Start isEmpty. Operand 365 states and 455 transitions. [2019-05-23 09:24:22,792 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 275 [2019-05-23 09:24:22,792 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:22,793 INFO L146 ILogger]: trace histogram [90, 90, 90, 1, 1, 1, 1] [2019-05-23 09:24:22,793 INFO L146 ILogger]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:22,793 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:22,793 INFO L146 ILogger]: Analyzing trace with hash -1884115933, now seen corresponding path program 90 times [2019-05-23 09:24:22,794 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:22,803 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:22,805 INFO L146 ILogger]: Trace formula consists of 368 conjuncts, 92 conjunts are in the unsatisfiable core [2019-05-23 09:24:22,807 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:25,880 INFO L146 ILogger]: Checked inductivity of 12105 backedges. 0 proven. 12105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:25,880 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:25,880 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-05-23 09:24:25,881 INFO L146 ILogger]: Interpolant automaton has 93 states [2019-05-23 09:24:25,881 INFO L146 ILogger]: Constructing interpolant automaton starting with 93 interpolants. [2019-05-23 09:24:25,882 INFO L146 ILogger]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:24:25,882 INFO L146 ILogger]: Start difference. First operand 365 states and 455 transitions. Second operand 93 states. [2019-05-23 09:24:26,712 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:26,712 INFO L146 ILogger]: Finished difference Result 370 states and 461 transitions. [2019-05-23 09:24:26,712 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-05-23 09:24:26,712 INFO L146 ILogger]: Start accepts. Automaton has 93 states. Word has length 274 [2019-05-23 09:24:26,713 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:26,715 INFO L146 ILogger]: With dead ends: 370 [2019-05-23 09:24:26,715 INFO L146 ILogger]: Without dead ends: 370 [2019-05-23 09:24:26,716 INFO L146 ILogger]: 0 DeclaredPredicates, 273 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:24:26,716 INFO L146 ILogger]: Start minimizeSevpa. Operand 370 states. [2019-05-23 09:24:26,718 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 370 to 369. [2019-05-23 09:24:26,718 INFO L146 ILogger]: Start removeUnreachable. Operand 369 states. [2019-05-23 09:24:26,719 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 369 states to 369 states and 460 transitions. [2019-05-23 09:24:26,719 INFO L146 ILogger]: Start accepts. Automaton has 369 states and 460 transitions. Word has length 274 [2019-05-23 09:24:26,719 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:26,719 INFO L146 ILogger]: Abstraction has 369 states and 460 transitions. [2019-05-23 09:24:26,719 INFO L146 ILogger]: Interpolant automaton has 93 states. [2019-05-23 09:24:26,719 INFO L146 ILogger]: Start isEmpty. Operand 369 states and 460 transitions. [2019-05-23 09:24:26,720 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 278 [2019-05-23 09:24:26,720 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:26,721 INFO L146 ILogger]: trace histogram [91, 91, 91, 1, 1, 1, 1] [2019-05-23 09:24:26,721 INFO L146 ILogger]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:26,721 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:26,721 INFO L146 ILogger]: Analyzing trace with hash 1220311275, now seen corresponding path program 91 times [2019-05-23 09:24:26,721 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:26,731 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:26,733 INFO L146 ILogger]: Trace formula consists of 372 conjuncts, 93 conjunts are in the unsatisfiable core [2019-05-23 09:24:26,735 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:29,907 INFO L146 ILogger]: Checked inductivity of 12376 backedges. 0 proven. 12376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:29,908 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:29,908 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-05-23 09:24:29,908 INFO L146 ILogger]: Interpolant automaton has 94 states [2019-05-23 09:24:29,909 INFO L146 ILogger]: Constructing interpolant automaton starting with 94 interpolants. [2019-05-23 09:24:29,909 INFO L146 ILogger]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 09:24:29,909 INFO L146 ILogger]: Start difference. First operand 369 states and 460 transitions. Second operand 94 states. [2019-05-23 09:24:30,815 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:30,815 INFO L146 ILogger]: Finished difference Result 374 states and 466 transitions. [2019-05-23 09:24:30,815 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-05-23 09:24:30,815 INFO L146 ILogger]: Start accepts. Automaton has 94 states. Word has length 277 [2019-05-23 09:24:30,816 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:30,818 INFO L146 ILogger]: With dead ends: 374 [2019-05-23 09:24:30,818 INFO L146 ILogger]: Without dead ends: 374 [2019-05-23 09:24:30,818 INFO L146 ILogger]: 0 DeclaredPredicates, 276 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 09:24:30,818 INFO L146 ILogger]: Start minimizeSevpa. Operand 374 states. [2019-05-23 09:24:30,820 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 374 to 373. [2019-05-23 09:24:30,821 INFO L146 ILogger]: Start removeUnreachable. Operand 373 states. [2019-05-23 09:24:30,821 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 373 states to 373 states and 465 transitions. [2019-05-23 09:24:30,821 INFO L146 ILogger]: Start accepts. Automaton has 373 states and 465 transitions. Word has length 277 [2019-05-23 09:24:30,821 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:30,821 INFO L146 ILogger]: Abstraction has 373 states and 465 transitions. [2019-05-23 09:24:30,821 INFO L146 ILogger]: Interpolant automaton has 94 states. [2019-05-23 09:24:30,822 INFO L146 ILogger]: Start isEmpty. Operand 373 states and 465 transitions. [2019-05-23 09:24:30,822 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 281 [2019-05-23 09:24:30,823 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:30,823 INFO L146 ILogger]: trace histogram [92, 92, 92, 1, 1, 1, 1] [2019-05-23 09:24:30,823 INFO L146 ILogger]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:30,823 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:30,823 INFO L146 ILogger]: Analyzing trace with hash 1680480035, now seen corresponding path program 92 times [2019-05-23 09:24:30,824 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:30,833 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:30,835 INFO L146 ILogger]: Trace formula consists of 376 conjuncts, 94 conjunts are in the unsatisfiable core [2019-05-23 09:24:30,837 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:33,883 INFO L146 ILogger]: Checked inductivity of 12650 backedges. 0 proven. 12650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:33,884 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:33,884 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-05-23 09:24:33,884 INFO L146 ILogger]: Interpolant automaton has 95 states [2019-05-23 09:24:33,885 INFO L146 ILogger]: Constructing interpolant automaton starting with 95 interpolants. [2019-05-23 09:24:33,885 INFO L146 ILogger]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:24:33,885 INFO L146 ILogger]: Start difference. First operand 373 states and 465 transitions. Second operand 95 states. [2019-05-23 09:24:34,736 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:34,736 INFO L146 ILogger]: Finished difference Result 378 states and 471 transitions. [2019-05-23 09:24:34,737 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-05-23 09:24:34,737 INFO L146 ILogger]: Start accepts. Automaton has 95 states. Word has length 280 [2019-05-23 09:24:34,737 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:34,739 INFO L146 ILogger]: With dead ends: 378 [2019-05-23 09:24:34,739 INFO L146 ILogger]: Without dead ends: 378 [2019-05-23 09:24:34,740 INFO L146 ILogger]: 0 DeclaredPredicates, 279 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:24:34,741 INFO L146 ILogger]: Start minimizeSevpa. Operand 378 states. [2019-05-23 09:24:34,744 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 378 to 377. [2019-05-23 09:24:34,744 INFO L146 ILogger]: Start removeUnreachable. Operand 377 states. [2019-05-23 09:24:34,744 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 377 states to 377 states and 470 transitions. [2019-05-23 09:24:34,745 INFO L146 ILogger]: Start accepts. Automaton has 377 states and 470 transitions. Word has length 280 [2019-05-23 09:24:34,745 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:34,745 INFO L146 ILogger]: Abstraction has 377 states and 470 transitions. [2019-05-23 09:24:34,745 INFO L146 ILogger]: Interpolant automaton has 95 states. [2019-05-23 09:24:34,745 INFO L146 ILogger]: Start isEmpty. Operand 377 states and 470 transitions. [2019-05-23 09:24:34,746 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 284 [2019-05-23 09:24:34,746 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:34,747 INFO L146 ILogger]: trace histogram [93, 93, 93, 1, 1, 1, 1] [2019-05-23 09:24:34,747 INFO L146 ILogger]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:34,747 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:34,747 INFO L146 ILogger]: Analyzing trace with hash 1032400363, now seen corresponding path program 93 times [2019-05-23 09:24:34,748 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:34,759 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:34,761 INFO L146 ILogger]: Trace formula consists of 380 conjuncts, 95 conjunts are in the unsatisfiable core [2019-05-23 09:24:34,763 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:38,437 INFO L146 ILogger]: Checked inductivity of 12927 backedges. 0 proven. 12927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:38,437 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:38,437 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-05-23 09:24:38,438 INFO L146 ILogger]: Interpolant automaton has 96 states [2019-05-23 09:24:38,438 INFO L146 ILogger]: Constructing interpolant automaton starting with 96 interpolants. [2019-05-23 09:24:38,438 INFO L146 ILogger]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 09:24:38,439 INFO L146 ILogger]: Start difference. First operand 377 states and 470 transitions. Second operand 96 states. [2019-05-23 09:24:39,369 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:39,369 INFO L146 ILogger]: Finished difference Result 382 states and 476 transitions. [2019-05-23 09:24:39,370 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-05-23 09:24:39,370 INFO L146 ILogger]: Start accepts. Automaton has 96 states. Word has length 283 [2019-05-23 09:24:39,370 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:39,371 INFO L146 ILogger]: With dead ends: 382 [2019-05-23 09:24:39,371 INFO L146 ILogger]: Without dead ends: 382 [2019-05-23 09:24:39,372 INFO L146 ILogger]: 0 DeclaredPredicates, 282 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 09:24:39,372 INFO L146 ILogger]: Start minimizeSevpa. Operand 382 states. [2019-05-23 09:24:39,374 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 382 to 381. [2019-05-23 09:24:39,374 INFO L146 ILogger]: Start removeUnreachable. Operand 381 states. [2019-05-23 09:24:39,374 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 381 states to 381 states and 475 transitions. [2019-05-23 09:24:39,375 INFO L146 ILogger]: Start accepts. Automaton has 381 states and 475 transitions. Word has length 283 [2019-05-23 09:24:39,375 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:39,375 INFO L146 ILogger]: Abstraction has 381 states and 475 transitions. [2019-05-23 09:24:39,375 INFO L146 ILogger]: Interpolant automaton has 96 states. [2019-05-23 09:24:39,375 INFO L146 ILogger]: Start isEmpty. Operand 381 states and 475 transitions. [2019-05-23 09:24:39,376 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 287 [2019-05-23 09:24:39,376 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:39,376 INFO L146 ILogger]: trace histogram [94, 94, 94, 1, 1, 1, 1] [2019-05-23 09:24:39,376 INFO L146 ILogger]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:39,377 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:39,377 INFO L146 ILogger]: Analyzing trace with hash -31112669, now seen corresponding path program 94 times [2019-05-23 09:24:39,377 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:39,390 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:39,393 INFO L146 ILogger]: Trace formula consists of 384 conjuncts, 96 conjunts are in the unsatisfiable core [2019-05-23 09:24:39,395 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:42,608 INFO L146 ILogger]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:42,608 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:42,608 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-05-23 09:24:42,609 INFO L146 ILogger]: Interpolant automaton has 97 states [2019-05-23 09:24:42,609 INFO L146 ILogger]: Constructing interpolant automaton starting with 97 interpolants. [2019-05-23 09:24:42,609 INFO L146 ILogger]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:24:42,610 INFO L146 ILogger]: Start difference. First operand 381 states and 475 transitions. Second operand 97 states. [2019-05-23 09:24:43,508 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:43,509 INFO L146 ILogger]: Finished difference Result 386 states and 481 transitions. [2019-05-23 09:24:43,509 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-05-23 09:24:43,509 INFO L146 ILogger]: Start accepts. Automaton has 97 states. Word has length 286 [2019-05-23 09:24:43,510 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:43,512 INFO L146 ILogger]: With dead ends: 386 [2019-05-23 09:24:43,512 INFO L146 ILogger]: Without dead ends: 386 [2019-05-23 09:24:43,512 INFO L146 ILogger]: 0 DeclaredPredicates, 285 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:24:43,513 INFO L146 ILogger]: Start minimizeSevpa. Operand 386 states. [2019-05-23 09:24:43,515 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 386 to 385. [2019-05-23 09:24:43,515 INFO L146 ILogger]: Start removeUnreachable. Operand 385 states. [2019-05-23 09:24:43,516 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 385 states to 385 states and 480 transitions. [2019-05-23 09:24:43,516 INFO L146 ILogger]: Start accepts. Automaton has 385 states and 480 transitions. Word has length 286 [2019-05-23 09:24:43,516 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:43,516 INFO L146 ILogger]: Abstraction has 385 states and 480 transitions. [2019-05-23 09:24:43,516 INFO L146 ILogger]: Interpolant automaton has 97 states. [2019-05-23 09:24:43,516 INFO L146 ILogger]: Start isEmpty. Operand 385 states and 480 transitions. [2019-05-23 09:24:43,517 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 290 [2019-05-23 09:24:43,517 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:43,518 INFO L146 ILogger]: trace histogram [95, 95, 95, 1, 1, 1, 1] [2019-05-23 09:24:43,518 INFO L146 ILogger]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:43,518 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:43,518 INFO L146 ILogger]: Analyzing trace with hash 825893611, now seen corresponding path program 95 times [2019-05-23 09:24:43,519 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:43,532 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:43,534 INFO L146 ILogger]: Trace formula consists of 388 conjuncts, 97 conjunts are in the unsatisfiable core [2019-05-23 09:24:43,536 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:46,973 INFO L146 ILogger]: Checked inductivity of 13490 backedges. 0 proven. 13490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:46,973 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:46,973 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-05-23 09:24:46,974 INFO L146 ILogger]: Interpolant automaton has 98 states [2019-05-23 09:24:46,974 INFO L146 ILogger]: Constructing interpolant automaton starting with 98 interpolants. [2019-05-23 09:24:46,974 INFO L146 ILogger]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 09:24:46,974 INFO L146 ILogger]: Start difference. First operand 385 states and 480 transitions. Second operand 98 states. [2019-05-23 09:24:47,831 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:47,832 INFO L146 ILogger]: Finished difference Result 390 states and 486 transitions. [2019-05-23 09:24:47,832 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-05-23 09:24:47,832 INFO L146 ILogger]: Start accepts. Automaton has 98 states. Word has length 289 [2019-05-23 09:24:47,832 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:47,834 INFO L146 ILogger]: With dead ends: 390 [2019-05-23 09:24:47,834 INFO L146 ILogger]: Without dead ends: 390 [2019-05-23 09:24:47,835 INFO L146 ILogger]: 0 DeclaredPredicates, 288 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 09:24:47,835 INFO L146 ILogger]: Start minimizeSevpa. Operand 390 states. [2019-05-23 09:24:47,837 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 390 to 389. [2019-05-23 09:24:47,837 INFO L146 ILogger]: Start removeUnreachable. Operand 389 states. [2019-05-23 09:24:47,838 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 389 states to 389 states and 485 transitions. [2019-05-23 09:24:47,838 INFO L146 ILogger]: Start accepts. Automaton has 389 states and 485 transitions. Word has length 289 [2019-05-23 09:24:47,838 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:47,838 INFO L146 ILogger]: Abstraction has 389 states and 485 transitions. [2019-05-23 09:24:47,838 INFO L146 ILogger]: Interpolant automaton has 98 states. [2019-05-23 09:24:47,839 INFO L146 ILogger]: Start isEmpty. Operand 389 states and 485 transitions. [2019-05-23 09:24:47,840 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 293 [2019-05-23 09:24:47,840 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:47,840 INFO L146 ILogger]: trace histogram [96, 96, 96, 1, 1, 1, 1] [2019-05-23 09:24:47,840 INFO L146 ILogger]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:47,840 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:47,840 INFO L146 ILogger]: Analyzing trace with hash -1680593629, now seen corresponding path program 96 times [2019-05-23 09:24:47,841 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:47,851 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:47,854 INFO L146 ILogger]: Trace formula consists of 392 conjuncts, 98 conjunts are in the unsatisfiable core [2019-05-23 09:24:47,855 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:51,273 INFO L146 ILogger]: Checked inductivity of 13776 backedges. 0 proven. 13776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:51,273 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:51,273 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-05-23 09:24:51,273 INFO L146 ILogger]: Interpolant automaton has 99 states [2019-05-23 09:24:51,274 INFO L146 ILogger]: Constructing interpolant automaton starting with 99 interpolants. [2019-05-23 09:24:51,274 INFO L146 ILogger]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:24:51,274 INFO L146 ILogger]: Start difference. First operand 389 states and 485 transitions. Second operand 99 states. [2019-05-23 09:24:52,113 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:52,113 INFO L146 ILogger]: Finished difference Result 394 states and 491 transitions. [2019-05-23 09:24:52,114 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-05-23 09:24:52,114 INFO L146 ILogger]: Start accepts. Automaton has 99 states. Word has length 292 [2019-05-23 09:24:52,114 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:52,116 INFO L146 ILogger]: With dead ends: 394 [2019-05-23 09:24:52,116 INFO L146 ILogger]: Without dead ends: 394 [2019-05-23 09:24:52,117 INFO L146 ILogger]: 0 DeclaredPredicates, 291 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:24:52,118 INFO L146 ILogger]: Start minimizeSevpa. Operand 394 states. [2019-05-23 09:24:52,120 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 394 to 393. [2019-05-23 09:24:52,120 INFO L146 ILogger]: Start removeUnreachable. Operand 393 states. [2019-05-23 09:24:52,120 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 393 states to 393 states and 490 transitions. [2019-05-23 09:24:52,121 INFO L146 ILogger]: Start accepts. Automaton has 393 states and 490 transitions. Word has length 292 [2019-05-23 09:24:52,121 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:52,121 INFO L146 ILogger]: Abstraction has 393 states and 490 transitions. [2019-05-23 09:24:52,121 INFO L146 ILogger]: Interpolant automaton has 99 states. [2019-05-23 09:24:52,121 INFO L146 ILogger]: Start isEmpty. Operand 393 states and 490 transitions. [2019-05-23 09:24:52,122 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 296 [2019-05-23 09:24:52,122 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:52,122 INFO L146 ILogger]: trace histogram [97, 97, 97, 1, 1, 1, 1] [2019-05-23 09:24:52,122 INFO L146 ILogger]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:52,122 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:52,123 INFO L146 ILogger]: Analyzing trace with hash -140552213, now seen corresponding path program 97 times [2019-05-23 09:24:52,123 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:52,133 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:52,135 INFO L146 ILogger]: Trace formula consists of 396 conjuncts, 99 conjunts are in the unsatisfiable core [2019-05-23 09:24:52,137 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:55,525 INFO L146 ILogger]: Checked inductivity of 14065 backedges. 0 proven. 14065 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:55,526 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:55,526 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-05-23 09:24:55,526 INFO L146 ILogger]: Interpolant automaton has 100 states [2019-05-23 09:24:55,527 INFO L146 ILogger]: Constructing interpolant automaton starting with 100 interpolants. [2019-05-23 09:24:55,527 INFO L146 ILogger]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 09:24:55,527 INFO L146 ILogger]: Start difference. First operand 393 states and 490 transitions. Second operand 100 states. [2019-05-23 09:24:56,409 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:56,410 INFO L146 ILogger]: Finished difference Result 398 states and 496 transitions. [2019-05-23 09:24:56,410 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-05-23 09:24:56,410 INFO L146 ILogger]: Start accepts. Automaton has 100 states. Word has length 295 [2019-05-23 09:24:56,411 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:56,413 INFO L146 ILogger]: With dead ends: 398 [2019-05-23 09:24:56,413 INFO L146 ILogger]: Without dead ends: 398 [2019-05-23 09:24:56,414 INFO L146 ILogger]: 0 DeclaredPredicates, 294 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 09:24:56,414 INFO L146 ILogger]: Start minimizeSevpa. Operand 398 states. [2019-05-23 09:24:56,416 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 398 to 397. [2019-05-23 09:24:56,416 INFO L146 ILogger]: Start removeUnreachable. Operand 397 states. [2019-05-23 09:24:56,417 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 397 states to 397 states and 495 transitions. [2019-05-23 09:24:56,417 INFO L146 ILogger]: Start accepts. Automaton has 397 states and 495 transitions. Word has length 295 [2019-05-23 09:24:56,417 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:56,417 INFO L146 ILogger]: Abstraction has 397 states and 495 transitions. [2019-05-23 09:24:56,417 INFO L146 ILogger]: Interpolant automaton has 100 states. [2019-05-23 09:24:56,417 INFO L146 ILogger]: Start isEmpty. Operand 397 states and 495 transitions. [2019-05-23 09:24:56,418 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 299 [2019-05-23 09:24:56,418 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:56,418 INFO L146 ILogger]: trace histogram [98, 98, 98, 1, 1, 1, 1] [2019-05-23 09:24:56,419 INFO L146 ILogger]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:56,419 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:56,419 INFO L146 ILogger]: Analyzing trace with hash 392615971, now seen corresponding path program 98 times [2019-05-23 09:24:56,419 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:56,430 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:56,432 INFO L146 ILogger]: Trace formula consists of 400 conjuncts, 100 conjunts are in the unsatisfiable core [2019-05-23 09:24:56,434 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:59,862 INFO L146 ILogger]: Checked inductivity of 14357 backedges. 0 proven. 14357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:59,862 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:59,862 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-05-23 09:24:59,863 INFO L146 ILogger]: Interpolant automaton has 101 states [2019-05-23 09:24:59,863 INFO L146 ILogger]: Constructing interpolant automaton starting with 101 interpolants. [2019-05-23 09:24:59,864 INFO L146 ILogger]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:24:59,864 INFO L146 ILogger]: Start difference. First operand 397 states and 495 transitions. Second operand 101 states. [2019-05-23 09:25:00,771 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:00,771 INFO L146 ILogger]: Finished difference Result 402 states and 501 transitions. [2019-05-23 09:25:00,771 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-05-23 09:25:00,772 INFO L146 ILogger]: Start accepts. Automaton has 101 states. Word has length 298 [2019-05-23 09:25:00,772 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:00,774 INFO L146 ILogger]: With dead ends: 402 [2019-05-23 09:25:00,774 INFO L146 ILogger]: Without dead ends: 402 [2019-05-23 09:25:00,775 INFO L146 ILogger]: 0 DeclaredPredicates, 297 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:25:00,775 INFO L146 ILogger]: Start minimizeSevpa. Operand 402 states. [2019-05-23 09:25:00,778 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 402 to 401. [2019-05-23 09:25:00,778 INFO L146 ILogger]: Start removeUnreachable. Operand 401 states. [2019-05-23 09:25:00,779 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 401 states to 401 states and 500 transitions. [2019-05-23 09:25:00,779 INFO L146 ILogger]: Start accepts. Automaton has 401 states and 500 transitions. Word has length 298 [2019-05-23 09:25:00,779 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:00,779 INFO L146 ILogger]: Abstraction has 401 states and 500 transitions. [2019-05-23 09:25:00,779 INFO L146 ILogger]: Interpolant automaton has 101 states. [2019-05-23 09:25:00,779 INFO L146 ILogger]: Start isEmpty. Operand 401 states and 500 transitions. [2019-05-23 09:25:00,780 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 302 [2019-05-23 09:25:00,780 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:00,781 INFO L146 ILogger]: trace histogram [99, 99, 99, 1, 1, 1, 1] [2019-05-23 09:25:00,781 INFO L146 ILogger]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:00,781 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:00,781 INFO L146 ILogger]: Analyzing trace with hash 1216924907, now seen corresponding path program 99 times [2019-05-23 09:25:00,781 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:00,792 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:00,794 INFO L146 ILogger]: Trace formula consists of 404 conjuncts, 101 conjunts are in the unsatisfiable core [2019-05-23 09:25:00,796 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:04,263 INFO L146 ILogger]: Checked inductivity of 14652 backedges. 0 proven. 14652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:04,264 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:04,264 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-05-23 09:25:04,264 INFO L146 ILogger]: Interpolant automaton has 102 states [2019-05-23 09:25:04,265 INFO L146 ILogger]: Constructing interpolant automaton starting with 102 interpolants. [2019-05-23 09:25:04,265 INFO L146 ILogger]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-05-23 09:25:04,265 INFO L146 ILogger]: Start difference. First operand 401 states and 500 transitions. Second operand 102 states. [2019-05-23 09:25:05,167 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:05,168 INFO L146 ILogger]: Finished difference Result 405 states and 505 transitions. [2019-05-23 09:25:05,168 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-05-23 09:25:05,168 INFO L146 ILogger]: Start accepts. Automaton has 102 states. Word has length 301 [2019-05-23 09:25:05,168 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:05,169 INFO L146 ILogger]: With dead ends: 405 [2019-05-23 09:25:05,169 INFO L146 ILogger]: Without dead ends: 405 [2019-05-23 09:25:05,170 INFO L146 ILogger]: 0 DeclaredPredicates, 300 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-05-23 09:25:05,170 INFO L146 ILogger]: Start minimizeSevpa. Operand 405 states. [2019-05-23 09:25:05,173 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 405 to 405. [2019-05-23 09:25:05,173 INFO L146 ILogger]: Start removeUnreachable. Operand 405 states. [2019-05-23 09:25:05,173 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 405 states to 405 states and 505 transitions. [2019-05-23 09:25:05,173 INFO L146 ILogger]: Start accepts. Automaton has 405 states and 505 transitions. Word has length 301 [2019-05-23 09:25:05,174 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:05,174 INFO L146 ILogger]: Abstraction has 405 states and 505 transitions. [2019-05-23 09:25:05,174 INFO L146 ILogger]: Interpolant automaton has 102 states. [2019-05-23 09:25:05,174 INFO L146 ILogger]: Start isEmpty. Operand 405 states and 505 transitions. [2019-05-23 09:25:05,175 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 305 [2019-05-23 09:25:05,175 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:05,175 INFO L146 ILogger]: trace histogram [100, 100, 100, 1, 1, 1, 1] [2019-05-23 09:25:05,176 INFO L146 ILogger]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:05,176 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:05,176 INFO L146 ILogger]: Analyzing trace with hash -418561245, now seen corresponding path program 100 times [2019-05-23 09:25:05,177 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:05,194 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:05,200 INFO L146 ILogger]: Trace formula consists of 408 conjuncts, 105 conjunts are in the unsatisfiable core [2019-05-23 09:25:05,203 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:11,690 INFO L146 ILogger]: Checked inductivity of 14950 backedges. 0 proven. 14950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:11,691 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:11,691 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-05-23 09:25:11,691 INFO L146 ILogger]: Interpolant automaton has 105 states [2019-05-23 09:25:11,692 INFO L146 ILogger]: Constructing interpolant automaton starting with 105 interpolants. [2019-05-23 09:25:11,692 INFO L146 ILogger]: CoverageRelationStatistics Valid=5259, Invalid=5661, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 09:25:11,693 INFO L146 ILogger]: Start difference. First operand 405 states and 505 transitions. Second operand 105 states. [2019-05-23 09:25:12,319 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:12,319 INFO L146 ILogger]: Finished difference Result 304 states and 304 transitions. [2019-05-23 09:25:12,319 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-05-23 09:25:12,319 INFO L146 ILogger]: Start accepts. Automaton has 105 states. Word has length 304 [2019-05-23 09:25:12,320 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:12,320 INFO L146 ILogger]: With dead ends: 304 [2019-05-23 09:25:12,320 INFO L146 ILogger]: Without dead ends: 0 [2019-05-23 09:25:12,320 INFO L146 ILogger]: 0 DeclaredPredicates, 303 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5259, Invalid=5661, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 09:25:12,320 INFO L146 ILogger]: Start minimizeSevpa. Operand 0 states. [2019-05-23 09:25:12,321 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-23 09:25:12,321 INFO L146 ILogger]: Start removeUnreachable. Operand 0 states. [2019-05-23 09:25:12,321 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-23 09:25:12,321 INFO L146 ILogger]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 304 [2019-05-23 09:25:12,321 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:12,321 INFO L146 ILogger]: Abstraction has 0 states and 0 transitions. [2019-05-23 09:25:12,321 INFO L146 ILogger]: Interpolant automaton has 105 states. [2019-05-23 09:25:12,321 INFO L146 ILogger]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-23 09:25:12,321 INFO L146 ILogger]: Finished isEmpty. No accepting run. [2019-05-23 09:25:12,325 INFO L146 ILogger]: Adding new model CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.05 09:25:12 BoogieIcfgContainer [2019-05-23 09:25:12,325 INFO L146 ILogger]: ------------------------ END TraceAbstraction---------------------------- [2019-05-23 09:25:12,327 INFO L146 ILogger]: Toolchain (without parser) took 188259.12 ms. Allocated memory was 135.3 MB in the beginning and 364.9 MB in the end (delta: 229.6 MB). Free memory was 111.7 MB in the beginning and 270.4 MB in the end (delta: -158.6 MB). Peak memory consumption was 71.0 MB. Max. memory is 7.1 GB. [2019-05-23 09:25:12,328 INFO L146 ILogger]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory was 112.8 MB in the beginning and 112.6 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:25:12,329 INFO L146 ILogger]: Boogie Procedure Inliner took 38.38 ms. Allocated memory is still 135.3 MB. Free memory was 111.5 MB in the beginning and 109.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-05-23 09:25:12,329 INFO L146 ILogger]: Boogie Preprocessor took 21.65 ms. Allocated memory is still 135.3 MB. Free memory was 109.6 MB in the beginning and 108.5 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:25:12,330 INFO L146 ILogger]: RCFGBuilder took 321.84 ms. Allocated memory is still 135.3 MB. Free memory was 108.5 MB in the beginning and 99.6 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-05-23 09:25:12,331 INFO L146 ILogger]: TraceAbstraction took 187873.24 ms. Allocated memory was 135.3 MB in the beginning and 364.9 MB in the end (delta: 229.6 MB). Free memory was 99.2 MB in the beginning and 270.4 MB in the end (delta: -171.2 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. [2019-05-23 09:25:12,333 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.21 ms. Allocated memory is still 135.3 MB. Free memory was 112.8 MB in the beginning and 112.6 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 38.38 ms. Allocated memory is still 135.3 MB. Free memory was 111.5 MB in the beginning and 109.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.65 ms. Allocated memory is still 135.3 MB. Free memory was 109.6 MB in the beginning and 108.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 321.84 ms. Allocated memory is still 135.3 MB. Free memory was 108.5 MB in the beginning and 99.6 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 187873.24 ms. Allocated memory was 135.3 MB in the beginning and 364.9 MB in the end (delta: 229.6 MB). Free memory was 99.2 MB in the beginning and 270.4 MB in the end (delta: -171.2 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: 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, 10 locations, 1 error locations. SAFE Result, 187.8s OverallTime, 101 OverallIterations, 100 TraceHistogramMax, 35.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 704 SDtfs, 28411 SDslu, 15151 SDs, 0 SdLazy, 11921 SolverSat, 389 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15453 GetRequests, 10300 SyntacticMatches, 0 SemanticMatches, 5153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 146.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 101 MinimizatonAttempts, 99 StatesRemovedByMinimization, 99 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 149.8s InterpolantComputationTime, 15554 NumberOfCodeBlocks, 15554 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 15453 ConstructedInterpolants, 0 QuantifiedInterpolants, 9747510 SizeOfPredicates, 100 NumberOfNonLiveVariables, 21008 ConjunctsInSsa, 5255 ConjunctsInUnsatCore, 101 InterpolantComputations, 1 PerfectInterpolantSequences, 0/505000 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...