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/AutomizerBplInlineTransformed.xml --icfgtransformation.transformationtype MAP_ELIMINATION_MONNIAUX --rcfgbuilder.size.of.a.code.block SingleStatement --icfgtransformation.map.elimination.monniaux.number.of.cells 2 -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-7aa59a0 [2019-05-23 10:02:44,011 INFO L146 ILogger]: Resetting all preferences to default values... [2019-05-23 10:02:44,013 INFO L146 ILogger]: Resetting UltimateCore preferences to default values [2019-05-23 10:02:44,026 INFO L146 ILogger]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-23 10:02:44,026 INFO L146 ILogger]: Resetting Boogie Preprocessor preferences to default values [2019-05-23 10:02:44,027 INFO L146 ILogger]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-23 10:02:44,029 INFO L146 ILogger]: Resetting Abstract Interpretation preferences to default values [2019-05-23 10:02:44,031 INFO L146 ILogger]: Resetting LassoRanker preferences to default values [2019-05-23 10:02:44,033 INFO L146 ILogger]: Resetting Reaching Definitions preferences to default values [2019-05-23 10:02:44,033 INFO L146 ILogger]: Resetting SyntaxChecker preferences to default values [2019-05-23 10:02:44,035 INFO L146 ILogger]: Büchi Program Product provides no preferences, ignoring... [2019-05-23 10:02:44,035 INFO L146 ILogger]: Resetting LTL2Aut preferences to default values [2019-05-23 10:02:44,036 INFO L146 ILogger]: Resetting PEA to Boogie preferences to default values [2019-05-23 10:02:44,037 INFO L146 ILogger]: Resetting BlockEncodingV2 preferences to default values [2019-05-23 10:02:44,039 INFO L146 ILogger]: Resetting ChcToBoogie preferences to default values [2019-05-23 10:02:44,039 INFO L146 ILogger]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-23 10:02:44,040 INFO L146 ILogger]: Resetting BuchiAutomizer preferences to default values [2019-05-23 10:02:44,042 INFO L146 ILogger]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-23 10:02:44,044 INFO L146 ILogger]: Resetting CodeCheck preferences to default values [2019-05-23 10:02:44,046 INFO L146 ILogger]: Resetting InvariantSynthesis preferences to default values [2019-05-23 10:02:44,047 INFO L146 ILogger]: Resetting RCFGBuilder preferences to default values [2019-05-23 10:02:44,049 INFO L146 ILogger]: Resetting TraceAbstraction preferences to default values [2019-05-23 10:02:44,051 INFO L146 ILogger]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-23 10:02:44,052 INFO L146 ILogger]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-23 10:02:44,052 INFO L146 ILogger]: Resetting TreeAutomizer preferences to default values [2019-05-23 10:02:44,053 INFO L146 ILogger]: Resetting IcfgToChc preferences to default values [2019-05-23 10:02:44,054 INFO L146 ILogger]: Resetting IcfgTransformer preferences to default values [2019-05-23 10:02:44,055 INFO L146 ILogger]: ReqToTest provides no preferences, ignoring... [2019-05-23 10:02:44,055 INFO L146 ILogger]: Resetting Boogie Printer preferences to default values [2019-05-23 10:02:44,056 INFO L146 ILogger]: Resetting ChcSmtPrinter preferences to default values [2019-05-23 10:02:44,057 INFO L146 ILogger]: Resetting ReqPrinter preferences to default values [2019-05-23 10:02:44,058 INFO L146 ILogger]: Resetting Witness Printer preferences to default values [2019-05-23 10:02:44,059 INFO L146 ILogger]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-23 10:02:44,059 INFO L146 ILogger]: Resetting CDTParser preferences to default values [2019-05-23 10:02:44,060 INFO L146 ILogger]: AutomataScriptParser provides no preferences, ignoring... [2019-05-23 10:02:44,060 INFO L146 ILogger]: ReqParser provides no preferences, ignoring... [2019-05-23 10:02:44,060 INFO L146 ILogger]: Resetting SmtParser preferences to default values [2019-05-23 10:02:44,061 INFO L146 ILogger]: Resetting Witness Parser preferences to default values [2019-05-23 10:02:44,062 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.icfgtransformation: TransformationType -> MAP_ELIMINATION_MONNIAUX Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: Map elimination Monniaux: number of cells -> 2 [2019-05-23 10:02:44,110 INFO L146 ILogger]: Repository-Root is: /tmp [2019-05-23 10:02:44,126 INFO L146 ILogger]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-23 10:02:44,132 INFO L146 ILogger]: [Toolchain 1]: Toolchain selected. [2019-05-23 10:02:44,134 INFO L146 ILogger]: Initializing Boogie PL CUP Parser... [2019-05-23 10:02:44,134 INFO L146 ILogger]: Boogie PL CUP Parser initialized [2019-05-23 10:02:44,135 INFO L146 ILogger]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-05-23 10:02:44,135 INFO L146 ILogger]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-05-23 10:02:44,179 INFO L146 ILogger]: ####################### [Toolchain 1] ####################### [2019-05-23 10:02:44,182 INFO L146 ILogger]: Walking toolchain with 5 elements. [2019-05-23 10:02:44,183 INFO L146 ILogger]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-23 10:02:44,183 INFO L146 ILogger]: Initializing Boogie Procedure Inliner... [2019-05-23 10:02:44,183 INFO L146 ILogger]: Boogie Procedure Inliner initialized [2019-05-23 10:02:44,200 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,212 INFO L146 ILogger]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,221 INFO L146 ILogger]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-23 10:02:44,222 INFO L146 ILogger]: ------------------------Boogie Preprocessor---------------------------- [2019-05-23 10:02:44,222 INFO L146 ILogger]: Initializing Boogie Preprocessor... [2019-05-23 10:02:44,222 INFO L146 ILogger]: Boogie Preprocessor initialized [2019-05-23 10:02:44,234 INFO L146 ILogger]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,235 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,236 INFO L146 ILogger]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,236 INFO L146 ILogger]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,241 INFO L146 ILogger]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,247 INFO L146 ILogger]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,248 INFO L146 ILogger]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,249 INFO L146 ILogger]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-23 10:02:44,250 INFO L146 ILogger]: ------------------------RCFGBuilder---------------------------- [2019-05-23 10:02:44,250 INFO L146 ILogger]: Initializing RCFGBuilder... [2019-05-23 10:02:44,251 INFO L146 ILogger]: RCFGBuilder initialized [2019-05-23 10:02:44,253 INFO L146 ILogger]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (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 10:02:44,332 INFO L146 ILogger]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-05-23 10:02:44,333 INFO L146 ILogger]: Found specification of procedure ULTIMATE.start [2019-05-23 10:02:44,333 INFO L146 ILogger]: Found implementation of procedure ULTIMATE.start [2019-05-23 10:02:44,574 INFO L146 ILogger]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-23 10:02:44,574 INFO L146 ILogger]: Removed 0 assume(true) statements. [2019-05-23 10:02:44,576 INFO L146 ILogger]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 10:02:44 BoogieIcfgContainer [2019-05-23 10:02:44,576 INFO L146 ILogger]: ------------------------ END RCFGBuilder---------------------------- [2019-05-23 10:02:44,577 INFO L146 ILogger]: ------------------------IcfgTransformer---------------------------- [2019-05-23 10:02:44,577 INFO L146 ILogger]: Initializing IcfgTransformer... [2019-05-23 10:02:44,578 INFO L146 ILogger]: IcfgTransformer initialized [2019-05-23 10:02:44,581 INFO L146 ILogger]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,620 INFO L146 ILogger]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.05 10:02:44 BasicIcfg [2019-05-23 10:02:44,620 INFO L146 ILogger]: ------------------------ END IcfgTransformer---------------------------- [2019-05-23 10:02:44,622 INFO L146 ILogger]: ------------------------TraceAbstraction---------------------------- [2019-05-23 10:02:44,622 INFO L146 ILogger]: Initializing TraceAbstraction... [2019-05-23 10:02:44,626 INFO L146 ILogger]: TraceAbstraction initialized [2019-05-23 10:02:44,626 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/3) ... [2019-05-23 10:02:44,628 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448e8e3e and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.05 10:02:44, skipping insertion in model container [2019-05-23 10:02:44,628 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 10:02:44" (2/3) ... [2019-05-23 10:02:44,628 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448e8e3e and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.05 10:02:44, skipping insertion in model container [2019-05-23 10:02:44,628 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.05 10:02:44" (3/3) ... [2019-05-23 10:02:44,630 INFO L146 ILogger]: Analyzing ICFG ArrayInit02.bplME [2019-05-23 10:02:44,643 INFO L146 ILogger]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-23 10:02:44,653 INFO L146 ILogger]: Appying trace abstraction to program that has 1 error locations. [2019-05-23 10:02:44,686 INFO L146 ILogger]: Starting to check reachability of 1 error locations. [2019-05-23 10:02:44,732 INFO L146 ILogger]: Using default assertion order modulation [2019-05-23 10:02:44,733 INFO L146 ILogger]: Interprodecural is true [2019-05-23 10:02:44,733 INFO L146 ILogger]: Hoare is false [2019-05-23 10:02:44,733 INFO L146 ILogger]: Compute interpolants for ForwardPredicates [2019-05-23 10:02:44,733 INFO L146 ILogger]: Backedges is STRAIGHT_LINE [2019-05-23 10:02:44,734 INFO L146 ILogger]: Determinization is PREDICATE_ABSTRACTION [2019-05-23 10:02:44,734 INFO L146 ILogger]: Difference is false [2019-05-23 10:02:44,734 INFO L146 ILogger]: Minimize is MINIMIZE_SEVPA [2019-05-23 10:02:44,734 INFO L146 ILogger]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-23 10:02:44,748 INFO L146 ILogger]: Start isEmpty. Operand 17 states. [2019-05-23 10:02:44,757 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 10 [2019-05-23 10:02:44,757 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:44,758 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:44,761 INFO L146 ILogger]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:44,766 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:44,767 INFO L146 ILogger]: Analyzing trace with hash -34213359, now seen corresponding path program 1 times [2019-05-23 10:02:44,816 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:44,846 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:44,849 INFO L146 ILogger]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-23 10:02:44,854 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:44,923 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 10:02:44,926 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 10:02:44,927 INFO L146 ILogger]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-23 10:02:44,930 INFO L146 ILogger]: Interpolant automaton has 3 states [2019-05-23 10:02:44,941 INFO L146 ILogger]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-23 10:02:44,942 INFO L146 ILogger]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 10:02:44,944 INFO L146 ILogger]: Start difference. First operand 17 states. Second operand 3 states. [2019-05-23 10:02:44,999 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:44,999 INFO L146 ILogger]: Finished difference Result 20 states and 23 transitions. [2019-05-23 10:02:45,000 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-23 10:02:45,001 INFO L146 ILogger]: Start accepts. Automaton has 3 states. Word has length 9 [2019-05-23 10:02:45,001 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:45,013 INFO L146 ILogger]: With dead ends: 20 [2019-05-23 10:02:45,013 INFO L146 ILogger]: Without dead ends: 17 [2019-05-23 10:02:45,015 INFO L146 ILogger]: 0 DeclaredPredicates, 8 GetRequests, 7 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 10:02:45,029 INFO L146 ILogger]: Start minimizeSevpa. Operand 17 states. [2019-05-23 10:02:45,040 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-05-23 10:02:45,041 INFO L146 ILogger]: Start removeUnreachable. Operand 16 states. [2019-05-23 10:02:45,042 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-05-23 10:02:45,043 INFO L146 ILogger]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2019-05-23 10:02:45,043 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:45,044 INFO L146 ILogger]: Abstraction has 16 states and 19 transitions. [2019-05-23 10:02:45,044 INFO L146 ILogger]: Interpolant automaton has 3 states. [2019-05-23 10:02:45,044 INFO L146 ILogger]: Start isEmpty. Operand 16 states and 19 transitions. [2019-05-23 10:02:45,045 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 11 [2019-05-23 10:02:45,045 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:45,045 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:45,045 INFO L146 ILogger]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:45,046 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:45,046 INFO L146 ILogger]: Analyzing trace with hash -1061569365, now seen corresponding path program 1 times [2019-05-23 10:02:45,047 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:45,056 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:45,057 INFO L146 ILogger]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-23 10:02:45,058 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:45,197 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 10:02:45,197 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 10:02:45,198 INFO L146 ILogger]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-05-23 10:02:45,200 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 10:02:45,200 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 10:02:45,200 INFO L146 ILogger]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-05-23 10:02:45,201 INFO L146 ILogger]: Start difference. First operand 16 states and 19 transitions. Second operand 5 states. [2019-05-23 10:02:45,307 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:45,307 INFO L146 ILogger]: Finished difference Result 22 states and 26 transitions. [2019-05-23 10:02:45,307 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-23 10:02:45,307 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 10 [2019-05-23 10:02:45,308 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:45,308 INFO L146 ILogger]: With dead ends: 22 [2019-05-23 10:02:45,309 INFO L146 ILogger]: Without dead ends: 20 [2019-05-23 10:02:45,310 INFO L146 ILogger]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-05-23 10:02:45,310 INFO L146 ILogger]: Start minimizeSevpa. Operand 20 states. [2019-05-23 10:02:45,312 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-05-23 10:02:45,313 INFO L146 ILogger]: Start removeUnreachable. Operand 17 states. [2019-05-23 10:02:45,313 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-05-23 10:02:45,314 INFO L146 ILogger]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2019-05-23 10:02:45,314 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:45,314 INFO L146 ILogger]: Abstraction has 17 states and 20 transitions. [2019-05-23 10:02:45,314 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 10:02:45,315 INFO L146 ILogger]: Start isEmpty. Operand 17 states and 20 transitions. [2019-05-23 10:02:45,315 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 14 [2019-05-23 10:02:45,315 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:45,315 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:45,316 INFO L146 ILogger]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:45,316 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:45,316 INFO L146 ILogger]: Analyzing trace with hash 1577681806, now seen corresponding path program 1 times [2019-05-23 10:02:45,317 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:45,327 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:45,328 INFO L146 ILogger]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-05-23 10:02:45,330 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:45,443 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 10:02:45,444 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:45,444 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-05-23 10:02:45,444 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 10:02:45,444 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 10:02:45,445 INFO L146 ILogger]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-05-23 10:02:45,445 INFO L146 ILogger]: Start difference. First operand 17 states and 20 transitions. Second operand 5 states. [2019-05-23 10:02:45,723 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:45,723 INFO L146 ILogger]: Finished difference Result 41 states and 48 transitions. [2019-05-23 10:02:45,724 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 10:02:45,724 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 13 [2019-05-23 10:02:45,724 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:45,725 INFO L146 ILogger]: With dead ends: 41 [2019-05-23 10:02:45,725 INFO L146 ILogger]: Without dead ends: 41 [2019-05-23 10:02:45,726 INFO L146 ILogger]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-05-23 10:02:45,727 INFO L146 ILogger]: Start minimizeSevpa. Operand 41 states. [2019-05-23 10:02:45,730 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-05-23 10:02:45,731 INFO L146 ILogger]: Start removeUnreachable. Operand 26 states. [2019-05-23 10:02:45,732 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-05-23 10:02:45,732 INFO L146 ILogger]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 13 [2019-05-23 10:02:45,732 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:45,732 INFO L146 ILogger]: Abstraction has 26 states and 32 transitions. [2019-05-23 10:02:45,732 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 10:02:45,733 INFO L146 ILogger]: Start isEmpty. Operand 26 states and 32 transitions. [2019-05-23 10:02:45,733 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 15 [2019-05-23 10:02:45,733 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:45,734 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:45,734 INFO L146 ILogger]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:45,734 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:45,734 INFO L146 ILogger]: Analyzing trace with hash 708584808, now seen corresponding path program 1 times [2019-05-23 10:02:45,736 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:45,744 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:45,745 INFO L146 ILogger]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2019-05-23 10:02:45,746 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:45,826 INFO L146 ILogger]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:45,827 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 10:02:45,827 INFO L146 ILogger]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-05-23 10:02:45,828 INFO L146 ILogger]: Interpolant automaton has 4 states [2019-05-23 10:02:45,828 INFO L146 ILogger]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-23 10:02:45,828 INFO L146 ILogger]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-23 10:02:45,829 INFO L146 ILogger]: Start difference. First operand 26 states and 32 transitions. Second operand 4 states. [2019-05-23 10:02:45,879 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:45,880 INFO L146 ILogger]: Finished difference Result 44 states and 53 transitions. [2019-05-23 10:02:45,880 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-23 10:02:45,880 INFO L146 ILogger]: Start accepts. Automaton has 4 states. Word has length 14 [2019-05-23 10:02:45,881 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:45,881 INFO L146 ILogger]: With dead ends: 44 [2019-05-23 10:02:45,881 INFO L146 ILogger]: Without dead ends: 20 [2019-05-23 10:02:45,882 INFO L146 ILogger]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-05-23 10:02:45,882 INFO L146 ILogger]: Start minimizeSevpa. Operand 20 states. [2019-05-23 10:02:45,884 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-05-23 10:02:45,884 INFO L146 ILogger]: Start removeUnreachable. Operand 19 states. [2019-05-23 10:02:45,885 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-05-23 10:02:45,885 INFO L146 ILogger]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-05-23 10:02:45,886 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:45,886 INFO L146 ILogger]: Abstraction has 19 states and 21 transitions. [2019-05-23 10:02:45,886 INFO L146 ILogger]: Interpolant automaton has 4 states. [2019-05-23 10:02:45,886 INFO L146 ILogger]: Start isEmpty. Operand 19 states and 21 transitions. [2019-05-23 10:02:45,887 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 19 [2019-05-23 10:02:45,887 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:45,887 INFO L146 ILogger]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:45,887 INFO L146 ILogger]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:45,888 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:45,888 INFO L146 ILogger]: Analyzing trace with hash -389587032, now seen corresponding path program 1 times [2019-05-23 10:02:45,889 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:45,910 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:45,912 INFO L146 ILogger]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 10:02:45,915 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:46,098 INFO L146 ILogger]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:46,098 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:46,098 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-05-23 10:02:46,099 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 10:02:46,099 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 10:02:46,099 INFO L146 ILogger]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-05-23 10:02:46,100 INFO L146 ILogger]: Start difference. First operand 19 states and 21 transitions. Second operand 7 states. [2019-05-23 10:02:46,203 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:46,204 INFO L146 ILogger]: Finished difference Result 31 states and 33 transitions. [2019-05-23 10:02:46,204 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-05-23 10:02:46,204 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 18 [2019-05-23 10:02:46,205 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:46,205 INFO L146 ILogger]: With dead ends: 31 [2019-05-23 10:02:46,206 INFO L146 ILogger]: Without dead ends: 24 [2019-05-23 10:02:46,206 INFO L146 ILogger]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-05-23 10:02:46,207 INFO L146 ILogger]: Start minimizeSevpa. Operand 24 states. [2019-05-23 10:02:46,208 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-05-23 10:02:46,209 INFO L146 ILogger]: Start removeUnreachable. Operand 22 states. [2019-05-23 10:02:46,209 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-05-23 10:02:46,210 INFO L146 ILogger]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 18 [2019-05-23 10:02:46,210 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:46,210 INFO L146 ILogger]: Abstraction has 22 states and 24 transitions. [2019-05-23 10:02:46,211 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 10:02:46,211 INFO L146 ILogger]: Start isEmpty. Operand 22 states and 24 transitions. [2019-05-23 10:02:46,211 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 22 [2019-05-23 10:02:46,212 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:46,212 INFO L146 ILogger]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:46,212 INFO L146 ILogger]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:46,212 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:46,213 INFO L146 ILogger]: Analyzing trace with hash 765432715, now seen corresponding path program 2 times [2019-05-23 10:02:46,214 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:46,225 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:46,227 INFO L146 ILogger]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2019-05-23 10:02:46,228 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:46,354 INFO L146 ILogger]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:46,355 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:46,355 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-05-23 10:02:46,355 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 10:02:46,356 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 10:02:46,356 INFO L146 ILogger]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-05-23 10:02:46,358 INFO L146 ILogger]: Start difference. First operand 22 states and 24 transitions. Second operand 7 states. [2019-05-23 10:02:46,752 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:46,752 INFO L146 ILogger]: Finished difference Result 31 states and 33 transitions. [2019-05-23 10:02:46,752 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-05-23 10:02:46,753 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 21 [2019-05-23 10:02:46,753 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:46,754 INFO L146 ILogger]: With dead ends: 31 [2019-05-23 10:02:46,754 INFO L146 ILogger]: Without dead ends: 31 [2019-05-23 10:02:46,755 INFO L146 ILogger]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-05-23 10:02:46,756 INFO L146 ILogger]: Start minimizeSevpa. Operand 31 states. [2019-05-23 10:02:46,759 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-05-23 10:02:46,759 INFO L146 ILogger]: Start removeUnreachable. Operand 27 states. [2019-05-23 10:02:46,760 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-05-23 10:02:46,760 INFO L146 ILogger]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2019-05-23 10:02:46,761 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:46,761 INFO L146 ILogger]: Abstraction has 27 states and 29 transitions. [2019-05-23 10:02:46,761 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 10:02:46,761 INFO L146 ILogger]: Start isEmpty. Operand 27 states and 29 transitions. [2019-05-23 10:02:46,762 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 27 [2019-05-23 10:02:46,762 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:46,762 INFO L146 ILogger]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:46,763 INFO L146 ILogger]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:46,763 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:46,763 INFO L146 ILogger]: Analyzing trace with hash -1352874549, now seen corresponding path program 3 times [2019-05-23 10:02:46,764 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:46,777 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:46,779 INFO L146 ILogger]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-23 10:02:46,780 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:46,893 INFO L146 ILogger]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:46,894 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:46,894 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-05-23 10:02:46,895 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 10:02:46,895 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 10:02:46,896 INFO L146 ILogger]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-05-23 10:02:46,896 INFO L146 ILogger]: Start difference. First operand 27 states and 29 transitions. Second operand 9 states. [2019-05-23 10:02:47,042 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:47,042 INFO L146 ILogger]: Finished difference Result 44 states and 46 transitions. [2019-05-23 10:02:47,043 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 10:02:47,043 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 26 [2019-05-23 10:02:47,043 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:47,044 INFO L146 ILogger]: With dead ends: 44 [2019-05-23 10:02:47,044 INFO L146 ILogger]: Without dead ends: 32 [2019-05-23 10:02:47,045 INFO L146 ILogger]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-05-23 10:02:47,046 INFO L146 ILogger]: Start minimizeSevpa. Operand 32 states. [2019-05-23 10:02:47,049 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-05-23 10:02:47,049 INFO L146 ILogger]: Start removeUnreachable. Operand 30 states. [2019-05-23 10:02:47,050 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-05-23 10:02:47,051 INFO L146 ILogger]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 26 [2019-05-23 10:02:47,051 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:47,051 INFO L146 ILogger]: Abstraction has 30 states and 32 transitions. [2019-05-23 10:02:47,051 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 10:02:47,052 INFO L146 ILogger]: Start isEmpty. Operand 30 states and 32 transitions. [2019-05-23 10:02:47,052 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 30 [2019-05-23 10:02:47,053 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:47,053 INFO L146 ILogger]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:47,053 INFO L146 ILogger]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:47,053 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:47,054 INFO L146 ILogger]: Analyzing trace with hash -1224710482, now seen corresponding path program 4 times [2019-05-23 10:02:47,054 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:47,069 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:47,071 INFO L146 ILogger]: Trace formula consists of 43 conjuncts, 15 conjunts are in the unsatisfiable core [2019-05-23 10:02:47,073 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:47,188 INFO L146 ILogger]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:47,189 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:47,189 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-05-23 10:02:47,189 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 10:02:47,190 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 10:02:47,190 INFO L146 ILogger]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-05-23 10:02:47,190 INFO L146 ILogger]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2019-05-23 10:02:47,355 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:47,355 INFO L146 ILogger]: Finished difference Result 39 states and 41 transitions. [2019-05-23 10:02:47,356 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-05-23 10:02:47,356 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 29 [2019-05-23 10:02:47,356 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:47,357 INFO L146 ILogger]: With dead ends: 39 [2019-05-23 10:02:47,357 INFO L146 ILogger]: Without dead ends: 39 [2019-05-23 10:02:47,358 INFO L146 ILogger]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-05-23 10:02:47,359 INFO L146 ILogger]: Start minimizeSevpa. Operand 39 states. [2019-05-23 10:02:47,361 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 39 to 35. [2019-05-23 10:02:47,362 INFO L146 ILogger]: Start removeUnreachable. Operand 35 states. [2019-05-23 10:02:47,362 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-05-23 10:02:47,363 INFO L146 ILogger]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 29 [2019-05-23 10:02:47,363 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:47,363 INFO L146 ILogger]: Abstraction has 35 states and 37 transitions. [2019-05-23 10:02:47,363 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 10:02:47,364 INFO L146 ILogger]: Start isEmpty. Operand 35 states and 37 transitions. [2019-05-23 10:02:47,364 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 35 [2019-05-23 10:02:47,364 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:47,365 INFO L146 ILogger]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:47,365 INFO L146 ILogger]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:47,365 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:47,365 INFO L146 ILogger]: Analyzing trace with hash 1279357064, now seen corresponding path program 5 times [2019-05-23 10:02:47,366 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:47,382 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:47,384 INFO L146 ILogger]: Trace formula consists of 50 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-23 10:02:47,386 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:47,589 INFO L146 ILogger]: Checked inductivity of 39 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:47,589 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:47,590 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-05-23 10:02:47,590 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 10:02:47,590 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 10:02:47,591 INFO L146 ILogger]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-05-23 10:02:47,591 INFO L146 ILogger]: Start difference. First operand 35 states and 37 transitions. Second operand 11 states. [2019-05-23 10:02:47,733 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:47,734 INFO L146 ILogger]: Finished difference Result 57 states and 59 transitions. [2019-05-23 10:02:47,734 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-05-23 10:02:47,734 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 34 [2019-05-23 10:02:47,735 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:47,735 INFO L146 ILogger]: With dead ends: 57 [2019-05-23 10:02:47,735 INFO L146 ILogger]: Without dead ends: 40 [2019-05-23 10:02:47,736 INFO L146 ILogger]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-05-23 10:02:47,736 INFO L146 ILogger]: Start minimizeSevpa. Operand 40 states. [2019-05-23 10:02:47,739 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-05-23 10:02:47,739 INFO L146 ILogger]: Start removeUnreachable. Operand 38 states. [2019-05-23 10:02:47,739 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-05-23 10:02:47,740 INFO L146 ILogger]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-05-23 10:02:47,740 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:47,740 INFO L146 ILogger]: Abstraction has 38 states and 40 transitions. [2019-05-23 10:02:47,740 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 10:02:47,740 INFO L146 ILogger]: Start isEmpty. Operand 38 states and 40 transitions. [2019-05-23 10:02:47,741 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 38 [2019-05-23 10:02:47,741 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:47,741 INFO L146 ILogger]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:47,742 INFO L146 ILogger]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:47,742 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:47,742 INFO L146 ILogger]: Analyzing trace with hash 1056145003, now seen corresponding path program 6 times [2019-05-23 10:02:47,743 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:47,759 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:47,761 INFO L146 ILogger]: Trace formula consists of 54 conjuncts, 19 conjunts are in the unsatisfiable core [2019-05-23 10:02:47,762 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:48,092 INFO L146 ILogger]: Checked inductivity of 49 backedges. 3 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:48,092 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:48,093 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-05-23 10:02:48,093 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 10:02:48,093 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 10:02:48,094 INFO L146 ILogger]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-05-23 10:02:48,094 INFO L146 ILogger]: Start difference. First operand 38 states and 40 transitions. Second operand 11 states. [2019-05-23 10:02:48,282 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:48,282 INFO L146 ILogger]: Finished difference Result 47 states and 49 transitions. [2019-05-23 10:02:48,282 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 10:02:48,283 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 37 [2019-05-23 10:02:48,283 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:48,284 INFO L146 ILogger]: With dead ends: 47 [2019-05-23 10:02:48,284 INFO L146 ILogger]: Without dead ends: 47 [2019-05-23 10:02:48,285 INFO L146 ILogger]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-05-23 10:02:48,285 INFO L146 ILogger]: Start minimizeSevpa. Operand 47 states. [2019-05-23 10:02:48,288 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-05-23 10:02:48,288 INFO L146 ILogger]: Start removeUnreachable. Operand 43 states. [2019-05-23 10:02:48,289 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-05-23 10:02:48,289 INFO L146 ILogger]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 37 [2019-05-23 10:02:48,289 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:48,289 INFO L146 ILogger]: Abstraction has 43 states and 45 transitions. [2019-05-23 10:02:48,289 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 10:02:48,289 INFO L146 ILogger]: Start isEmpty. Operand 43 states and 45 transitions. [2019-05-23 10:02:48,290 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 43 [2019-05-23 10:02:48,290 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:48,291 INFO L146 ILogger]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:48,291 INFO L146 ILogger]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:48,291 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:48,291 INFO L146 ILogger]: Analyzing trace with hash 1177069291, now seen corresponding path program 7 times [2019-05-23 10:02:48,292 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:48,307 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:48,309 INFO L146 ILogger]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-23 10:02:48,311 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:48,456 INFO L146 ILogger]: Checked inductivity of 68 backedges. 46 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:48,456 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:48,456 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-05-23 10:02:48,456 INFO L146 ILogger]: Interpolant automaton has 13 states [2019-05-23 10:02:48,457 INFO L146 ILogger]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-23 10:02:48,457 INFO L146 ILogger]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-05-23 10:02:48,457 INFO L146 ILogger]: Start difference. First operand 43 states and 45 transitions. Second operand 13 states. [2019-05-23 10:02:48,638 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:48,639 INFO L146 ILogger]: Finished difference Result 70 states and 72 transitions. [2019-05-23 10:02:48,639 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-05-23 10:02:48,639 INFO L146 ILogger]: Start accepts. Automaton has 13 states. Word has length 42 [2019-05-23 10:02:48,639 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:48,640 INFO L146 ILogger]: With dead ends: 70 [2019-05-23 10:02:48,640 INFO L146 ILogger]: Without dead ends: 48 [2019-05-23 10:02:48,641 INFO L146 ILogger]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-05-23 10:02:48,641 INFO L146 ILogger]: Start minimizeSevpa. Operand 48 states. [2019-05-23 10:02:48,644 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-05-23 10:02:48,644 INFO L146 ILogger]: Start removeUnreachable. Operand 46 states. [2019-05-23 10:02:48,644 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-05-23 10:02:48,645 INFO L146 ILogger]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 42 [2019-05-23 10:02:48,645 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:48,645 INFO L146 ILogger]: Abstraction has 46 states and 48 transitions. [2019-05-23 10:02:48,645 INFO L146 ILogger]: Interpolant automaton has 13 states. [2019-05-23 10:02:48,645 INFO L146 ILogger]: Start isEmpty. Operand 46 states and 48 transitions. [2019-05-23 10:02:48,646 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 46 [2019-05-23 10:02:48,646 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:48,647 INFO L146 ILogger]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:48,647 INFO L146 ILogger]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:48,647 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:48,647 INFO L146 ILogger]: Analyzing trace with hash 1496064462, now seen corresponding path program 8 times [2019-05-23 10:02:48,648 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:48,673 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:48,676 INFO L146 ILogger]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2019-05-23 10:02:48,685 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:48,812 INFO L146 ILogger]: Checked inductivity of 81 backedges. 4 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:48,813 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:48,813 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-05-23 10:02:48,813 INFO L146 ILogger]: Interpolant automaton has 13 states [2019-05-23 10:02:48,813 INFO L146 ILogger]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-23 10:02:48,814 INFO L146 ILogger]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-05-23 10:02:48,814 INFO L146 ILogger]: Start difference. First operand 46 states and 48 transitions. Second operand 13 states. [2019-05-23 10:02:49,063 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:49,064 INFO L146 ILogger]: Finished difference Result 55 states and 57 transitions. [2019-05-23 10:02:49,064 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-05-23 10:02:49,064 INFO L146 ILogger]: Start accepts. Automaton has 13 states. Word has length 45 [2019-05-23 10:02:49,065 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:49,066 INFO L146 ILogger]: With dead ends: 55 [2019-05-23 10:02:49,066 INFO L146 ILogger]: Without dead ends: 55 [2019-05-23 10:02:49,067 INFO L146 ILogger]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-05-23 10:02:49,067 INFO L146 ILogger]: Start minimizeSevpa. Operand 55 states. [2019-05-23 10:02:49,070 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 55 to 51. [2019-05-23 10:02:49,070 INFO L146 ILogger]: Start removeUnreachable. Operand 51 states. [2019-05-23 10:02:49,071 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-05-23 10:02:49,071 INFO L146 ILogger]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 45 [2019-05-23 10:02:49,071 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:49,071 INFO L146 ILogger]: Abstraction has 51 states and 53 transitions. [2019-05-23 10:02:49,071 INFO L146 ILogger]: Interpolant automaton has 13 states. [2019-05-23 10:02:49,072 INFO L146 ILogger]: Start isEmpty. Operand 51 states and 53 transitions. [2019-05-23 10:02:49,072 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 51 [2019-05-23 10:02:49,072 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:49,073 INFO L146 ILogger]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:49,073 INFO L146 ILogger]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:49,073 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:49,073 INFO L146 ILogger]: Analyzing trace with hash -1647466136, now seen corresponding path program 9 times [2019-05-23 10:02:49,074 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:49,089 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:49,093 INFO L146 ILogger]: Trace formula consists of 72 conjuncts, 14 conjunts are in the unsatisfiable core [2019-05-23 10:02:49,096 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:49,204 INFO L146 ILogger]: Checked inductivity of 105 backedges. 70 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:49,205 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:49,205 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-05-23 10:02:49,206 INFO L146 ILogger]: Interpolant automaton has 15 states [2019-05-23 10:02:49,206 INFO L146 ILogger]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-23 10:02:49,206 INFO L146 ILogger]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-05-23 10:02:49,206 INFO L146 ILogger]: Start difference. First operand 51 states and 53 transitions. Second operand 15 states. [2019-05-23 10:02:49,534 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:49,534 INFO L146 ILogger]: Finished difference Result 83 states and 85 transitions. [2019-05-23 10:02:49,534 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-23 10:02:49,535 INFO L146 ILogger]: Start accepts. Automaton has 15 states. Word has length 50 [2019-05-23 10:02:49,535 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:49,536 INFO L146 ILogger]: With dead ends: 83 [2019-05-23 10:02:49,536 INFO L146 ILogger]: Without dead ends: 56 [2019-05-23 10:02:49,537 INFO L146 ILogger]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2019-05-23 10:02:49,537 INFO L146 ILogger]: Start minimizeSevpa. Operand 56 states. [2019-05-23 10:02:49,540 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-05-23 10:02:49,540 INFO L146 ILogger]: Start removeUnreachable. Operand 54 states. [2019-05-23 10:02:49,540 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-05-23 10:02:49,541 INFO L146 ILogger]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 50 [2019-05-23 10:02:49,541 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:49,541 INFO L146 ILogger]: Abstraction has 54 states and 56 transitions. [2019-05-23 10:02:49,541 INFO L146 ILogger]: Interpolant automaton has 15 states. [2019-05-23 10:02:49,541 INFO L146 ILogger]: Start isEmpty. Operand 54 states and 56 transitions. [2019-05-23 10:02:49,542 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 54 [2019-05-23 10:02:49,542 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:49,542 INFO L146 ILogger]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:49,542 INFO L146 ILogger]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:49,543 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:49,543 INFO L146 ILogger]: Analyzing trace with hash 325423435, now seen corresponding path program 10 times [2019-05-23 10:02:49,544 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:49,558 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:49,560 INFO L146 ILogger]: Trace formula consists of 76 conjuncts, 27 conjunts are in the unsatisfiable core [2019-05-23 10:02:49,562 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:49,708 INFO L146 ILogger]: Checked inductivity of 121 backedges. 5 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:49,708 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:49,708 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-05-23 10:02:49,708 INFO L146 ILogger]: Interpolant automaton has 15 states [2019-05-23 10:02:49,709 INFO L146 ILogger]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-23 10:02:49,709 INFO L146 ILogger]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-05-23 10:02:49,709 INFO L146 ILogger]: Start difference. First operand 54 states and 56 transitions. Second operand 15 states. [2019-05-23 10:02:50,282 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:50,282 INFO L146 ILogger]: Finished difference Result 63 states and 65 transitions. [2019-05-23 10:02:50,282 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-05-23 10:02:50,282 INFO L146 ILogger]: Start accepts. Automaton has 15 states. Word has length 53 [2019-05-23 10:02:50,283 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:50,283 INFO L146 ILogger]: With dead ends: 63 [2019-05-23 10:02:50,283 INFO L146 ILogger]: Without dead ends: 63 [2019-05-23 10:02:50,283 INFO L146 ILogger]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-05-23 10:02:50,284 INFO L146 ILogger]: Start minimizeSevpa. Operand 63 states. [2019-05-23 10:02:50,288 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-05-23 10:02:50,288 INFO L146 ILogger]: Start removeUnreachable. Operand 59 states. [2019-05-23 10:02:50,289 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-05-23 10:02:50,289 INFO L146 ILogger]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 53 [2019-05-23 10:02:50,289 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:50,289 INFO L146 ILogger]: Abstraction has 59 states and 61 transitions. [2019-05-23 10:02:50,289 INFO L146 ILogger]: Interpolant automaton has 15 states. [2019-05-23 10:02:50,289 INFO L146 ILogger]: Start isEmpty. Operand 59 states and 61 transitions. [2019-05-23 10:02:50,290 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 59 [2019-05-23 10:02:50,290 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:50,290 INFO L146 ILogger]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:50,291 INFO L146 ILogger]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:50,291 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:50,291 INFO L146 ILogger]: Analyzing trace with hash -1636868085, now seen corresponding path program 11 times [2019-05-23 10:02:50,292 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:50,308 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:50,310 INFO L146 ILogger]: Trace formula consists of 83 conjuncts, 16 conjunts are in the unsatisfiable core [2019-05-23 10:02:50,312 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:50,488 INFO L146 ILogger]: Checked inductivity of 150 backedges. 99 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:50,488 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:50,488 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-05-23 10:02:50,488 INFO L146 ILogger]: Interpolant automaton has 17 states [2019-05-23 10:02:50,489 INFO L146 ILogger]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-23 10:02:50,489 INFO L146 ILogger]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-05-23 10:02:50,489 INFO L146 ILogger]: Start difference. First operand 59 states and 61 transitions. Second operand 17 states. [2019-05-23 10:02:51,061 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:51,061 INFO L146 ILogger]: Finished difference Result 96 states and 98 transitions. [2019-05-23 10:02:51,062 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-05-23 10:02:51,062 INFO L146 ILogger]: Start accepts. Automaton has 17 states. Word has length 58 [2019-05-23 10:02:51,062 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:51,063 INFO L146 ILogger]: With dead ends: 96 [2019-05-23 10:02:51,063 INFO L146 ILogger]: Without dead ends: 64 [2019-05-23 10:02:51,064 INFO L146 ILogger]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-05-23 10:02:51,064 INFO L146 ILogger]: Start minimizeSevpa. Operand 64 states. [2019-05-23 10:02:51,067 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-05-23 10:02:51,068 INFO L146 ILogger]: Start removeUnreachable. Operand 62 states. [2019-05-23 10:02:51,068 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-05-23 10:02:51,068 INFO L146 ILogger]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 58 [2019-05-23 10:02:51,069 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:51,069 INFO L146 ILogger]: Abstraction has 62 states and 64 transitions. [2019-05-23 10:02:51,069 INFO L146 ILogger]: Interpolant automaton has 17 states. [2019-05-23 10:02:51,069 INFO L146 ILogger]: Start isEmpty. Operand 62 states and 64 transitions. [2019-05-23 10:02:51,071 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 62 [2019-05-23 10:02:51,072 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:51,072 INFO L146 ILogger]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:51,072 INFO L146 ILogger]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:51,072 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:51,072 INFO L146 ILogger]: Analyzing trace with hash -975260434, now seen corresponding path program 12 times [2019-05-23 10:02:51,073 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:51,089 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:51,091 INFO L146 ILogger]: Trace formula consists of 87 conjuncts, 31 conjunts are in the unsatisfiable core [2019-05-23 10:02:51,093 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:51,723 INFO L146 ILogger]: Checked inductivity of 169 backedges. 6 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:51,723 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:51,723 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-05-23 10:02:51,723 INFO L146 ILogger]: Interpolant automaton has 17 states [2019-05-23 10:02:51,724 INFO L146 ILogger]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-23 10:02:51,724 INFO L146 ILogger]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-05-23 10:02:51,724 INFO L146 ILogger]: Start difference. First operand 62 states and 64 transitions. Second operand 17 states. [2019-05-23 10:02:52,191 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:52,191 INFO L146 ILogger]: Finished difference Result 71 states and 73 transitions. [2019-05-23 10:02:52,196 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-23 10:02:52,197 INFO L146 ILogger]: Start accepts. Automaton has 17 states. Word has length 61 [2019-05-23 10:02:52,197 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:52,197 INFO L146 ILogger]: With dead ends: 71 [2019-05-23 10:02:52,198 INFO L146 ILogger]: Without dead ends: 71 [2019-05-23 10:02:52,198 INFO L146 ILogger]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-05-23 10:02:52,198 INFO L146 ILogger]: Start minimizeSevpa. Operand 71 states. [2019-05-23 10:02:52,201 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 71 to 67. [2019-05-23 10:02:52,201 INFO L146 ILogger]: Start removeUnreachable. Operand 67 states. [2019-05-23 10:02:52,202 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2019-05-23 10:02:52,202 INFO L146 ILogger]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 61 [2019-05-23 10:02:52,202 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:52,203 INFO L146 ILogger]: Abstraction has 67 states and 69 transitions. [2019-05-23 10:02:52,203 INFO L146 ILogger]: Interpolant automaton has 17 states. [2019-05-23 10:02:52,203 INFO L146 ILogger]: Start isEmpty. Operand 67 states and 69 transitions. [2019-05-23 10:02:52,203 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 67 [2019-05-23 10:02:52,203 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:52,204 INFO L146 ILogger]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:52,204 INFO L146 ILogger]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:52,204 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:52,204 INFO L146 ILogger]: Analyzing trace with hash 1599736392, now seen corresponding path program 13 times [2019-05-23 10:02:52,205 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:52,241 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:52,246 INFO L146 ILogger]: Trace formula consists of 94 conjuncts, 18 conjunts are in the unsatisfiable core [2019-05-23 10:02:52,252 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:52,507 INFO L146 ILogger]: Checked inductivity of 203 backedges. 133 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:52,508 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:52,508 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-05-23 10:02:52,508 INFO L146 ILogger]: Interpolant automaton has 19 states [2019-05-23 10:02:52,509 INFO L146 ILogger]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-23 10:02:52,509 INFO L146 ILogger]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-05-23 10:02:52,509 INFO L146 ILogger]: Start difference. First operand 67 states and 69 transitions. Second operand 19 states. [2019-05-23 10:02:52,716 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:52,716 INFO L146 ILogger]: Finished difference Result 109 states and 111 transitions. [2019-05-23 10:02:52,717 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-05-23 10:02:52,717 INFO L146 ILogger]: Start accepts. Automaton has 19 states. Word has length 66 [2019-05-23 10:02:52,717 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:52,718 INFO L146 ILogger]: With dead ends: 109 [2019-05-23 10:02:52,718 INFO L146 ILogger]: Without dead ends: 72 [2019-05-23 10:02:52,719 INFO L146 ILogger]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2019-05-23 10:02:52,720 INFO L146 ILogger]: Start minimizeSevpa. Operand 72 states. [2019-05-23 10:02:52,722 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-05-23 10:02:52,722 INFO L146 ILogger]: Start removeUnreachable. Operand 70 states. [2019-05-23 10:02:52,723 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-05-23 10:02:52,723 INFO L146 ILogger]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 66 [2019-05-23 10:02:52,723 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:52,723 INFO L146 ILogger]: Abstraction has 70 states and 72 transitions. [2019-05-23 10:02:52,723 INFO L146 ILogger]: Interpolant automaton has 19 states. [2019-05-23 10:02:52,724 INFO L146 ILogger]: Start isEmpty. Operand 70 states and 72 transitions. [2019-05-23 10:02:52,724 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 70 [2019-05-23 10:02:52,724 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:52,724 INFO L146 ILogger]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:52,725 INFO L146 ILogger]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:52,725 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:52,725 INFO L146 ILogger]: Analyzing trace with hash -1797010389, now seen corresponding path program 14 times [2019-05-23 10:02:52,726 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:52,742 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:52,743 INFO L146 ILogger]: Trace formula consists of 98 conjuncts, 35 conjunts are in the unsatisfiable core [2019-05-23 10:02:52,746 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:53,024 INFO L146 ILogger]: Checked inductivity of 225 backedges. 7 proven. 218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:53,024 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:53,024 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-05-23 10:02:53,025 INFO L146 ILogger]: Interpolant automaton has 19 states [2019-05-23 10:02:53,025 INFO L146 ILogger]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-23 10:02:53,025 INFO L146 ILogger]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-05-23 10:02:53,026 INFO L146 ILogger]: Start difference. First operand 70 states and 72 transitions. Second operand 19 states. [2019-05-23 10:02:53,600 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:53,600 INFO L146 ILogger]: Finished difference Result 79 states and 81 transitions. [2019-05-23 10:02:53,601 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-05-23 10:02:53,601 INFO L146 ILogger]: Start accepts. Automaton has 19 states. Word has length 69 [2019-05-23 10:02:53,601 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:53,602 INFO L146 ILogger]: With dead ends: 79 [2019-05-23 10:02:53,602 INFO L146 ILogger]: Without dead ends: 79 [2019-05-23 10:02:53,603 INFO L146 ILogger]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-05-23 10:02:53,603 INFO L146 ILogger]: Start minimizeSevpa. Operand 79 states. [2019-05-23 10:02:53,606 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 79 to 75. [2019-05-23 10:02:53,606 INFO L146 ILogger]: Start removeUnreachable. Operand 75 states. [2019-05-23 10:02:53,607 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2019-05-23 10:02:53,607 INFO L146 ILogger]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 69 [2019-05-23 10:02:53,607 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:53,607 INFO L146 ILogger]: Abstraction has 75 states and 77 transitions. [2019-05-23 10:02:53,608 INFO L146 ILogger]: Interpolant automaton has 19 states. [2019-05-23 10:02:53,608 INFO L146 ILogger]: Start isEmpty. Operand 75 states and 77 transitions. [2019-05-23 10:02:53,608 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 75 [2019-05-23 10:02:53,609 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:53,609 INFO L146 ILogger]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:53,610 INFO L146 ILogger]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:53,610 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:53,610 INFO L146 ILogger]: Analyzing trace with hash -754781909, now seen corresponding path program 15 times [2019-05-23 10:02:53,611 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:53,627 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:53,629 INFO L146 ILogger]: Trace formula consists of 105 conjuncts, 20 conjunts are in the unsatisfiable core [2019-05-23 10:02:53,632 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:53,903 INFO L146 ILogger]: Checked inductivity of 264 backedges. 172 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:53,903 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:53,903 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-05-23 10:02:53,904 INFO L146 ILogger]: Interpolant automaton has 21 states [2019-05-23 10:02:53,904 INFO L146 ILogger]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-23 10:02:53,904 INFO L146 ILogger]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-05-23 10:02:53,905 INFO L146 ILogger]: Start difference. First operand 75 states and 77 transitions. Second operand 21 states. [2019-05-23 10:02:54,252 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:54,252 INFO L146 ILogger]: Finished difference Result 122 states and 124 transitions. [2019-05-23 10:02:54,252 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-23 10:02:54,252 INFO L146 ILogger]: Start accepts. Automaton has 21 states. Word has length 74 [2019-05-23 10:02:54,253 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:54,253 INFO L146 ILogger]: With dead ends: 122 [2019-05-23 10:02:54,254 INFO L146 ILogger]: Without dead ends: 80 [2019-05-23 10:02:54,255 INFO L146 ILogger]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=250, Invalid=680, Unknown=0, NotChecked=0, Total=930 [2019-05-23 10:02:54,255 INFO L146 ILogger]: Start minimizeSevpa. Operand 80 states. [2019-05-23 10:02:54,257 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-05-23 10:02:54,258 INFO L146 ILogger]: Start removeUnreachable. Operand 78 states. [2019-05-23 10:02:54,258 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-05-23 10:02:54,258 INFO L146 ILogger]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 74 [2019-05-23 10:02:54,258 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:54,259 INFO L146 ILogger]: Abstraction has 78 states and 80 transitions. [2019-05-23 10:02:54,259 INFO L146 ILogger]: Interpolant automaton has 21 states. [2019-05-23 10:02:54,259 INFO L146 ILogger]: Start isEmpty. Operand 78 states and 80 transitions. [2019-05-23 10:02:54,259 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 78 [2019-05-23 10:02:54,260 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:54,260 INFO L146 ILogger]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:54,260 INFO L146 ILogger]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:54,260 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:54,260 INFO L146 ILogger]: Analyzing trace with hash 2146050062, now seen corresponding path program 16 times [2019-05-23 10:02:54,261 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:54,275 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:54,277 INFO L146 ILogger]: Trace formula consists of 109 conjuncts, 39 conjunts are in the unsatisfiable core [2019-05-23 10:02:54,279 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:54,710 INFO L146 ILogger]: Checked inductivity of 289 backedges. 8 proven. 281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:54,711 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:54,711 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-05-23 10:02:54,711 INFO L146 ILogger]: Interpolant automaton has 21 states [2019-05-23 10:02:54,711 INFO L146 ILogger]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-23 10:02:54,712 INFO L146 ILogger]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-05-23 10:02:54,712 INFO L146 ILogger]: Start difference. First operand 78 states and 80 transitions. Second operand 21 states. [2019-05-23 10:02:55,490 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:55,491 INFO L146 ILogger]: Finished difference Result 87 states and 89 transitions. [2019-05-23 10:02:55,494 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-05-23 10:02:55,494 INFO L146 ILogger]: Start accepts. Automaton has 21 states. Word has length 77 [2019-05-23 10:02:55,495 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:55,495 INFO L146 ILogger]: With dead ends: 87 [2019-05-23 10:02:55,495 INFO L146 ILogger]: Without dead ends: 87 [2019-05-23 10:02:55,496 INFO L146 ILogger]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-05-23 10:02:55,496 INFO L146 ILogger]: Start minimizeSevpa. Operand 87 states. [2019-05-23 10:02:55,498 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-05-23 10:02:55,498 INFO L146 ILogger]: Start removeUnreachable. Operand 83 states. [2019-05-23 10:02:55,498 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2019-05-23 10:02:55,498 INFO L146 ILogger]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 77 [2019-05-23 10:02:55,499 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:55,499 INFO L146 ILogger]: Abstraction has 83 states and 85 transitions. [2019-05-23 10:02:55,499 INFO L146 ILogger]: Interpolant automaton has 21 states. [2019-05-23 10:02:55,499 INFO L146 ILogger]: Start isEmpty. Operand 83 states and 85 transitions. [2019-05-23 10:02:55,500 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 83 [2019-05-23 10:02:55,500 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:55,500 INFO L146 ILogger]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:55,500 INFO L146 ILogger]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:55,500 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:55,500 INFO L146 ILogger]: Analyzing trace with hash 22319912, now seen corresponding path program 17 times [2019-05-23 10:02:55,501 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:55,515 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:55,517 INFO L146 ILogger]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2019-05-23 10:02:55,521 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:55,736 INFO L146 ILogger]: Checked inductivity of 333 backedges. 216 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:55,736 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:55,736 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-05-23 10:02:55,736 INFO L146 ILogger]: Interpolant automaton has 23 states [2019-05-23 10:02:55,737 INFO L146 ILogger]: Constructing interpolant automaton starting with 23 interpolants. [2019-05-23 10:02:55,737 INFO L146 ILogger]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-05-23 10:02:55,737 INFO L146 ILogger]: Start difference. First operand 83 states and 85 transitions. Second operand 23 states. [2019-05-23 10:02:55,986 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:55,986 INFO L146 ILogger]: Finished difference Result 135 states and 137 transitions. [2019-05-23 10:02:55,987 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-05-23 10:02:55,987 INFO L146 ILogger]: Start accepts. Automaton has 23 states. Word has length 82 [2019-05-23 10:02:55,987 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:55,988 INFO L146 ILogger]: With dead ends: 135 [2019-05-23 10:02:55,988 INFO L146 ILogger]: Without dead ends: 88 [2019-05-23 10:02:55,989 INFO L146 ILogger]: 0 DeclaredPredicates, 92 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 10:02:55,990 INFO L146 ILogger]: Start minimizeSevpa. Operand 88 states. [2019-05-23 10:02:55,992 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-05-23 10:02:55,992 INFO L146 ILogger]: Start removeUnreachable. Operand 86 states. [2019-05-23 10:02:55,993 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-05-23 10:02:55,993 INFO L146 ILogger]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 82 [2019-05-23 10:02:55,993 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:55,993 INFO L146 ILogger]: Abstraction has 86 states and 88 transitions. [2019-05-23 10:02:55,993 INFO L146 ILogger]: Interpolant automaton has 23 states. [2019-05-23 10:02:55,993 INFO L146 ILogger]: Start isEmpty. Operand 86 states and 88 transitions. [2019-05-23 10:02:55,994 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 86 [2019-05-23 10:02:55,994 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:55,994 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:55,994 INFO L146 ILogger]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:55,995 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:55,995 INFO L146 ILogger]: Analyzing trace with hash -1680068853, now seen corresponding path program 18 times [2019-05-23 10:02:55,996 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:56,009 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:56,011 INFO L146 ILogger]: Trace formula consists of 120 conjuncts, 43 conjunts are in the unsatisfiable core [2019-05-23 10:02:56,013 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:56,349 INFO L146 ILogger]: Checked inductivity of 361 backedges. 9 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:56,350 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:56,350 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-05-23 10:02:56,350 INFO L146 ILogger]: Interpolant automaton has 23 states [2019-05-23 10:02:56,350 INFO L146 ILogger]: Constructing interpolant automaton starting with 23 interpolants. [2019-05-23 10:02:56,351 INFO L146 ILogger]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2019-05-23 10:02:56,351 INFO L146 ILogger]: Start difference. First operand 86 states and 88 transitions. Second operand 23 states. [2019-05-23 10:02:58,192 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:58,192 INFO L146 ILogger]: Finished difference Result 95 states and 97 transitions. [2019-05-23 10:02:58,194 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-23 10:02:58,195 INFO L146 ILogger]: Start accepts. Automaton has 23 states. Word has length 85 [2019-05-23 10:02:58,195 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:58,195 INFO L146 ILogger]: With dead ends: 95 [2019-05-23 10:02:58,196 INFO L146 ILogger]: Without dead ends: 95 [2019-05-23 10:02:58,196 INFO L146 ILogger]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2019-05-23 10:02:58,196 INFO L146 ILogger]: Start minimizeSevpa. Operand 95 states. [2019-05-23 10:02:58,197 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 95 to 91. [2019-05-23 10:02:58,198 INFO L146 ILogger]: Start removeUnreachable. Operand 91 states. [2019-05-23 10:02:58,198 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2019-05-23 10:02:58,198 INFO L146 ILogger]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 85 [2019-05-23 10:02:58,198 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:58,199 INFO L146 ILogger]: Abstraction has 91 states and 93 transitions. [2019-05-23 10:02:58,199 INFO L146 ILogger]: Interpolant automaton has 23 states. [2019-05-23 10:02:58,199 INFO L146 ILogger]: Start isEmpty. Operand 91 states and 93 transitions. [2019-05-23 10:02:58,199 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 91 [2019-05-23 10:02:58,199 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:58,199 INFO L146 ILogger]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:58,200 INFO L146 ILogger]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:58,200 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:58,200 INFO L146 ILogger]: Analyzing trace with hash 540367435, now seen corresponding path program 19 times [2019-05-23 10:02:58,200 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:58,213 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:58,214 INFO L146 ILogger]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2019-05-23 10:02:58,216 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:58,764 INFO L146 ILogger]: Checked inductivity of 410 backedges. 265 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:58,764 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:58,765 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-05-23 10:02:58,765 INFO L146 ILogger]: Interpolant automaton has 25 states [2019-05-23 10:02:58,765 INFO L146 ILogger]: Constructing interpolant automaton starting with 25 interpolants. [2019-05-23 10:02:58,765 INFO L146 ILogger]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-05-23 10:02:58,766 INFO L146 ILogger]: Start difference. First operand 91 states and 93 transitions. Second operand 25 states. [2019-05-23 10:02:59,077 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:59,078 INFO L146 ILogger]: Finished difference Result 148 states and 150 transitions. [2019-05-23 10:02:59,078 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-05-23 10:02:59,078 INFO L146 ILogger]: Start accepts. Automaton has 25 states. Word has length 90 [2019-05-23 10:02:59,079 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:59,079 INFO L146 ILogger]: With dead ends: 148 [2019-05-23 10:02:59,080 INFO L146 ILogger]: Without dead ends: 96 [2019-05-23 10:02:59,081 INFO L146 ILogger]: 0 DeclaredPredicates, 101 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=348, Invalid=984, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 10:02:59,081 INFO L146 ILogger]: Start minimizeSevpa. Operand 96 states. [2019-05-23 10:02:59,082 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-05-23 10:02:59,083 INFO L146 ILogger]: Start removeUnreachable. Operand 94 states. [2019-05-23 10:02:59,083 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-05-23 10:02:59,083 INFO L146 ILogger]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 90 [2019-05-23 10:02:59,083 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:59,083 INFO L146 ILogger]: Abstraction has 94 states and 96 transitions. [2019-05-23 10:02:59,084 INFO L146 ILogger]: Interpolant automaton has 25 states. [2019-05-23 10:02:59,084 INFO L146 ILogger]: Start isEmpty. Operand 94 states and 96 transitions. [2019-05-23 10:02:59,084 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 94 [2019-05-23 10:02:59,084 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:59,085 INFO L146 ILogger]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:59,085 INFO L146 ILogger]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:59,085 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:59,085 INFO L146 ILogger]: Analyzing trace with hash 731931438, now seen corresponding path program 20 times [2019-05-23 10:02:59,086 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:59,097 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:59,098 INFO L146 ILogger]: Trace formula consists of 131 conjuncts, 47 conjunts are in the unsatisfiable core [2019-05-23 10:02:59,100 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:59,475 INFO L146 ILogger]: Checked inductivity of 441 backedges. 10 proven. 431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:59,476 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:59,476 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-05-23 10:02:59,476 INFO L146 ILogger]: Interpolant automaton has 25 states [2019-05-23 10:02:59,476 INFO L146 ILogger]: Constructing interpolant automaton starting with 25 interpolants. [2019-05-23 10:02:59,477 INFO L146 ILogger]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2019-05-23 10:02:59,477 INFO L146 ILogger]: Start difference. First operand 94 states and 96 transitions. Second operand 25 states. [2019-05-23 10:03:00,465 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:00,466 INFO L146 ILogger]: Finished difference Result 103 states and 105 transitions. [2019-05-23 10:03:00,466 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-05-23 10:03:00,466 INFO L146 ILogger]: Start accepts. Automaton has 25 states. Word has length 93 [2019-05-23 10:03:00,466 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:00,467 INFO L146 ILogger]: With dead ends: 103 [2019-05-23 10:03:00,468 INFO L146 ILogger]: Without dead ends: 103 [2019-05-23 10:03:00,468 INFO L146 ILogger]: 0 DeclaredPredicates, 93 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-05-23 10:03:00,469 INFO L146 ILogger]: Start minimizeSevpa. Operand 103 states. [2019-05-23 10:03:00,470 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-05-23 10:03:00,470 INFO L146 ILogger]: Start removeUnreachable. Operand 99 states. [2019-05-23 10:03:00,471 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2019-05-23 10:03:00,471 INFO L146 ILogger]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 93 [2019-05-23 10:03:00,471 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:00,471 INFO L146 ILogger]: Abstraction has 99 states and 101 transitions. [2019-05-23 10:03:00,472 INFO L146 ILogger]: Interpolant automaton has 25 states. [2019-05-23 10:03:00,472 INFO L146 ILogger]: Start isEmpty. Operand 99 states and 101 transitions. [2019-05-23 10:03:00,472 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 99 [2019-05-23 10:03:00,472 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:00,472 INFO L146 ILogger]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:00,473 INFO L146 ILogger]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:00,473 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:00,473 INFO L146 ILogger]: Analyzing trace with hash -1028963320, now seen corresponding path program 21 times [2019-05-23 10:03:00,474 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:00,485 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:00,486 INFO L146 ILogger]: Trace formula consists of 138 conjuncts, 26 conjunts are in the unsatisfiable core [2019-05-23 10:03:00,488 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:00,790 INFO L146 ILogger]: Checked inductivity of 495 backedges. 319 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:00,791 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:00,791 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-05-23 10:03:00,791 INFO L146 ILogger]: Interpolant automaton has 27 states [2019-05-23 10:03:00,791 INFO L146 ILogger]: Constructing interpolant automaton starting with 27 interpolants. [2019-05-23 10:03:00,792 INFO L146 ILogger]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-05-23 10:03:00,792 INFO L146 ILogger]: Start difference. First operand 99 states and 101 transitions. Second operand 27 states. [2019-05-23 10:03:01,219 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:01,220 INFO L146 ILogger]: Finished difference Result 161 states and 163 transitions. [2019-05-23 10:03:01,220 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-05-23 10:03:01,220 INFO L146 ILogger]: Start accepts. Automaton has 27 states. Word has length 98 [2019-05-23 10:03:01,221 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:01,221 INFO L146 ILogger]: With dead ends: 161 [2019-05-23 10:03:01,222 INFO L146 ILogger]: Without dead ends: 104 [2019-05-23 10:03:01,223 INFO L146 ILogger]: 0 DeclaredPredicates, 110 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=403, Invalid=1157, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 10:03:01,223 INFO L146 ILogger]: Start minimizeSevpa. Operand 104 states. [2019-05-23 10:03:01,225 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 104 to 102. [2019-05-23 10:03:01,226 INFO L146 ILogger]: Start removeUnreachable. Operand 102 states. [2019-05-23 10:03:01,226 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-05-23 10:03:01,226 INFO L146 ILogger]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 98 [2019-05-23 10:03:01,227 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:01,227 INFO L146 ILogger]: Abstraction has 102 states and 104 transitions. [2019-05-23 10:03:01,227 INFO L146 ILogger]: Interpolant automaton has 27 states. [2019-05-23 10:03:01,227 INFO L146 ILogger]: Start isEmpty. Operand 102 states and 104 transitions. [2019-05-23 10:03:01,228 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 102 [2019-05-23 10:03:01,228 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:01,228 INFO L146 ILogger]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:01,228 INFO L146 ILogger]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:01,228 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:01,229 INFO L146 ILogger]: Analyzing trace with hash -818103829, now seen corresponding path program 22 times [2019-05-23 10:03:01,229 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:01,241 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:01,242 INFO L146 ILogger]: Trace formula consists of 142 conjuncts, 51 conjunts are in the unsatisfiable core [2019-05-23 10:03:01,244 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:01,600 INFO L146 ILogger]: Checked inductivity of 529 backedges. 11 proven. 518 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:01,600 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:01,600 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-05-23 10:03:01,600 INFO L146 ILogger]: Interpolant automaton has 27 states [2019-05-23 10:03:01,600 INFO L146 ILogger]: Constructing interpolant automaton starting with 27 interpolants. [2019-05-23 10:03:01,601 INFO L146 ILogger]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2019-05-23 10:03:01,601 INFO L146 ILogger]: Start difference. First operand 102 states and 104 transitions. Second operand 27 states. [2019-05-23 10:03:02,642 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:02,642 INFO L146 ILogger]: Finished difference Result 111 states and 113 transitions. [2019-05-23 10:03:02,643 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-05-23 10:03:02,643 INFO L146 ILogger]: Start accepts. Automaton has 27 states. Word has length 101 [2019-05-23 10:03:02,643 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:02,644 INFO L146 ILogger]: With dead ends: 111 [2019-05-23 10:03:02,644 INFO L146 ILogger]: Without dead ends: 111 [2019-05-23 10:03:02,645 INFO L146 ILogger]: 0 DeclaredPredicates, 101 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=689, Unknown=0, NotChecked=0, Total=756 [2019-05-23 10:03:02,645 INFO L146 ILogger]: Start minimizeSevpa. Operand 111 states. [2019-05-23 10:03:02,647 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 111 to 107. [2019-05-23 10:03:02,648 INFO L146 ILogger]: Start removeUnreachable. Operand 107 states. [2019-05-23 10:03:02,648 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2019-05-23 10:03:02,648 INFO L146 ILogger]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 101 [2019-05-23 10:03:02,649 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:02,649 INFO L146 ILogger]: Abstraction has 107 states and 109 transitions. [2019-05-23 10:03:02,649 INFO L146 ILogger]: Interpolant automaton has 27 states. [2019-05-23 10:03:02,649 INFO L146 ILogger]: Start isEmpty. Operand 107 states and 109 transitions. [2019-05-23 10:03:02,649 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 107 [2019-05-23 10:03:02,649 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:02,650 INFO L146 ILogger]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:02,650 INFO L146 ILogger]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:02,650 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:02,650 INFO L146 ILogger]: Analyzing trace with hash 64527211, now seen corresponding path program 23 times [2019-05-23 10:03:02,651 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:02,663 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:02,665 INFO L146 ILogger]: Trace formula consists of 149 conjuncts, 28 conjunts are in the unsatisfiable core [2019-05-23 10:03:02,667 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:03,049 INFO L146 ILogger]: Checked inductivity of 588 backedges. 378 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:03,049 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:03,049 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-05-23 10:03:03,049 INFO L146 ILogger]: Interpolant automaton has 29 states [2019-05-23 10:03:03,050 INFO L146 ILogger]: Constructing interpolant automaton starting with 29 interpolants. [2019-05-23 10:03:03,050 INFO L146 ILogger]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-05-23 10:03:03,050 INFO L146 ILogger]: Start difference. First operand 107 states and 109 transitions. Second operand 29 states. [2019-05-23 10:03:03,636 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:03,637 INFO L146 ILogger]: Finished difference Result 174 states and 176 transitions. [2019-05-23 10:03:03,637 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-05-23 10:03:03,637 INFO L146 ILogger]: Start accepts. Automaton has 29 states. Word has length 106 [2019-05-23 10:03:03,637 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:03,638 INFO L146 ILogger]: With dead ends: 174 [2019-05-23 10:03:03,638 INFO L146 ILogger]: Without dead ends: 112 [2019-05-23 10:03:03,638 INFO L146 ILogger]: 0 DeclaredPredicates, 119 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=462, Invalid=1344, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 10:03:03,639 INFO L146 ILogger]: Start minimizeSevpa. Operand 112 states. [2019-05-23 10:03:03,640 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-05-23 10:03:03,640 INFO L146 ILogger]: Start removeUnreachable. Operand 110 states. [2019-05-23 10:03:03,640 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-05-23 10:03:03,640 INFO L146 ILogger]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 106 [2019-05-23 10:03:03,641 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:03,641 INFO L146 ILogger]: Abstraction has 110 states and 112 transitions. [2019-05-23 10:03:03,641 INFO L146 ILogger]: Interpolant automaton has 29 states. [2019-05-23 10:03:03,641 INFO L146 ILogger]: Start isEmpty. Operand 110 states and 112 transitions. [2019-05-23 10:03:03,642 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 110 [2019-05-23 10:03:03,642 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:03,642 INFO L146 ILogger]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:03,642 INFO L146 ILogger]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:03,642 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:03,642 INFO L146 ILogger]: Analyzing trace with hash -1361871282, now seen corresponding path program 24 times [2019-05-23 10:03:03,643 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:03,655 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:03,656 INFO L146 ILogger]: Trace formula consists of 153 conjuncts, 55 conjunts are in the unsatisfiable core [2019-05-23 10:03:03,658 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:04,053 INFO L146 ILogger]: Checked inductivity of 625 backedges. 12 proven. 613 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:04,054 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:04,054 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-05-23 10:03:04,054 INFO L146 ILogger]: Interpolant automaton has 29 states [2019-05-23 10:03:04,054 INFO L146 ILogger]: Constructing interpolant automaton starting with 29 interpolants. [2019-05-23 10:03:04,055 INFO L146 ILogger]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2019-05-23 10:03:04,055 INFO L146 ILogger]: Start difference. First operand 110 states and 112 transitions. Second operand 29 states. [2019-05-23 10:03:05,152 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:05,153 INFO L146 ILogger]: Finished difference Result 119 states and 121 transitions. [2019-05-23 10:03:05,153 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-23 10:03:05,153 INFO L146 ILogger]: Start accepts. Automaton has 29 states. Word has length 109 [2019-05-23 10:03:05,154 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:05,154 INFO L146 ILogger]: With dead ends: 119 [2019-05-23 10:03:05,155 INFO L146 ILogger]: Without dead ends: 119 [2019-05-23 10:03:05,156 INFO L146 ILogger]: 0 DeclaredPredicates, 109 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2019-05-23 10:03:05,156 INFO L146 ILogger]: Start minimizeSevpa. Operand 119 states. [2019-05-23 10:03:05,158 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 119 to 115. [2019-05-23 10:03:05,158 INFO L146 ILogger]: Start removeUnreachable. Operand 115 states. [2019-05-23 10:03:05,159 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-05-23 10:03:05,159 INFO L146 ILogger]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 109 [2019-05-23 10:03:05,159 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:05,159 INFO L146 ILogger]: Abstraction has 115 states and 117 transitions. [2019-05-23 10:03:05,159 INFO L146 ILogger]: Interpolant automaton has 29 states. [2019-05-23 10:03:05,159 INFO L146 ILogger]: Start isEmpty. Operand 115 states and 117 transitions. [2019-05-23 10:03:05,160 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 115 [2019-05-23 10:03:05,160 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:05,160 INFO L146 ILogger]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:05,160 INFO L146 ILogger]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:05,161 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:05,161 INFO L146 ILogger]: Analyzing trace with hash -1865671448, now seen corresponding path program 25 times [2019-05-23 10:03:05,161 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:05,174 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:05,175 INFO L146 ILogger]: Trace formula consists of 160 conjuncts, 30 conjunts are in the unsatisfiable core [2019-05-23 10:03:05,177 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:05,658 INFO L146 ILogger]: Checked inductivity of 689 backedges. 442 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:05,659 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:05,659 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-05-23 10:03:05,659 INFO L146 ILogger]: Interpolant automaton has 31 states [2019-05-23 10:03:05,659 INFO L146 ILogger]: Constructing interpolant automaton starting with 31 interpolants. [2019-05-23 10:03:05,660 INFO L146 ILogger]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-05-23 10:03:05,660 INFO L146 ILogger]: Start difference. First operand 115 states and 117 transitions. Second operand 31 states. [2019-05-23 10:03:06,127 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:06,127 INFO L146 ILogger]: Finished difference Result 187 states and 189 transitions. [2019-05-23 10:03:06,128 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-05-23 10:03:06,128 INFO L146 ILogger]: Start accepts. Automaton has 31 states. Word has length 114 [2019-05-23 10:03:06,128 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:06,129 INFO L146 ILogger]: With dead ends: 187 [2019-05-23 10:03:06,129 INFO L146 ILogger]: Without dead ends: 120 [2019-05-23 10:03:06,131 INFO L146 ILogger]: 0 DeclaredPredicates, 128 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=525, Invalid=1545, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 10:03:06,131 INFO L146 ILogger]: Start minimizeSevpa. Operand 120 states. [2019-05-23 10:03:06,133 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 120 to 118. [2019-05-23 10:03:06,133 INFO L146 ILogger]: Start removeUnreachable. Operand 118 states. [2019-05-23 10:03:06,133 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2019-05-23 10:03:06,134 INFO L146 ILogger]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 114 [2019-05-23 10:03:06,134 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:06,134 INFO L146 ILogger]: Abstraction has 118 states and 120 transitions. [2019-05-23 10:03:06,134 INFO L146 ILogger]: Interpolant automaton has 31 states. [2019-05-23 10:03:06,134 INFO L146 ILogger]: Start isEmpty. Operand 118 states and 120 transitions. [2019-05-23 10:03:06,135 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 118 [2019-05-23 10:03:06,135 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:06,135 INFO L146 ILogger]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:06,135 INFO L146 ILogger]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:06,135 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:06,136 INFO L146 ILogger]: Analyzing trace with hash -2072810293, now seen corresponding path program 26 times [2019-05-23 10:03:06,136 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:06,149 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:06,151 INFO L146 ILogger]: Trace formula consists of 164 conjuncts, 59 conjunts are in the unsatisfiable core [2019-05-23 10:03:06,152 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:06,605 INFO L146 ILogger]: Checked inductivity of 729 backedges. 13 proven. 716 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:06,605 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:06,605 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-05-23 10:03:06,605 INFO L146 ILogger]: Interpolant automaton has 31 states [2019-05-23 10:03:06,605 INFO L146 ILogger]: Constructing interpolant automaton starting with 31 interpolants. [2019-05-23 10:03:06,606 INFO L146 ILogger]: CoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2019-05-23 10:03:06,606 INFO L146 ILogger]: Start difference. First operand 118 states and 120 transitions. Second operand 31 states. [2019-05-23 10:03:08,025 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:08,025 INFO L146 ILogger]: Finished difference Result 127 states and 129 transitions. [2019-05-23 10:03:08,025 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-05-23 10:03:08,026 INFO L146 ILogger]: Start accepts. Automaton has 31 states. Word has length 117 [2019-05-23 10:03:08,026 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:08,027 INFO L146 ILogger]: With dead ends: 127 [2019-05-23 10:03:08,027 INFO L146 ILogger]: Without dead ends: 127 [2019-05-23 10:03:08,028 INFO L146 ILogger]: 0 DeclaredPredicates, 117 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=915, Unknown=0, NotChecked=0, Total=992 [2019-05-23 10:03:08,029 INFO L146 ILogger]: Start minimizeSevpa. Operand 127 states. [2019-05-23 10:03:08,031 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 127 to 123. [2019-05-23 10:03:08,031 INFO L146 ILogger]: Start removeUnreachable. Operand 123 states. [2019-05-23 10:03:08,032 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 123 states to 123 states and 125 transitions. [2019-05-23 10:03:08,032 INFO L146 ILogger]: Start accepts. Automaton has 123 states and 125 transitions. Word has length 117 [2019-05-23 10:03:08,032 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:08,032 INFO L146 ILogger]: Abstraction has 123 states and 125 transitions. [2019-05-23 10:03:08,032 INFO L146 ILogger]: Interpolant automaton has 31 states. [2019-05-23 10:03:08,032 INFO L146 ILogger]: Start isEmpty. Operand 123 states and 125 transitions. [2019-05-23 10:03:08,033 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 123 [2019-05-23 10:03:08,033 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:08,033 INFO L146 ILogger]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:08,033 INFO L146 ILogger]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:08,034 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:08,034 INFO L146 ILogger]: Analyzing trace with hash 1564390539, now seen corresponding path program 27 times [2019-05-23 10:03:08,034 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:08,047 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:08,049 INFO L146 ILogger]: Trace formula consists of 171 conjuncts, 32 conjunts are in the unsatisfiable core [2019-05-23 10:03:08,051 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:08,622 INFO L146 ILogger]: Checked inductivity of 798 backedges. 511 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:08,622 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:08,623 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-05-23 10:03:08,623 INFO L146 ILogger]: Interpolant automaton has 33 states [2019-05-23 10:03:08,623 INFO L146 ILogger]: Constructing interpolant automaton starting with 33 interpolants. [2019-05-23 10:03:08,624 INFO L146 ILogger]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 10:03:08,624 INFO L146 ILogger]: Start difference. First operand 123 states and 125 transitions. Second operand 33 states. [2019-05-23 10:03:09,346 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:09,347 INFO L146 ILogger]: Finished difference Result 200 states and 202 transitions. [2019-05-23 10:03:09,347 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-05-23 10:03:09,347 INFO L146 ILogger]: Start accepts. Automaton has 33 states. Word has length 122 [2019-05-23 10:03:09,348 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:09,348 INFO L146 ILogger]: With dead ends: 200 [2019-05-23 10:03:09,348 INFO L146 ILogger]: Without dead ends: 128 [2019-05-23 10:03:09,350 INFO L146 ILogger]: 0 DeclaredPredicates, 137 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=592, Invalid=1760, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 10:03:09,350 INFO L146 ILogger]: Start minimizeSevpa. Operand 128 states. [2019-05-23 10:03:09,352 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 128 to 126. [2019-05-23 10:03:09,353 INFO L146 ILogger]: Start removeUnreachable. Operand 126 states. [2019-05-23 10:03:09,353 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2019-05-23 10:03:09,353 INFO L146 ILogger]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 122 [2019-05-23 10:03:09,353 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:09,353 INFO L146 ILogger]: Abstraction has 126 states and 128 transitions. [2019-05-23 10:03:09,353 INFO L146 ILogger]: Interpolant automaton has 33 states. [2019-05-23 10:03:09,354 INFO L146 ILogger]: Start isEmpty. Operand 126 states and 128 transitions. [2019-05-23 10:03:09,354 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 126 [2019-05-23 10:03:09,354 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:09,354 INFO L146 ILogger]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:09,354 INFO L146 ILogger]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:09,355 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:09,355 INFO L146 ILogger]: Analyzing trace with hash 1356165486, now seen corresponding path program 28 times [2019-05-23 10:03:09,355 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:09,370 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:09,372 INFO L146 ILogger]: Trace formula consists of 175 conjuncts, 63 conjunts are in the unsatisfiable core [2019-05-23 10:03:09,373 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:09,969 INFO L146 ILogger]: Checked inductivity of 841 backedges. 14 proven. 827 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:09,969 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:09,969 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-05-23 10:03:09,970 INFO L146 ILogger]: Interpolant automaton has 33 states [2019-05-23 10:03:09,970 INFO L146 ILogger]: Constructing interpolant automaton starting with 33 interpolants. [2019-05-23 10:03:09,970 INFO L146 ILogger]: CoverageRelationStatistics Valid=78, Invalid=978, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 10:03:09,970 INFO L146 ILogger]: Start difference. First operand 126 states and 128 transitions. Second operand 33 states. [2019-05-23 10:03:11,518 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:11,518 INFO L146 ILogger]: Finished difference Result 135 states and 137 transitions. [2019-05-23 10:03:11,519 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-05-23 10:03:11,519 INFO L146 ILogger]: Start accepts. Automaton has 33 states. Word has length 125 [2019-05-23 10:03:11,519 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:11,520 INFO L146 ILogger]: With dead ends: 135 [2019-05-23 10:03:11,520 INFO L146 ILogger]: Without dead ends: 135 [2019-05-23 10:03:11,521 INFO L146 ILogger]: 0 DeclaredPredicates, 125 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=1040, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 10:03:11,522 INFO L146 ILogger]: Start minimizeSevpa. Operand 135 states. [2019-05-23 10:03:11,524 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 135 to 131. [2019-05-23 10:03:11,524 INFO L146 ILogger]: Start removeUnreachable. Operand 131 states. [2019-05-23 10:03:11,524 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2019-05-23 10:03:11,525 INFO L146 ILogger]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 125 [2019-05-23 10:03:11,525 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:11,525 INFO L146 ILogger]: Abstraction has 131 states and 133 transitions. [2019-05-23 10:03:11,525 INFO L146 ILogger]: Interpolant automaton has 33 states. [2019-05-23 10:03:11,525 INFO L146 ILogger]: Start isEmpty. Operand 131 states and 133 transitions. [2019-05-23 10:03:11,526 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 131 [2019-05-23 10:03:11,526 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:11,526 INFO L146 ILogger]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:11,526 INFO L146 ILogger]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:11,526 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:11,527 INFO L146 ILogger]: Analyzing trace with hash -408609336, now seen corresponding path program 29 times [2019-05-23 10:03:11,527 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:11,540 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:11,542 INFO L146 ILogger]: Trace formula consists of 182 conjuncts, 34 conjunts are in the unsatisfiable core [2019-05-23 10:03:11,544 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:12,127 INFO L146 ILogger]: Checked inductivity of 915 backedges. 585 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:12,127 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:12,128 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-05-23 10:03:12,128 INFO L146 ILogger]: Interpolant automaton has 35 states [2019-05-23 10:03:12,128 INFO L146 ILogger]: Constructing interpolant automaton starting with 35 interpolants. [2019-05-23 10:03:12,130 INFO L146 ILogger]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 10:03:12,131 INFO L146 ILogger]: Start difference. First operand 131 states and 133 transitions. Second operand 35 states. [2019-05-23 10:03:12,715 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:12,715 INFO L146 ILogger]: Finished difference Result 213 states and 215 transitions. [2019-05-23 10:03:12,715 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-05-23 10:03:12,715 INFO L146 ILogger]: Start accepts. Automaton has 35 states. Word has length 130 [2019-05-23 10:03:12,716 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:12,717 INFO L146 ILogger]: With dead ends: 213 [2019-05-23 10:03:12,717 INFO L146 ILogger]: Without dead ends: 136 [2019-05-23 10:03:12,718 INFO L146 ILogger]: 0 DeclaredPredicates, 146 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=663, Invalid=1989, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 10:03:12,719 INFO L146 ILogger]: Start minimizeSevpa. Operand 136 states. [2019-05-23 10:03:12,720 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-05-23 10:03:12,720 INFO L146 ILogger]: Start removeUnreachable. Operand 134 states. [2019-05-23 10:03:12,720 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2019-05-23 10:03:12,721 INFO L146 ILogger]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 130 [2019-05-23 10:03:12,721 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:12,721 INFO L146 ILogger]: Abstraction has 134 states and 136 transitions. [2019-05-23 10:03:12,721 INFO L146 ILogger]: Interpolant automaton has 35 states. [2019-05-23 10:03:12,721 INFO L146 ILogger]: Start isEmpty. Operand 134 states and 136 transitions. [2019-05-23 10:03:12,722 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 134 [2019-05-23 10:03:12,722 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:12,722 INFO L146 ILogger]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:12,722 INFO L146 ILogger]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:12,722 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:12,723 INFO L146 ILogger]: Analyzing trace with hash -1620162645, now seen corresponding path program 30 times [2019-05-23 10:03:12,723 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:12,736 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:12,738 INFO L146 ILogger]: Trace formula consists of 186 conjuncts, 67 conjunts are in the unsatisfiable core [2019-05-23 10:03:12,740 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:14,235 INFO L146 ILogger]: Checked inductivity of 961 backedges. 15 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:14,235 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:14,235 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-05-23 10:03:14,235 INFO L146 ILogger]: Interpolant automaton has 35 states [2019-05-23 10:03:14,236 INFO L146 ILogger]: Constructing interpolant automaton starting with 35 interpolants. [2019-05-23 10:03:14,236 INFO L146 ILogger]: CoverageRelationStatistics Valid=83, Invalid=1107, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 10:03:14,236 INFO L146 ILogger]: Start difference. First operand 134 states and 136 transitions. Second operand 35 states. [2019-05-23 10:03:16,106 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:16,106 INFO L146 ILogger]: Finished difference Result 143 states and 145 transitions. [2019-05-23 10:03:16,106 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-23 10:03:16,107 INFO L146 ILogger]: Start accepts. Automaton has 35 states. Word has length 133 [2019-05-23 10:03:16,107 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:16,108 INFO L146 ILogger]: With dead ends: 143 [2019-05-23 10:03:16,108 INFO L146 ILogger]: Without dead ends: 143 [2019-05-23 10:03:16,110 INFO L146 ILogger]: 0 DeclaredPredicates, 133 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 10:03:16,110 INFO L146 ILogger]: Start minimizeSevpa. Operand 143 states. [2019-05-23 10:03:16,112 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 143 to 139. [2019-05-23 10:03:16,112 INFO L146 ILogger]: Start removeUnreachable. Operand 139 states. [2019-05-23 10:03:16,113 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2019-05-23 10:03:16,113 INFO L146 ILogger]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 133 [2019-05-23 10:03:16,113 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:16,113 INFO L146 ILogger]: Abstraction has 139 states and 141 transitions. [2019-05-23 10:03:16,114 INFO L146 ILogger]: Interpolant automaton has 35 states. [2019-05-23 10:03:16,114 INFO L146 ILogger]: Start isEmpty. Operand 139 states and 141 transitions. [2019-05-23 10:03:16,114 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 139 [2019-05-23 10:03:16,114 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:16,115 INFO L146 ILogger]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:16,115 INFO L146 ILogger]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:16,115 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:16,115 INFO L146 ILogger]: Analyzing trace with hash -1925601877, now seen corresponding path program 31 times [2019-05-23 10:03:16,116 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:16,129 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:16,131 INFO L146 ILogger]: Trace formula consists of 193 conjuncts, 36 conjunts are in the unsatisfiable core [2019-05-23 10:03:16,133 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:16,634 INFO L146 ILogger]: Checked inductivity of 1040 backedges. 664 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:16,634 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:16,634 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-05-23 10:03:16,634 INFO L146 ILogger]: Interpolant automaton has 37 states [2019-05-23 10:03:16,635 INFO L146 ILogger]: Constructing interpolant automaton starting with 37 interpolants. [2019-05-23 10:03:16,635 INFO L146 ILogger]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 10:03:16,635 INFO L146 ILogger]: Start difference. First operand 139 states and 141 transitions. Second operand 37 states. [2019-05-23 10:03:17,961 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:17,962 INFO L146 ILogger]: Finished difference Result 226 states and 228 transitions. [2019-05-23 10:03:17,962 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-05-23 10:03:17,962 INFO L146 ILogger]: Start accepts. Automaton has 37 states. Word has length 138 [2019-05-23 10:03:17,963 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:17,964 INFO L146 ILogger]: With dead ends: 226 [2019-05-23 10:03:17,964 INFO L146 ILogger]: Without dead ends: 144 [2019-05-23 10:03:17,965 INFO L146 ILogger]: 0 DeclaredPredicates, 155 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=738, Invalid=2232, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 10:03:17,965 INFO L146 ILogger]: Start minimizeSevpa. Operand 144 states. [2019-05-23 10:03:17,967 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-05-23 10:03:17,967 INFO L146 ILogger]: Start removeUnreachable. Operand 142 states. [2019-05-23 10:03:17,968 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2019-05-23 10:03:17,968 INFO L146 ILogger]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 138 [2019-05-23 10:03:17,968 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:17,968 INFO L146 ILogger]: Abstraction has 142 states and 144 transitions. [2019-05-23 10:03:17,968 INFO L146 ILogger]: Interpolant automaton has 37 states. [2019-05-23 10:03:17,969 INFO L146 ILogger]: Start isEmpty. Operand 142 states and 144 transitions. [2019-05-23 10:03:17,969 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 142 [2019-05-23 10:03:17,969 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:17,969 INFO L146 ILogger]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:17,970 INFO L146 ILogger]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:17,970 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:17,970 INFO L146 ILogger]: Analyzing trace with hash -629654386, now seen corresponding path program 32 times [2019-05-23 10:03:17,971 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:17,984 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:17,986 INFO L146 ILogger]: Trace formula consists of 197 conjuncts, 71 conjunts are in the unsatisfiable core [2019-05-23 10:03:17,988 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:18,805 INFO L146 ILogger]: Checked inductivity of 1089 backedges. 16 proven. 1073 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:18,806 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:18,806 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-05-23 10:03:18,806 INFO L146 ILogger]: Interpolant automaton has 37 states [2019-05-23 10:03:18,806 INFO L146 ILogger]: Constructing interpolant automaton starting with 37 interpolants. [2019-05-23 10:03:18,807 INFO L146 ILogger]: CoverageRelationStatistics Valid=88, Invalid=1244, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 10:03:18,807 INFO L146 ILogger]: Start difference. First operand 142 states and 144 transitions. Second operand 37 states. [2019-05-23 10:03:20,738 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:20,738 INFO L146 ILogger]: Finished difference Result 151 states and 153 transitions. [2019-05-23 10:03:20,738 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-05-23 10:03:20,739 INFO L146 ILogger]: Start accepts. Automaton has 37 states. Word has length 141 [2019-05-23 10:03:20,739 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:20,740 INFO L146 ILogger]: With dead ends: 151 [2019-05-23 10:03:20,740 INFO L146 ILogger]: Without dead ends: 151 [2019-05-23 10:03:20,741 INFO L146 ILogger]: 0 DeclaredPredicates, 141 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=1314, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 10:03:20,741 INFO L146 ILogger]: Start minimizeSevpa. Operand 151 states. [2019-05-23 10:03:20,744 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 151 to 147. [2019-05-23 10:03:20,744 INFO L146 ILogger]: Start removeUnreachable. Operand 147 states. [2019-05-23 10:03:20,745 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-05-23 10:03:20,745 INFO L146 ILogger]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 141 [2019-05-23 10:03:20,745 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:20,745 INFO L146 ILogger]: Abstraction has 147 states and 149 transitions. [2019-05-23 10:03:20,745 INFO L146 ILogger]: Interpolant automaton has 37 states. [2019-05-23 10:03:20,746 INFO L146 ILogger]: Start isEmpty. Operand 147 states and 149 transitions. [2019-05-23 10:03:20,746 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 147 [2019-05-23 10:03:20,746 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:20,746 INFO L146 ILogger]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:20,747 INFO L146 ILogger]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:20,747 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:20,747 INFO L146 ILogger]: Analyzing trace with hash -1314634072, now seen corresponding path program 33 times [2019-05-23 10:03:20,748 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:20,762 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:20,764 INFO L146 ILogger]: Trace formula consists of 204 conjuncts, 38 conjunts are in the unsatisfiable core [2019-05-23 10:03:20,766 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:21,268 INFO L146 ILogger]: Checked inductivity of 1173 backedges. 748 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:21,269 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:21,269 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-05-23 10:03:21,269 INFO L146 ILogger]: Interpolant automaton has 39 states [2019-05-23 10:03:21,270 INFO L146 ILogger]: Constructing interpolant automaton starting with 39 interpolants. [2019-05-23 10:03:21,270 INFO L146 ILogger]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 10:03:21,270 INFO L146 ILogger]: Start difference. First operand 147 states and 149 transitions. Second operand 39 states. [2019-05-23 10:03:21,873 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:21,873 INFO L146 ILogger]: Finished difference Result 239 states and 241 transitions. [2019-05-23 10:03:21,873 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-05-23 10:03:21,874 INFO L146 ILogger]: Start accepts. Automaton has 39 states. Word has length 146 [2019-05-23 10:03:21,874 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:21,875 INFO L146 ILogger]: With dead ends: 239 [2019-05-23 10:03:21,875 INFO L146 ILogger]: Without dead ends: 152 [2019-05-23 10:03:21,876 INFO L146 ILogger]: 0 DeclaredPredicates, 164 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=817, Invalid=2489, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 10:03:21,876 INFO L146 ILogger]: Start minimizeSevpa. Operand 152 states. [2019-05-23 10:03:21,878 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-05-23 10:03:21,878 INFO L146 ILogger]: Start removeUnreachable. Operand 150 states. [2019-05-23 10:03:21,879 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-05-23 10:03:21,880 INFO L146 ILogger]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-05-23 10:03:21,880 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:21,880 INFO L146 ILogger]: Abstraction has 150 states and 152 transitions. [2019-05-23 10:03:21,881 INFO L146 ILogger]: Interpolant automaton has 39 states. [2019-05-23 10:03:21,881 INFO L146 ILogger]: Start isEmpty. Operand 150 states and 152 transitions. [2019-05-23 10:03:21,881 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 150 [2019-05-23 10:03:21,881 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:21,882 INFO L146 ILogger]: trace histogram [18, 18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:21,883 INFO L146 ILogger]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:21,883 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:21,884 INFO L146 ILogger]: Analyzing trace with hash 1922779787, now seen corresponding path program 34 times [2019-05-23 10:03:21,884 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:21,901 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:21,903 INFO L146 ILogger]: Trace formula consists of 208 conjuncts, 75 conjunts are in the unsatisfiable core [2019-05-23 10:03:21,906 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:23,899 INFO L146 ILogger]: Checked inductivity of 1225 backedges. 17 proven. 1208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:23,899 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:23,900 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-05-23 10:03:23,900 INFO L146 ILogger]: Interpolant automaton has 39 states [2019-05-23 10:03:23,900 INFO L146 ILogger]: Constructing interpolant automaton starting with 39 interpolants. [2019-05-23 10:03:23,900 INFO L146 ILogger]: CoverageRelationStatistics Valid=93, Invalid=1389, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 10:03:23,901 INFO L146 ILogger]: Start difference. First operand 150 states and 152 transitions. Second operand 39 states. [2019-05-23 10:03:26,272 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:26,272 INFO L146 ILogger]: Finished difference Result 159 states and 161 transitions. [2019-05-23 10:03:26,272 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-05-23 10:03:26,272 INFO L146 ILogger]: Start accepts. Automaton has 39 states. Word has length 149 [2019-05-23 10:03:26,273 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:26,274 INFO L146 ILogger]: With dead ends: 159 [2019-05-23 10:03:26,274 INFO L146 ILogger]: Without dead ends: 159 [2019-05-23 10:03:26,275 INFO L146 ILogger]: 0 DeclaredPredicates, 149 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=97, Invalid=1463, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 10:03:26,275 INFO L146 ILogger]: Start minimizeSevpa. Operand 159 states. [2019-05-23 10:03:26,278 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 159 to 155. [2019-05-23 10:03:26,278 INFO L146 ILogger]: Start removeUnreachable. Operand 155 states. [2019-05-23 10:03:26,278 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 155 states to 155 states and 157 transitions. [2019-05-23 10:03:26,278 INFO L146 ILogger]: Start accepts. Automaton has 155 states and 157 transitions. Word has length 149 [2019-05-23 10:03:26,279 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:26,279 INFO L146 ILogger]: Abstraction has 155 states and 157 transitions. [2019-05-23 10:03:26,279 INFO L146 ILogger]: Interpolant automaton has 39 states. [2019-05-23 10:03:26,279 INFO L146 ILogger]: Start isEmpty. Operand 155 states and 157 transitions. [2019-05-23 10:03:26,280 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 155 [2019-05-23 10:03:26,280 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:26,280 INFO L146 ILogger]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:26,280 INFO L146 ILogger]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:26,280 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:26,281 INFO L146 ILogger]: Analyzing trace with hash -1776587061, now seen corresponding path program 35 times [2019-05-23 10:03:26,282 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:26,297 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:26,299 INFO L146 ILogger]: Trace formula consists of 215 conjuncts, 40 conjunts are in the unsatisfiable core [2019-05-23 10:03:26,302 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:27,431 INFO L146 ILogger]: Checked inductivity of 1314 backedges. 837 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:27,431 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:27,431 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-05-23 10:03:27,431 INFO L146 ILogger]: Interpolant automaton has 41 states [2019-05-23 10:03:27,432 INFO L146 ILogger]: Constructing interpolant automaton starting with 41 interpolants. [2019-05-23 10:03:27,432 INFO L146 ILogger]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 10:03:27,432 INFO L146 ILogger]: Start difference. First operand 155 states and 157 transitions. Second operand 41 states. [2019-05-23 10:03:28,154 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:28,154 INFO L146 ILogger]: Finished difference Result 252 states and 254 transitions. [2019-05-23 10:03:28,154 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-05-23 10:03:28,154 INFO L146 ILogger]: Start accepts. Automaton has 41 states. Word has length 154 [2019-05-23 10:03:28,155 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:28,156 INFO L146 ILogger]: With dead ends: 252 [2019-05-23 10:03:28,156 INFO L146 ILogger]: Without dead ends: 160 [2019-05-23 10:03:28,157 INFO L146 ILogger]: 0 DeclaredPredicates, 173 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=900, Invalid=2760, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 10:03:28,158 INFO L146 ILogger]: Start minimizeSevpa. Operand 160 states. [2019-05-23 10:03:28,159 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 160 to 158. [2019-05-23 10:03:28,159 INFO L146 ILogger]: Start removeUnreachable. Operand 158 states. [2019-05-23 10:03:28,160 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 158 states to 158 states and 160 transitions. [2019-05-23 10:03:28,160 INFO L146 ILogger]: Start accepts. Automaton has 158 states and 160 transitions. Word has length 154 [2019-05-23 10:03:28,160 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:28,160 INFO L146 ILogger]: Abstraction has 158 states and 160 transitions. [2019-05-23 10:03:28,160 INFO L146 ILogger]: Interpolant automaton has 41 states. [2019-05-23 10:03:28,161 INFO L146 ILogger]: Start isEmpty. Operand 158 states and 160 transitions. [2019-05-23 10:03:28,161 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 158 [2019-05-23 10:03:28,161 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:28,162 INFO L146 ILogger]: trace histogram [19, 19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:28,162 INFO L146 ILogger]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:28,162 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:28,162 INFO L146 ILogger]: Analyzing trace with hash -1240604754, now seen corresponding path program 36 times [2019-05-23 10:03:28,163 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:28,177 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:28,179 INFO L146 ILogger]: Trace formula consists of 219 conjuncts, 79 conjunts are in the unsatisfiable core [2019-05-23 10:03:28,181 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:28,935 INFO L146 ILogger]: Checked inductivity of 1369 backedges. 18 proven. 1351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:28,935 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:28,935 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-05-23 10:03:28,936 INFO L146 ILogger]: Interpolant automaton has 41 states [2019-05-23 10:03:28,936 INFO L146 ILogger]: Constructing interpolant automaton starting with 41 interpolants. [2019-05-23 10:03:28,937 INFO L146 ILogger]: CoverageRelationStatistics Valid=98, Invalid=1542, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 10:03:28,937 INFO L146 ILogger]: Start difference. First operand 158 states and 160 transitions. Second operand 41 states. [2019-05-23 10:03:31,777 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:31,777 INFO L146 ILogger]: Finished difference Result 167 states and 169 transitions. [2019-05-23 10:03:31,777 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-23 10:03:31,778 INFO L146 ILogger]: Start accepts. Automaton has 41 states. Word has length 157 [2019-05-23 10:03:31,778 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:31,782 INFO L146 ILogger]: With dead ends: 167 [2019-05-23 10:03:31,782 INFO L146 ILogger]: Without dead ends: 167 [2019-05-23 10:03:31,783 INFO L146 ILogger]: 0 DeclaredPredicates, 157 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=1620, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 10:03:31,783 INFO L146 ILogger]: Start minimizeSevpa. Operand 167 states. [2019-05-23 10:03:31,786 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 167 to 163. [2019-05-23 10:03:31,786 INFO L146 ILogger]: Start removeUnreachable. Operand 163 states. [2019-05-23 10:03:31,786 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 163 states to 163 states and 165 transitions. [2019-05-23 10:03:31,786 INFO L146 ILogger]: Start accepts. Automaton has 163 states and 165 transitions. Word has length 157 [2019-05-23 10:03:31,787 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:31,787 INFO L146 ILogger]: Abstraction has 163 states and 165 transitions. [2019-05-23 10:03:31,787 INFO L146 ILogger]: Interpolant automaton has 41 states. [2019-05-23 10:03:31,787 INFO L146 ILogger]: Start isEmpty. Operand 163 states and 165 transitions. [2019-05-23 10:03:31,788 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 163 [2019-05-23 10:03:31,788 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:31,788 INFO L146 ILogger]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:31,788 INFO L146 ILogger]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:31,789 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:31,789 INFO L146 ILogger]: Analyzing trace with hash 666343304, now seen corresponding path program 37 times [2019-05-23 10:03:31,789 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:31,806 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:31,809 INFO L146 ILogger]: Trace formula consists of 226 conjuncts, 42 conjunts are in the unsatisfiable core [2019-05-23 10:03:31,811 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:34,535 INFO L146 ILogger]: Checked inductivity of 1463 backedges. 931 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:34,535 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:34,535 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-05-23 10:03:34,536 INFO L146 ILogger]: Interpolant automaton has 43 states [2019-05-23 10:03:34,536 INFO L146 ILogger]: Constructing interpolant automaton starting with 43 interpolants. [2019-05-23 10:03:34,536 INFO L146 ILogger]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 10:03:34,536 INFO L146 ILogger]: Start difference. First operand 163 states and 165 transitions. Second operand 43 states. [2019-05-23 10:03:35,333 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:35,333 INFO L146 ILogger]: Finished difference Result 265 states and 267 transitions. [2019-05-23 10:03:35,333 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-05-23 10:03:35,333 INFO L146 ILogger]: Start accepts. Automaton has 43 states. Word has length 162 [2019-05-23 10:03:35,334 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:35,337 INFO L146 ILogger]: With dead ends: 265 [2019-05-23 10:03:35,337 INFO L146 ILogger]: Without dead ends: 168 [2019-05-23 10:03:35,338 INFO L146 ILogger]: 0 DeclaredPredicates, 182 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=987, Invalid=3045, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 10:03:35,338 INFO L146 ILogger]: Start minimizeSevpa. Operand 168 states. [2019-05-23 10:03:35,340 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 168 to 166. [2019-05-23 10:03:35,340 INFO L146 ILogger]: Start removeUnreachable. Operand 166 states. [2019-05-23 10:03:35,340 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2019-05-23 10:03:35,340 INFO L146 ILogger]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 162 [2019-05-23 10:03:35,341 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:35,341 INFO L146 ILogger]: Abstraction has 166 states and 168 transitions. [2019-05-23 10:03:35,341 INFO L146 ILogger]: Interpolant automaton has 43 states. [2019-05-23 10:03:35,341 INFO L146 ILogger]: Start isEmpty. Operand 166 states and 168 transitions. [2019-05-23 10:03:35,342 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 166 [2019-05-23 10:03:35,342 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:35,342 INFO L146 ILogger]: trace histogram [20, 20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:35,342 INFO L146 ILogger]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:35,342 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:35,343 INFO L146 ILogger]: Analyzing trace with hash -1628932757, now seen corresponding path program 38 times [2019-05-23 10:03:35,343 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:35,365 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:35,367 INFO L146 ILogger]: Trace formula consists of 230 conjuncts, 83 conjunts are in the unsatisfiable core [2019-05-23 10:03:35,370 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:36,225 INFO L146 ILogger]: Checked inductivity of 1521 backedges. 19 proven. 1502 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:36,226 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:36,226 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-05-23 10:03:36,226 INFO L146 ILogger]: Interpolant automaton has 43 states [2019-05-23 10:03:36,226 INFO L146 ILogger]: Constructing interpolant automaton starting with 43 interpolants. [2019-05-23 10:03:36,226 INFO L146 ILogger]: CoverageRelationStatistics Valid=103, Invalid=1703, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 10:03:36,226 INFO L146 ILogger]: Start difference. First operand 166 states and 168 transitions. Second operand 43 states. [2019-05-23 10:03:39,056 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:39,057 INFO L146 ILogger]: Finished difference Result 175 states and 177 transitions. [2019-05-23 10:03:39,057 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-05-23 10:03:39,057 INFO L146 ILogger]: Start accepts. Automaton has 43 states. Word has length 165 [2019-05-23 10:03:39,058 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:39,059 INFO L146 ILogger]: With dead ends: 175 [2019-05-23 10:03:39,059 INFO L146 ILogger]: Without dead ends: 175 [2019-05-23 10:03:39,060 INFO L146 ILogger]: 0 DeclaredPredicates, 165 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=1785, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 10:03:39,060 INFO L146 ILogger]: Start minimizeSevpa. Operand 175 states. [2019-05-23 10:03:39,062 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 175 to 171. [2019-05-23 10:03:39,062 INFO L146 ILogger]: Start removeUnreachable. Operand 171 states. [2019-05-23 10:03:39,062 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-05-23 10:03:39,062 INFO L146 ILogger]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 165 [2019-05-23 10:03:39,063 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:39,063 INFO L146 ILogger]: Abstraction has 171 states and 173 transitions. [2019-05-23 10:03:39,063 INFO L146 ILogger]: Interpolant automaton has 43 states. [2019-05-23 10:03:39,063 INFO L146 ILogger]: Start isEmpty. Operand 171 states and 173 transitions. [2019-05-23 10:03:39,064 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 171 [2019-05-23 10:03:39,064 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:39,064 INFO L146 ILogger]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:39,064 INFO L146 ILogger]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:39,065 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:39,065 INFO L146 ILogger]: Analyzing trace with hash 1001787371, now seen corresponding path program 39 times [2019-05-23 10:03:39,065 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:39,081 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:39,086 INFO L146 ILogger]: Trace formula consists of 237 conjuncts, 44 conjunts are in the unsatisfiable core [2019-05-23 10:03:39,089 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:39,792 INFO L146 ILogger]: Checked inductivity of 1620 backedges. 1030 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:39,792 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:39,793 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-05-23 10:03:39,793 INFO L146 ILogger]: Interpolant automaton has 45 states [2019-05-23 10:03:39,793 INFO L146 ILogger]: Constructing interpolant automaton starting with 45 interpolants. [2019-05-23 10:03:39,794 INFO L146 ILogger]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 10:03:39,794 INFO L146 ILogger]: Start difference. First operand 171 states and 173 transitions. Second operand 45 states. [2019-05-23 10:03:40,608 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:40,608 INFO L146 ILogger]: Finished difference Result 278 states and 280 transitions. [2019-05-23 10:03:40,609 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-05-23 10:03:40,609 INFO L146 ILogger]: Start accepts. Automaton has 45 states. Word has length 170 [2019-05-23 10:03:40,609 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:40,610 INFO L146 ILogger]: With dead ends: 278 [2019-05-23 10:03:40,610 INFO L146 ILogger]: Without dead ends: 176 [2019-05-23 10:03:40,611 INFO L146 ILogger]: 0 DeclaredPredicates, 191 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1078, Invalid=3344, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 10:03:40,612 INFO L146 ILogger]: Start minimizeSevpa. Operand 176 states. [2019-05-23 10:03:40,613 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 176 to 174. [2019-05-23 10:03:40,613 INFO L146 ILogger]: Start removeUnreachable. Operand 174 states. [2019-05-23 10:03:40,614 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 174 states to 174 states and 176 transitions. [2019-05-23 10:03:40,614 INFO L146 ILogger]: Start accepts. Automaton has 174 states and 176 transitions. Word has length 170 [2019-05-23 10:03:40,614 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:40,614 INFO L146 ILogger]: Abstraction has 174 states and 176 transitions. [2019-05-23 10:03:40,614 INFO L146 ILogger]: Interpolant automaton has 45 states. [2019-05-23 10:03:40,614 INFO L146 ILogger]: Start isEmpty. Operand 174 states and 176 transitions. [2019-05-23 10:03:40,615 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 174 [2019-05-23 10:03:40,615 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:40,615 INFO L146 ILogger]: trace histogram [21, 21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:40,615 INFO L146 ILogger]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:40,615 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:40,615 INFO L146 ILogger]: Analyzing trace with hash 258497230, now seen corresponding path program 40 times [2019-05-23 10:03:40,616 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:40,632 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:40,635 INFO L146 ILogger]: Trace formula consists of 241 conjuncts, 87 conjunts are in the unsatisfiable core [2019-05-23 10:03:40,637 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:41,513 INFO L146 ILogger]: Checked inductivity of 1681 backedges. 20 proven. 1661 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:41,513 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:41,513 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-05-23 10:03:41,514 INFO L146 ILogger]: Interpolant automaton has 45 states [2019-05-23 10:03:41,514 INFO L146 ILogger]: Constructing interpolant automaton starting with 45 interpolants. [2019-05-23 10:03:41,514 INFO L146 ILogger]: CoverageRelationStatistics Valid=108, Invalid=1872, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 10:03:41,514 INFO L146 ILogger]: Start difference. First operand 174 states and 176 transitions. Second operand 45 states. [2019-05-23 10:03:44,240 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:44,241 INFO L146 ILogger]: Finished difference Result 183 states and 185 transitions. [2019-05-23 10:03:44,241 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-05-23 10:03:44,241 INFO L146 ILogger]: Start accepts. Automaton has 45 states. Word has length 173 [2019-05-23 10:03:44,242 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:44,242 INFO L146 ILogger]: With dead ends: 183 [2019-05-23 10:03:44,243 INFO L146 ILogger]: Without dead ends: 183 [2019-05-23 10:03:44,243 INFO L146 ILogger]: 0 DeclaredPredicates, 173 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=112, Invalid=1958, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 10:03:44,243 INFO L146 ILogger]: Start minimizeSevpa. Operand 183 states. [2019-05-23 10:03:44,246 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 183 to 179. [2019-05-23 10:03:44,246 INFO L146 ILogger]: Start removeUnreachable. Operand 179 states. [2019-05-23 10:03:44,246 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 179 states to 179 states and 181 transitions. [2019-05-23 10:03:44,246 INFO L146 ILogger]: Start accepts. Automaton has 179 states and 181 transitions. Word has length 173 [2019-05-23 10:03:44,247 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:44,247 INFO L146 ILogger]: Abstraction has 179 states and 181 transitions. [2019-05-23 10:03:44,247 INFO L146 ILogger]: Interpolant automaton has 45 states. [2019-05-23 10:03:44,247 INFO L146 ILogger]: Start isEmpty. Operand 179 states and 181 transitions. [2019-05-23 10:03:44,247 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 179 [2019-05-23 10:03:44,247 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:44,247 INFO L146 ILogger]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:44,248 INFO L146 ILogger]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:44,248 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:44,248 INFO L146 ILogger]: Analyzing trace with hash -1320349592, now seen corresponding path program 41 times [2019-05-23 10:03:44,248 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:44,263 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:44,266 INFO L146 ILogger]: Trace formula consists of 248 conjuncts, 46 conjunts are in the unsatisfiable core [2019-05-23 10:03:44,267 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:44,959 INFO L146 ILogger]: Checked inductivity of 1785 backedges. 1134 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:44,960 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:44,960 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-05-23 10:03:44,960 INFO L146 ILogger]: Interpolant automaton has 47 states [2019-05-23 10:03:44,960 INFO L146 ILogger]: Constructing interpolant automaton starting with 47 interpolants. [2019-05-23 10:03:44,961 INFO L146 ILogger]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 10:03:44,961 INFO L146 ILogger]: Start difference. First operand 179 states and 181 transitions. Second operand 47 states. [2019-05-23 10:03:45,800 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:45,800 INFO L146 ILogger]: Finished difference Result 291 states and 293 transitions. [2019-05-23 10:03:45,801 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-05-23 10:03:45,801 INFO L146 ILogger]: Start accepts. Automaton has 47 states. Word has length 178 [2019-05-23 10:03:45,801 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:45,802 INFO L146 ILogger]: With dead ends: 291 [2019-05-23 10:03:45,802 INFO L146 ILogger]: Without dead ends: 184 [2019-05-23 10:03:45,803 INFO L146 ILogger]: 0 DeclaredPredicates, 200 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1173, Invalid=3657, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 10:03:45,803 INFO L146 ILogger]: Start minimizeSevpa. Operand 184 states. [2019-05-23 10:03:45,805 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 184 to 182. [2019-05-23 10:03:45,805 INFO L146 ILogger]: Start removeUnreachable. Operand 182 states. [2019-05-23 10:03:45,805 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-05-23 10:03:45,806 INFO L146 ILogger]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 178 [2019-05-23 10:03:45,806 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:45,806 INFO L146 ILogger]: Abstraction has 182 states and 184 transitions. [2019-05-23 10:03:45,806 INFO L146 ILogger]: Interpolant automaton has 47 states. [2019-05-23 10:03:45,806 INFO L146 ILogger]: Start isEmpty. Operand 182 states and 184 transitions. [2019-05-23 10:03:45,806 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 182 [2019-05-23 10:03:45,806 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:45,807 INFO L146 ILogger]: trace histogram [22, 22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:45,807 INFO L146 ILogger]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:45,807 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:45,807 INFO L146 ILogger]: Analyzing trace with hash -205273013, now seen corresponding path program 42 times [2019-05-23 10:03:45,808 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:45,824 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:45,826 INFO L146 ILogger]: Trace formula consists of 252 conjuncts, 91 conjunts are in the unsatisfiable core [2019-05-23 10:03:45,829 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:47,118 INFO L146 ILogger]: Checked inductivity of 1849 backedges. 21 proven. 1828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:47,119 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:47,119 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-05-23 10:03:47,119 INFO L146 ILogger]: Interpolant automaton has 47 states [2019-05-23 10:03:47,119 INFO L146 ILogger]: Constructing interpolant automaton starting with 47 interpolants. [2019-05-23 10:03:47,120 INFO L146 ILogger]: CoverageRelationStatistics Valid=113, Invalid=2049, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 10:03:47,120 INFO L146 ILogger]: Start difference. First operand 182 states and 184 transitions. Second operand 47 states. [2019-05-23 10:03:50,740 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:50,741 INFO L146 ILogger]: Finished difference Result 191 states and 193 transitions. [2019-05-23 10:03:50,741 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-23 10:03:50,741 INFO L146 ILogger]: Start accepts. Automaton has 47 states. Word has length 181 [2019-05-23 10:03:50,742 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:50,743 INFO L146 ILogger]: With dead ends: 191 [2019-05-23 10:03:50,743 INFO L146 ILogger]: Without dead ends: 191 [2019-05-23 10:03:50,744 INFO L146 ILogger]: 0 DeclaredPredicates, 181 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=117, Invalid=2139, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 10:03:50,744 INFO L146 ILogger]: Start minimizeSevpa. Operand 191 states. [2019-05-23 10:03:50,746 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 191 to 187. [2019-05-23 10:03:50,747 INFO L146 ILogger]: Start removeUnreachable. Operand 187 states. [2019-05-23 10:03:50,747 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 187 states to 187 states and 189 transitions. [2019-05-23 10:03:50,747 INFO L146 ILogger]: Start accepts. Automaton has 187 states and 189 transitions. Word has length 181 [2019-05-23 10:03:50,747 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:50,747 INFO L146 ILogger]: Abstraction has 187 states and 189 transitions. [2019-05-23 10:03:50,748 INFO L146 ILogger]: Interpolant automaton has 47 states. [2019-05-23 10:03:50,748 INFO L146 ILogger]: Start isEmpty. Operand 187 states and 189 transitions. [2019-05-23 10:03:50,748 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 187 [2019-05-23 10:03:50,749 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:50,749 INFO L146 ILogger]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:50,749 INFO L146 ILogger]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:50,749 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:50,749 INFO L146 ILogger]: Analyzing trace with hash 593201419, now seen corresponding path program 43 times [2019-05-23 10:03:50,750 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:50,766 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:50,769 INFO L146 ILogger]: Trace formula consists of 259 conjuncts, 48 conjunts are in the unsatisfiable core [2019-05-23 10:03:50,772 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:51,856 INFO L146 ILogger]: Checked inductivity of 1958 backedges. 1243 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:51,856 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:51,856 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-05-23 10:03:51,856 INFO L146 ILogger]: Interpolant automaton has 49 states [2019-05-23 10:03:51,856 INFO L146 ILogger]: Constructing interpolant automaton starting with 49 interpolants. [2019-05-23 10:03:51,857 INFO L146 ILogger]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 10:03:51,857 INFO L146 ILogger]: Start difference. First operand 187 states and 189 transitions. Second operand 49 states. [2019-05-23 10:03:52,856 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:52,856 INFO L146 ILogger]: Finished difference Result 304 states and 306 transitions. [2019-05-23 10:03:52,856 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-05-23 10:03:52,856 INFO L146 ILogger]: Start accepts. Automaton has 49 states. Word has length 186 [2019-05-23 10:03:52,857 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:52,858 INFO L146 ILogger]: With dead ends: 304 [2019-05-23 10:03:52,858 INFO L146 ILogger]: Without dead ends: 192 [2019-05-23 10:03:52,859 INFO L146 ILogger]: 0 DeclaredPredicates, 209 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1272, Invalid=3984, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 10:03:52,859 INFO L146 ILogger]: Start minimizeSevpa. Operand 192 states. [2019-05-23 10:03:52,861 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 192 to 190. [2019-05-23 10:03:52,861 INFO L146 ILogger]: Start removeUnreachable. Operand 190 states. [2019-05-23 10:03:52,861 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 190 states to 190 states and 192 transitions. [2019-05-23 10:03:52,861 INFO L146 ILogger]: Start accepts. Automaton has 190 states and 192 transitions. Word has length 186 [2019-05-23 10:03:52,862 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:52,862 INFO L146 ILogger]: Abstraction has 190 states and 192 transitions. [2019-05-23 10:03:52,862 INFO L146 ILogger]: Interpolant automaton has 49 states. [2019-05-23 10:03:52,862 INFO L146 ILogger]: Start isEmpty. Operand 190 states and 192 transitions. [2019-05-23 10:03:52,862 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 190 [2019-05-23 10:03:52,862 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:52,863 INFO L146 ILogger]: trace histogram [23, 23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:52,863 INFO L146 ILogger]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:52,863 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:52,863 INFO L146 ILogger]: Analyzing trace with hash -203837970, now seen corresponding path program 44 times [2019-05-23 10:03:52,864 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:52,881 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:52,884 INFO L146 ILogger]: Trace formula consists of 263 conjuncts, 95 conjunts are in the unsatisfiable core [2019-05-23 10:03:52,886 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:54,311 INFO L146 ILogger]: Checked inductivity of 2025 backedges. 22 proven. 2003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:54,311 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:54,311 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-05-23 10:03:54,311 INFO L146 ILogger]: Interpolant automaton has 49 states [2019-05-23 10:03:54,311 INFO L146 ILogger]: Constructing interpolant automaton starting with 49 interpolants. [2019-05-23 10:03:54,312 INFO L146 ILogger]: CoverageRelationStatistics Valid=118, Invalid=2234, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 10:03:54,312 INFO L146 ILogger]: Start difference. First operand 190 states and 192 transitions. Second operand 49 states. [2019-05-23 10:03:57,346 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:57,347 INFO L146 ILogger]: Finished difference Result 199 states and 201 transitions. [2019-05-23 10:03:57,347 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-05-23 10:03:57,347 INFO L146 ILogger]: Start accepts. Automaton has 49 states. Word has length 189 [2019-05-23 10:03:57,347 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:57,348 INFO L146 ILogger]: With dead ends: 199 [2019-05-23 10:03:57,349 INFO L146 ILogger]: Without dead ends: 199 [2019-05-23 10:03:57,349 INFO L146 ILogger]: 0 DeclaredPredicates, 189 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=122, Invalid=2328, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 10:03:57,350 INFO L146 ILogger]: Start minimizeSevpa. Operand 199 states. [2019-05-23 10:03:57,351 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 199 to 195. [2019-05-23 10:03:57,351 INFO L146 ILogger]: Start removeUnreachable. Operand 195 states. [2019-05-23 10:03:57,352 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2019-05-23 10:03:57,352 INFO L146 ILogger]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 189 [2019-05-23 10:03:57,352 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:57,352 INFO L146 ILogger]: Abstraction has 195 states and 197 transitions. [2019-05-23 10:03:57,352 INFO L146 ILogger]: Interpolant automaton has 49 states. [2019-05-23 10:03:57,352 INFO L146 ILogger]: Start isEmpty. Operand 195 states and 197 transitions. [2019-05-23 10:03:57,353 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 195 [2019-05-23 10:03:57,353 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:57,353 INFO L146 ILogger]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:57,353 INFO L146 ILogger]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:57,353 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:57,353 INFO L146 ILogger]: Analyzing trace with hash -1001213624, now seen corresponding path program 45 times [2019-05-23 10:03:57,354 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:57,371 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:57,374 INFO L146 ILogger]: Trace formula consists of 270 conjuncts, 50 conjunts are in the unsatisfiable core [2019-05-23 10:03:57,377 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:59,212 INFO L146 ILogger]: Checked inductivity of 2139 backedges. 1357 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:59,212 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:59,213 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-05-23 10:03:59,213 INFO L146 ILogger]: Interpolant automaton has 51 states [2019-05-23 10:03:59,213 INFO L146 ILogger]: Constructing interpolant automaton starting with 51 interpolants. [2019-05-23 10:03:59,214 INFO L146 ILogger]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 10:03:59,214 INFO L146 ILogger]: Start difference. First operand 195 states and 197 transitions. Second operand 51 states. [2019-05-23 10:04:00,438 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:00,438 INFO L146 ILogger]: Finished difference Result 317 states and 319 transitions. [2019-05-23 10:04:00,438 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-05-23 10:04:00,439 INFO L146 ILogger]: Start accepts. Automaton has 51 states. Word has length 194 [2019-05-23 10:04:00,439 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:00,440 INFO L146 ILogger]: With dead ends: 317 [2019-05-23 10:04:00,440 INFO L146 ILogger]: Without dead ends: 200 [2019-05-23 10:04:00,442 INFO L146 ILogger]: 0 DeclaredPredicates, 218 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1375, Invalid=4325, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 10:04:00,442 INFO L146 ILogger]: Start minimizeSevpa. Operand 200 states. [2019-05-23 10:04:00,444 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 200 to 198. [2019-05-23 10:04:00,444 INFO L146 ILogger]: Start removeUnreachable. Operand 198 states. [2019-05-23 10:04:00,445 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 198 states to 198 states and 200 transitions. [2019-05-23 10:04:00,445 INFO L146 ILogger]: Start accepts. Automaton has 198 states and 200 transitions. Word has length 194 [2019-05-23 10:04:00,445 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:00,445 INFO L146 ILogger]: Abstraction has 198 states and 200 transitions. [2019-05-23 10:04:00,445 INFO L146 ILogger]: Interpolant automaton has 51 states. [2019-05-23 10:04:00,446 INFO L146 ILogger]: Start isEmpty. Operand 198 states and 200 transitions. [2019-05-23 10:04:00,446 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 198 [2019-05-23 10:04:00,446 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:00,447 INFO L146 ILogger]: trace histogram [24, 24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:00,447 INFO L146 ILogger]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:00,447 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:00,447 INFO L146 ILogger]: Analyzing trace with hash 1327186731, now seen corresponding path program 46 times [2019-05-23 10:04:00,448 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:00,466 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:00,469 INFO L146 ILogger]: Trace formula consists of 274 conjuncts, 99 conjunts are in the unsatisfiable core [2019-05-23 10:04:00,472 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:01,820 INFO L146 ILogger]: Checked inductivity of 2209 backedges. 23 proven. 2186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:01,820 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:01,820 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-05-23 10:04:01,820 INFO L146 ILogger]: Interpolant automaton has 51 states [2019-05-23 10:04:01,821 INFO L146 ILogger]: Constructing interpolant automaton starting with 51 interpolants. [2019-05-23 10:04:01,821 INFO L146 ILogger]: CoverageRelationStatistics Valid=123, Invalid=2427, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 10:04:01,821 INFO L146 ILogger]: Start difference. First operand 198 states and 200 transitions. Second operand 51 states. [2019-05-23 10:04:05,475 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:05,475 INFO L146 ILogger]: Finished difference Result 207 states and 209 transitions. [2019-05-23 10:04:05,475 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-05-23 10:04:05,476 INFO L146 ILogger]: Start accepts. Automaton has 51 states. Word has length 197 [2019-05-23 10:04:05,476 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:05,477 INFO L146 ILogger]: With dead ends: 207 [2019-05-23 10:04:05,477 INFO L146 ILogger]: Without dead ends: 207 [2019-05-23 10:04:05,478 INFO L146 ILogger]: 0 DeclaredPredicates, 197 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=127, Invalid=2525, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 10:04:05,478 INFO L146 ILogger]: Start minimizeSevpa. Operand 207 states. [2019-05-23 10:04:05,481 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 207 to 203. [2019-05-23 10:04:05,481 INFO L146 ILogger]: Start removeUnreachable. Operand 203 states. [2019-05-23 10:04:05,482 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-05-23 10:04:05,482 INFO L146 ILogger]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 197 [2019-05-23 10:04:05,482 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:05,482 INFO L146 ILogger]: Abstraction has 203 states and 205 transitions. [2019-05-23 10:04:05,482 INFO L146 ILogger]: Interpolant automaton has 51 states. [2019-05-23 10:04:05,482 INFO L146 ILogger]: Start isEmpty. Operand 203 states and 205 transitions. [2019-05-23 10:04:05,483 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 203 [2019-05-23 10:04:05,483 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:05,483 INFO L146 ILogger]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:05,484 INFO L146 ILogger]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:05,484 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:05,484 INFO L146 ILogger]: Analyzing trace with hash -203564501, now seen corresponding path program 47 times [2019-05-23 10:04:05,485 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:05,503 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:05,506 INFO L146 ILogger]: Trace formula consists of 281 conjuncts, 52 conjunts are in the unsatisfiable core [2019-05-23 10:04:05,508 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:06,603 INFO L146 ILogger]: Checked inductivity of 2328 backedges. 1476 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:06,603 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:06,604 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-05-23 10:04:06,604 INFO L146 ILogger]: Interpolant automaton has 53 states [2019-05-23 10:04:06,604 INFO L146 ILogger]: Constructing interpolant automaton starting with 53 interpolants. [2019-05-23 10:04:06,605 INFO L146 ILogger]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 10:04:06,605 INFO L146 ILogger]: Start difference. First operand 203 states and 205 transitions. Second operand 53 states. [2019-05-23 10:04:07,780 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:07,780 INFO L146 ILogger]: Finished difference Result 330 states and 332 transitions. [2019-05-23 10:04:07,781 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-05-23 10:04:07,781 INFO L146 ILogger]: Start accepts. Automaton has 53 states. Word has length 202 [2019-05-23 10:04:07,782 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:07,783 INFO L146 ILogger]: With dead ends: 330 [2019-05-23 10:04:07,783 INFO L146 ILogger]: Without dead ends: 208 [2019-05-23 10:04:07,784 INFO L146 ILogger]: 0 DeclaredPredicates, 227 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1482, Invalid=4680, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 10:04:07,784 INFO L146 ILogger]: Start minimizeSevpa. Operand 208 states. [2019-05-23 10:04:07,786 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-05-23 10:04:07,786 INFO L146 ILogger]: Start removeUnreachable. Operand 206 states. [2019-05-23 10:04:07,787 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-05-23 10:04:07,787 INFO L146 ILogger]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-05-23 10:04:07,787 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:07,787 INFO L146 ILogger]: Abstraction has 206 states and 208 transitions. [2019-05-23 10:04:07,787 INFO L146 ILogger]: Interpolant automaton has 53 states. [2019-05-23 10:04:07,787 INFO L146 ILogger]: Start isEmpty. Operand 206 states and 208 transitions. [2019-05-23 10:04:07,788 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 206 [2019-05-23 10:04:07,788 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:07,789 INFO L146 ILogger]: trace histogram [25, 25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:07,790 INFO L146 ILogger]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:07,790 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:07,790 INFO L146 ILogger]: Analyzing trace with hash 1916000526, now seen corresponding path program 48 times [2019-05-23 10:04:07,792 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:07,812 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:07,816 INFO L146 ILogger]: Trace formula consists of 285 conjuncts, 103 conjunts are in the unsatisfiable core [2019-05-23 10:04:07,819 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:09,065 INFO L146 ILogger]: Checked inductivity of 2401 backedges. 24 proven. 2377 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:09,065 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:09,065 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-05-23 10:04:09,065 INFO L146 ILogger]: Interpolant automaton has 53 states [2019-05-23 10:04:09,066 INFO L146 ILogger]: Constructing interpolant automaton starting with 53 interpolants. [2019-05-23 10:04:09,066 INFO L146 ILogger]: CoverageRelationStatistics Valid=128, Invalid=2628, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 10:04:09,066 INFO L146 ILogger]: Start difference. First operand 206 states and 208 transitions. Second operand 53 states. [2019-05-23 10:04:13,004 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:13,005 INFO L146 ILogger]: Finished difference Result 215 states and 217 transitions. [2019-05-23 10:04:13,005 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-23 10:04:13,005 INFO L146 ILogger]: Start accepts. Automaton has 53 states. Word has length 205 [2019-05-23 10:04:13,006 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:13,007 INFO L146 ILogger]: With dead ends: 215 [2019-05-23 10:04:13,007 INFO L146 ILogger]: Without dead ends: 215 [2019-05-23 10:04:13,007 INFO L146 ILogger]: 0 DeclaredPredicates, 205 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=132, Invalid=2730, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 10:04:13,008 INFO L146 ILogger]: Start minimizeSevpa. Operand 215 states. [2019-05-23 10:04:13,010 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 215 to 211. [2019-05-23 10:04:13,010 INFO L146 ILogger]: Start removeUnreachable. Operand 211 states. [2019-05-23 10:04:13,011 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 211 states to 211 states and 213 transitions. [2019-05-23 10:04:13,011 INFO L146 ILogger]: Start accepts. Automaton has 211 states and 213 transitions. Word has length 205 [2019-05-23 10:04:13,011 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:13,011 INFO L146 ILogger]: Abstraction has 211 states and 213 transitions. [2019-05-23 10:04:13,011 INFO L146 ILogger]: Interpolant automaton has 53 states. [2019-05-23 10:04:13,011 INFO L146 ILogger]: Start isEmpty. Operand 211 states and 213 transitions. [2019-05-23 10:04:13,012 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 211 [2019-05-23 10:04:13,012 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:13,013 INFO L146 ILogger]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:13,013 INFO L146 ILogger]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:13,013 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:13,013 INFO L146 ILogger]: Analyzing trace with hash -986285528, now seen corresponding path program 49 times [2019-05-23 10:04:13,014 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:13,032 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:13,035 INFO L146 ILogger]: Trace formula consists of 292 conjuncts, 54 conjunts are in the unsatisfiable core [2019-05-23 10:04:13,038 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:16,352 INFO L146 ILogger]: Checked inductivity of 2525 backedges. 1600 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:16,352 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:16,352 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-05-23 10:04:16,353 INFO L146 ILogger]: Interpolant automaton has 55 states [2019-05-23 10:04:16,353 INFO L146 ILogger]: Constructing interpolant automaton starting with 55 interpolants. [2019-05-23 10:04:16,353 INFO L146 ILogger]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 10:04:16,353 INFO L146 ILogger]: Start difference. First operand 211 states and 213 transitions. Second operand 55 states. [2019-05-23 10:04:17,765 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:17,765 INFO L146 ILogger]: Finished difference Result 343 states and 345 transitions. [2019-05-23 10:04:17,765 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-05-23 10:04:17,765 INFO L146 ILogger]: Start accepts. Automaton has 55 states. Word has length 210 [2019-05-23 10:04:17,766 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:17,767 INFO L146 ILogger]: With dead ends: 343 [2019-05-23 10:04:17,767 INFO L146 ILogger]: Without dead ends: 216 [2019-05-23 10:04:17,768 INFO L146 ILogger]: 0 DeclaredPredicates, 236 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1593, Invalid=5049, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 10:04:17,769 INFO L146 ILogger]: Start minimizeSevpa. Operand 216 states. [2019-05-23 10:04:17,771 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 216 to 214. [2019-05-23 10:04:17,771 INFO L146 ILogger]: Start removeUnreachable. Operand 214 states. [2019-05-23 10:04:17,771 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 214 states to 214 states and 216 transitions. [2019-05-23 10:04:17,771 INFO L146 ILogger]: Start accepts. Automaton has 214 states and 216 transitions. Word has length 210 [2019-05-23 10:04:17,772 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:17,772 INFO L146 ILogger]: Abstraction has 214 states and 216 transitions. [2019-05-23 10:04:17,772 INFO L146 ILogger]: Interpolant automaton has 55 states. [2019-05-23 10:04:17,772 INFO L146 ILogger]: Start isEmpty. Operand 214 states and 216 transitions. [2019-05-23 10:04:17,773 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 214 [2019-05-23 10:04:17,773 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:17,773 INFO L146 ILogger]: trace histogram [26, 26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:17,773 INFO L146 ILogger]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:17,773 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:17,774 INFO L146 ILogger]: Analyzing trace with hash 2103240203, now seen corresponding path program 50 times [2019-05-23 10:04:17,774 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:17,793 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:17,796 INFO L146 ILogger]: Trace formula consists of 296 conjuncts, 107 conjunts are in the unsatisfiable core [2019-05-23 10:04:17,799 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:19,326 INFO L146 ILogger]: Checked inductivity of 2601 backedges. 25 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:19,327 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:19,327 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-05-23 10:04:19,327 INFO L146 ILogger]: Interpolant automaton has 55 states [2019-05-23 10:04:19,327 INFO L146 ILogger]: Constructing interpolant automaton starting with 55 interpolants. [2019-05-23 10:04:19,327 INFO L146 ILogger]: CoverageRelationStatistics Valid=133, Invalid=2837, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 10:04:19,328 INFO L146 ILogger]: Start difference. First operand 214 states and 216 transitions. Second operand 55 states. [2019-05-23 10:04:23,293 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:23,294 INFO L146 ILogger]: Finished difference Result 223 states and 225 transitions. [2019-05-23 10:04:23,294 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-05-23 10:04:23,294 INFO L146 ILogger]: Start accepts. Automaton has 55 states. Word has length 213 [2019-05-23 10:04:23,294 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:23,295 INFO L146 ILogger]: With dead ends: 223 [2019-05-23 10:04:23,296 INFO L146 ILogger]: Without dead ends: 223 [2019-05-23 10:04:23,296 INFO L146 ILogger]: 0 DeclaredPredicates, 213 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=137, Invalid=2943, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 10:04:23,296 INFO L146 ILogger]: Start minimizeSevpa. Operand 223 states. [2019-05-23 10:04:23,299 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 223 to 219. [2019-05-23 10:04:23,299 INFO L146 ILogger]: Start removeUnreachable. Operand 219 states. [2019-05-23 10:04:23,299 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 219 states to 219 states and 221 transitions. [2019-05-23 10:04:23,299 INFO L146 ILogger]: Start accepts. Automaton has 219 states and 221 transitions. Word has length 213 [2019-05-23 10:04:23,300 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:23,300 INFO L146 ILogger]: Abstraction has 219 states and 221 transitions. [2019-05-23 10:04:23,300 INFO L146 ILogger]: Interpolant automaton has 55 states. [2019-05-23 10:04:23,300 INFO L146 ILogger]: Start isEmpty. Operand 219 states and 221 transitions. [2019-05-23 10:04:23,300 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 219 [2019-05-23 10:04:23,301 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:23,301 INFO L146 ILogger]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:23,301 INFO L146 ILogger]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:23,301 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:23,301 INFO L146 ILogger]: Analyzing trace with hash 1972306763, now seen corresponding path program 51 times [2019-05-23 10:04:23,302 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:23,322 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:23,325 INFO L146 ILogger]: Trace formula consists of 303 conjuncts, 56 conjunts are in the unsatisfiable core [2019-05-23 10:04:23,328 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:24,387 INFO L146 ILogger]: Checked inductivity of 2730 backedges. 1729 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:24,388 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:24,388 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-05-23 10:04:24,388 INFO L146 ILogger]: Interpolant automaton has 57 states [2019-05-23 10:04:24,388 INFO L146 ILogger]: Constructing interpolant automaton starting with 57 interpolants. [2019-05-23 10:04:24,389 INFO L146 ILogger]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 10:04:24,389 INFO L146 ILogger]: Start difference. First operand 219 states and 221 transitions. Second operand 57 states. [2019-05-23 10:04:25,842 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:25,842 INFO L146 ILogger]: Finished difference Result 356 states and 358 transitions. [2019-05-23 10:04:25,842 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-05-23 10:04:25,843 INFO L146 ILogger]: Start accepts. Automaton has 57 states. Word has length 218 [2019-05-23 10:04:25,843 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:25,844 INFO L146 ILogger]: With dead ends: 356 [2019-05-23 10:04:25,845 INFO L146 ILogger]: Without dead ends: 224 [2019-05-23 10:04:25,845 INFO L146 ILogger]: 0 DeclaredPredicates, 245 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1708, Invalid=5432, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 10:04:25,846 INFO L146 ILogger]: Start minimizeSevpa. Operand 224 states. [2019-05-23 10:04:25,848 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 224 to 222. [2019-05-23 10:04:25,848 INFO L146 ILogger]: Start removeUnreachable. Operand 222 states. [2019-05-23 10:04:25,849 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 222 states to 222 states and 224 transitions. [2019-05-23 10:04:25,849 INFO L146 ILogger]: Start accepts. Automaton has 222 states and 224 transitions. Word has length 218 [2019-05-23 10:04:25,849 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:25,849 INFO L146 ILogger]: Abstraction has 222 states and 224 transitions. [2019-05-23 10:04:25,849 INFO L146 ILogger]: Interpolant automaton has 57 states. [2019-05-23 10:04:25,849 INFO L146 ILogger]: Start isEmpty. Operand 222 states and 224 transitions. [2019-05-23 10:04:25,850 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 222 [2019-05-23 10:04:25,850 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:25,850 INFO L146 ILogger]: trace histogram [27, 27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:25,851 INFO L146 ILogger]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:25,851 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:25,851 INFO L146 ILogger]: Analyzing trace with hash -1161241554, now seen corresponding path program 52 times [2019-05-23 10:04:25,852 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:25,872 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:25,875 INFO L146 ILogger]: Trace formula consists of 307 conjuncts, 111 conjunts are in the unsatisfiable core [2019-05-23 10:04:25,878 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:27,249 INFO L146 ILogger]: Checked inductivity of 2809 backedges. 26 proven. 2783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:27,249 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:27,250 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-05-23 10:04:27,250 INFO L146 ILogger]: Interpolant automaton has 57 states [2019-05-23 10:04:27,250 INFO L146 ILogger]: Constructing interpolant automaton starting with 57 interpolants. [2019-05-23 10:04:27,250 INFO L146 ILogger]: CoverageRelationStatistics Valid=138, Invalid=3054, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 10:04:27,250 INFO L146 ILogger]: Start difference. First operand 222 states and 224 transitions. Second operand 57 states. [2019-05-23 10:04:31,953 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:31,953 INFO L146 ILogger]: Finished difference Result 231 states and 233 transitions. [2019-05-23 10:04:31,954 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-05-23 10:04:31,954 INFO L146 ILogger]: Start accepts. Automaton has 57 states. Word has length 221 [2019-05-23 10:04:31,954 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:31,955 INFO L146 ILogger]: With dead ends: 231 [2019-05-23 10:04:31,955 INFO L146 ILogger]: Without dead ends: 231 [2019-05-23 10:04:31,956 INFO L146 ILogger]: 0 DeclaredPredicates, 221 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=142, Invalid=3164, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 10:04:31,956 INFO L146 ILogger]: Start minimizeSevpa. Operand 231 states. [2019-05-23 10:04:31,958 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 231 to 227. [2019-05-23 10:04:31,958 INFO L146 ILogger]: Start removeUnreachable. Operand 227 states. [2019-05-23 10:04:31,959 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-05-23 10:04:31,959 INFO L146 ILogger]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 221 [2019-05-23 10:04:31,959 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:31,959 INFO L146 ILogger]: Abstraction has 227 states and 229 transitions. [2019-05-23 10:04:31,959 INFO L146 ILogger]: Interpolant automaton has 57 states. [2019-05-23 10:04:31,959 INFO L146 ILogger]: Start isEmpty. Operand 227 states and 229 transitions. [2019-05-23 10:04:31,960 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 227 [2019-05-23 10:04:31,961 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:31,961 INFO L146 ILogger]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:31,961 INFO L146 ILogger]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:31,961 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:31,961 INFO L146 ILogger]: Analyzing trace with hash -421106936, now seen corresponding path program 53 times [2019-05-23 10:04:31,962 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:31,982 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:31,986 INFO L146 ILogger]: Trace formula consists of 314 conjuncts, 58 conjunts are in the unsatisfiable core [2019-05-23 10:04:31,988 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:33,296 INFO L146 ILogger]: Checked inductivity of 2943 backedges. 1863 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:33,296 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:33,296 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-05-23 10:04:33,297 INFO L146 ILogger]: Interpolant automaton has 59 states [2019-05-23 10:04:33,297 INFO L146 ILogger]: Constructing interpolant automaton starting with 59 interpolants. [2019-05-23 10:04:33,297 INFO L146 ILogger]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 10:04:33,298 INFO L146 ILogger]: Start difference. First operand 227 states and 229 transitions. Second operand 59 states. [2019-05-23 10:04:34,704 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:34,705 INFO L146 ILogger]: Finished difference Result 369 states and 371 transitions. [2019-05-23 10:04:34,705 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-05-23 10:04:34,705 INFO L146 ILogger]: Start accepts. Automaton has 59 states. Word has length 226 [2019-05-23 10:04:34,706 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:34,707 INFO L146 ILogger]: With dead ends: 369 [2019-05-23 10:04:34,707 INFO L146 ILogger]: Without dead ends: 232 [2019-05-23 10:04:34,707 INFO L146 ILogger]: 0 DeclaredPredicates, 254 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1827, Invalid=5829, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 10:04:34,708 INFO L146 ILogger]: Start minimizeSevpa. Operand 232 states. [2019-05-23 10:04:34,710 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 232 to 230. [2019-05-23 10:04:34,710 INFO L146 ILogger]: Start removeUnreachable. Operand 230 states. [2019-05-23 10:04:34,711 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 230 states to 230 states and 232 transitions. [2019-05-23 10:04:34,711 INFO L146 ILogger]: Start accepts. Automaton has 230 states and 232 transitions. Word has length 226 [2019-05-23 10:04:34,711 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:34,711 INFO L146 ILogger]: Abstraction has 230 states and 232 transitions. [2019-05-23 10:04:34,711 INFO L146 ILogger]: Interpolant automaton has 59 states. [2019-05-23 10:04:34,711 INFO L146 ILogger]: Start isEmpty. Operand 230 states and 232 transitions. [2019-05-23 10:04:34,712 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 230 [2019-05-23 10:04:34,713 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:34,713 INFO L146 ILogger]: trace histogram [28, 28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:34,713 INFO L146 ILogger]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:34,713 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:34,713 INFO L146 ILogger]: Analyzing trace with hash 427208939, now seen corresponding path program 54 times [2019-05-23 10:04:34,714 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:34,734 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:34,738 INFO L146 ILogger]: Trace formula consists of 318 conjuncts, 115 conjunts are in the unsatisfiable core [2019-05-23 10:04:34,741 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:36,459 INFO L146 ILogger]: Checked inductivity of 3025 backedges. 27 proven. 2998 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:36,459 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:36,459 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-05-23 10:04:36,460 INFO L146 ILogger]: Interpolant automaton has 59 states [2019-05-23 10:04:36,460 INFO L146 ILogger]: Constructing interpolant automaton starting with 59 interpolants. [2019-05-23 10:04:36,460 INFO L146 ILogger]: CoverageRelationStatistics Valid=143, Invalid=3279, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 10:04:36,460 INFO L146 ILogger]: Start difference. First operand 230 states and 232 transitions. Second operand 59 states. [2019-05-23 10:04:41,653 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:41,653 INFO L146 ILogger]: Finished difference Result 239 states and 241 transitions. [2019-05-23 10:04:41,654 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-23 10:04:41,654 INFO L146 ILogger]: Start accepts. Automaton has 59 states. Word has length 229 [2019-05-23 10:04:41,654 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:41,655 INFO L146 ILogger]: With dead ends: 239 [2019-05-23 10:04:41,655 INFO L146 ILogger]: Without dead ends: 239 [2019-05-23 10:04:41,656 INFO L146 ILogger]: 0 DeclaredPredicates, 229 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=147, Invalid=3393, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 10:04:41,656 INFO L146 ILogger]: Start minimizeSevpa. Operand 239 states. [2019-05-23 10:04:41,659 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 239 to 235. [2019-05-23 10:04:41,659 INFO L146 ILogger]: Start removeUnreachable. Operand 235 states. [2019-05-23 10:04:41,659 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 235 states to 235 states and 237 transitions. [2019-05-23 10:04:41,660 INFO L146 ILogger]: Start accepts. Automaton has 235 states and 237 transitions. Word has length 229 [2019-05-23 10:04:41,660 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:41,660 INFO L146 ILogger]: Abstraction has 235 states and 237 transitions. [2019-05-23 10:04:41,660 INFO L146 ILogger]: Interpolant automaton has 59 states. [2019-05-23 10:04:41,660 INFO L146 ILogger]: Start isEmpty. Operand 235 states and 237 transitions. [2019-05-23 10:04:41,661 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 235 [2019-05-23 10:04:41,661 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:41,661 INFO L146 ILogger]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:41,662 INFO L146 ILogger]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:41,662 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:41,662 INFO L146 ILogger]: Analyzing trace with hash -1304361877, now seen corresponding path program 55 times [2019-05-23 10:04:41,663 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:41,684 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:41,687 INFO L146 ILogger]: Trace formula consists of 325 conjuncts, 60 conjunts are in the unsatisfiable core [2019-05-23 10:04:41,690 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:42,951 INFO L146 ILogger]: Checked inductivity of 3164 backedges. 2002 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:42,951 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:42,952 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-05-23 10:04:42,952 INFO L146 ILogger]: Interpolant automaton has 61 states [2019-05-23 10:04:42,953 INFO L146 ILogger]: Constructing interpolant automaton starting with 61 interpolants. [2019-05-23 10:04:42,953 INFO L146 ILogger]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 10:04:42,953 INFO L146 ILogger]: Start difference. First operand 235 states and 237 transitions. Second operand 61 states. [2019-05-23 10:04:44,363 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:44,363 INFO L146 ILogger]: Finished difference Result 382 states and 384 transitions. [2019-05-23 10:04:44,363 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-05-23 10:04:44,363 INFO L146 ILogger]: Start accepts. Automaton has 61 states. Word has length 234 [2019-05-23 10:04:44,364 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:44,365 INFO L146 ILogger]: With dead ends: 382 [2019-05-23 10:04:44,365 INFO L146 ILogger]: Without dead ends: 240 [2019-05-23 10:04:44,366 INFO L146 ILogger]: 0 DeclaredPredicates, 263 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1950, Invalid=6240, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 10:04:44,366 INFO L146 ILogger]: Start minimizeSevpa. Operand 240 states. [2019-05-23 10:04:44,368 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 240 to 238. [2019-05-23 10:04:44,369 INFO L146 ILogger]: Start removeUnreachable. Operand 238 states. [2019-05-23 10:04:44,369 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 238 states to 238 states and 240 transitions. [2019-05-23 10:04:44,369 INFO L146 ILogger]: Start accepts. Automaton has 238 states and 240 transitions. Word has length 234 [2019-05-23 10:04:44,369 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:44,369 INFO L146 ILogger]: Abstraction has 238 states and 240 transitions. [2019-05-23 10:04:44,369 INFO L146 ILogger]: Interpolant automaton has 61 states. [2019-05-23 10:04:44,369 INFO L146 ILogger]: Start isEmpty. Operand 238 states and 240 transitions. [2019-05-23 10:04:44,370 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 238 [2019-05-23 10:04:44,370 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:44,370 INFO L146 ILogger]: trace histogram [29, 29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:44,370 INFO L146 ILogger]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:44,371 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:44,371 INFO L146 ILogger]: Analyzing trace with hash 1063958350, now seen corresponding path program 56 times [2019-05-23 10:04:44,371 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:44,392 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:44,396 INFO L146 ILogger]: Trace formula consists of 329 conjuncts, 119 conjunts are in the unsatisfiable core [2019-05-23 10:04:44,398 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:45,970 INFO L146 ILogger]: Checked inductivity of 3249 backedges. 28 proven. 3221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:45,970 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:45,970 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-05-23 10:04:45,971 INFO L146 ILogger]: Interpolant automaton has 61 states [2019-05-23 10:04:45,971 INFO L146 ILogger]: Constructing interpolant automaton starting with 61 interpolants. [2019-05-23 10:04:45,971 INFO L146 ILogger]: CoverageRelationStatistics Valid=148, Invalid=3512, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 10:04:45,971 INFO L146 ILogger]: Start difference. First operand 238 states and 240 transitions. Second operand 61 states. [2019-05-23 10:04:51,360 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:51,360 INFO L146 ILogger]: Finished difference Result 247 states and 249 transitions. [2019-05-23 10:04:51,360 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-05-23 10:04:51,360 INFO L146 ILogger]: Start accepts. Automaton has 61 states. Word has length 237 [2019-05-23 10:04:51,361 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:51,362 INFO L146 ILogger]: With dead ends: 247 [2019-05-23 10:04:51,362 INFO L146 ILogger]: Without dead ends: 247 [2019-05-23 10:04:51,362 INFO L146 ILogger]: 0 DeclaredPredicates, 237 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=152, Invalid=3630, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 10:04:51,363 INFO L146 ILogger]: Start minimizeSevpa. Operand 247 states. [2019-05-23 10:04:51,365 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 247 to 243. [2019-05-23 10:04:51,365 INFO L146 ILogger]: Start removeUnreachable. Operand 243 states. [2019-05-23 10:04:51,366 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 243 states to 243 states and 245 transitions. [2019-05-23 10:04:51,366 INFO L146 ILogger]: Start accepts. Automaton has 243 states and 245 transitions. Word has length 237 [2019-05-23 10:04:51,366 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:51,366 INFO L146 ILogger]: Abstraction has 243 states and 245 transitions. [2019-05-23 10:04:51,366 INFO L146 ILogger]: Interpolant automaton has 61 states. [2019-05-23 10:04:51,366 INFO L146 ILogger]: Start isEmpty. Operand 243 states and 245 transitions. [2019-05-23 10:04:51,367 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 243 [2019-05-23 10:04:51,367 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:51,368 INFO L146 ILogger]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:51,368 INFO L146 ILogger]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:51,368 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:51,368 INFO L146 ILogger]: Analyzing trace with hash 181437416, now seen corresponding path program 57 times [2019-05-23 10:04:51,369 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:51,390 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:51,393 INFO L146 ILogger]: Trace formula consists of 336 conjuncts, 62 conjunts are in the unsatisfiable core [2019-05-23 10:04:51,394 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:52,609 INFO L146 ILogger]: Checked inductivity of 3393 backedges. 2146 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:52,609 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:52,609 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-05-23 10:04:52,610 INFO L146 ILogger]: Interpolant automaton has 63 states [2019-05-23 10:04:52,610 INFO L146 ILogger]: Constructing interpolant automaton starting with 63 interpolants. [2019-05-23 10:04:52,610 INFO L146 ILogger]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 10:04:52,611 INFO L146 ILogger]: Start difference. First operand 243 states and 245 transitions. Second operand 63 states. [2019-05-23 10:04:53,935 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:53,936 INFO L146 ILogger]: Finished difference Result 395 states and 397 transitions. [2019-05-23 10:04:53,936 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-05-23 10:04:53,936 INFO L146 ILogger]: Start accepts. Automaton has 63 states. Word has length 242 [2019-05-23 10:04:53,936 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:53,938 INFO L146 ILogger]: With dead ends: 395 [2019-05-23 10:04:53,938 INFO L146 ILogger]: Without dead ends: 248 [2019-05-23 10:04:53,938 INFO L146 ILogger]: 0 DeclaredPredicates, 272 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2077, Invalid=6665, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 10:04:53,939 INFO L146 ILogger]: Start minimizeSevpa. Operand 248 states. [2019-05-23 10:04:53,941 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 248 to 246. [2019-05-23 10:04:53,941 INFO L146 ILogger]: Start removeUnreachable. Operand 246 states. [2019-05-23 10:04:53,942 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 246 states to 246 states and 248 transitions. [2019-05-23 10:04:53,942 INFO L146 ILogger]: Start accepts. Automaton has 246 states and 248 transitions. Word has length 242 [2019-05-23 10:04:53,942 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:53,942 INFO L146 ILogger]: Abstraction has 246 states and 248 transitions. [2019-05-23 10:04:53,942 INFO L146 ILogger]: Interpolant automaton has 63 states. [2019-05-23 10:04:53,942 INFO L146 ILogger]: Start isEmpty. Operand 246 states and 248 transitions. [2019-05-23 10:04:53,943 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 246 [2019-05-23 10:04:53,943 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:53,944 INFO L146 ILogger]: trace histogram [30, 30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:53,944 INFO L146 ILogger]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:53,944 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:53,944 INFO L146 ILogger]: Analyzing trace with hash 1826005963, now seen corresponding path program 58 times [2019-05-23 10:04:53,945 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:53,966 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:53,971 INFO L146 ILogger]: Trace formula consists of 340 conjuncts, 123 conjunts are in the unsatisfiable core [2019-05-23 10:04:53,973 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:55,684 INFO L146 ILogger]: Checked inductivity of 3481 backedges. 29 proven. 3452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:55,684 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:55,684 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-05-23 10:04:55,685 INFO L146 ILogger]: Interpolant automaton has 63 states [2019-05-23 10:04:55,685 INFO L146 ILogger]: Constructing interpolant automaton starting with 63 interpolants. [2019-05-23 10:04:55,685 INFO L146 ILogger]: CoverageRelationStatistics Valid=153, Invalid=3753, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 10:04:55,685 INFO L146 ILogger]: Start difference. First operand 246 states and 248 transitions. Second operand 63 states. [2019-05-23 10:05:00,732 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:00,732 INFO L146 ILogger]: Finished difference Result 255 states and 257 transitions. [2019-05-23 10:05:00,733 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-05-23 10:05:00,733 INFO L146 ILogger]: Start accepts. Automaton has 63 states. Word has length 245 [2019-05-23 10:05:00,733 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:00,734 INFO L146 ILogger]: With dead ends: 255 [2019-05-23 10:05:00,734 INFO L146 ILogger]: Without dead ends: 255 [2019-05-23 10:05:00,735 INFO L146 ILogger]: 0 DeclaredPredicates, 245 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=157, Invalid=3875, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 10:05:00,735 INFO L146 ILogger]: Start minimizeSevpa. Operand 255 states. [2019-05-23 10:05:00,737 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 255 to 251. [2019-05-23 10:05:00,737 INFO L146 ILogger]: Start removeUnreachable. Operand 251 states. [2019-05-23 10:05:00,738 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 251 states to 251 states and 253 transitions. [2019-05-23 10:05:00,738 INFO L146 ILogger]: Start accepts. Automaton has 251 states and 253 transitions. Word has length 245 [2019-05-23 10:05:00,738 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:00,738 INFO L146 ILogger]: Abstraction has 251 states and 253 transitions. [2019-05-23 10:05:00,738 INFO L146 ILogger]: Interpolant automaton has 63 states. [2019-05-23 10:05:00,738 INFO L146 ILogger]: Start isEmpty. Operand 251 states and 253 transitions. [2019-05-23 10:05:00,739 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 251 [2019-05-23 10:05:00,739 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:00,739 INFO L146 ILogger]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:00,739 INFO L146 ILogger]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:00,740 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:00,740 INFO L146 ILogger]: Analyzing trace with hash 356900235, now seen corresponding path program 59 times [2019-05-23 10:05:00,740 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:00,765 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:00,769 INFO L146 ILogger]: Trace formula consists of 347 conjuncts, 64 conjunts are in the unsatisfiable core [2019-05-23 10:05:00,771 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:02,300 INFO L146 ILogger]: Checked inductivity of 3630 backedges. 2295 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:02,300 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:02,300 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-05-23 10:05:02,301 INFO L146 ILogger]: Interpolant automaton has 65 states [2019-05-23 10:05:02,301 INFO L146 ILogger]: Constructing interpolant automaton starting with 65 interpolants. [2019-05-23 10:05:02,301 INFO L146 ILogger]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 10:05:02,302 INFO L146 ILogger]: Start difference. First operand 251 states and 253 transitions. Second operand 65 states. [2019-05-23 10:05:03,572 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:03,573 INFO L146 ILogger]: Finished difference Result 408 states and 410 transitions. [2019-05-23 10:05:03,573 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-05-23 10:05:03,574 INFO L146 ILogger]: Start accepts. Automaton has 65 states. Word has length 250 [2019-05-23 10:05:03,574 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:03,575 INFO L146 ILogger]: With dead ends: 408 [2019-05-23 10:05:03,575 INFO L146 ILogger]: Without dead ends: 256 [2019-05-23 10:05:03,576 INFO L146 ILogger]: 0 DeclaredPredicates, 281 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1425 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2208, Invalid=7104, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 10:05:03,576 INFO L146 ILogger]: Start minimizeSevpa. Operand 256 states. [2019-05-23 10:05:03,578 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 256 to 254. [2019-05-23 10:05:03,578 INFO L146 ILogger]: Start removeUnreachable. Operand 254 states. [2019-05-23 10:05:03,579 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 254 states to 254 states and 256 transitions. [2019-05-23 10:05:03,579 INFO L146 ILogger]: Start accepts. Automaton has 254 states and 256 transitions. Word has length 250 [2019-05-23 10:05:03,579 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:03,579 INFO L146 ILogger]: Abstraction has 254 states and 256 transitions. [2019-05-23 10:05:03,579 INFO L146 ILogger]: Interpolant automaton has 65 states. [2019-05-23 10:05:03,579 INFO L146 ILogger]: Start isEmpty. Operand 254 states and 256 transitions. [2019-05-23 10:05:03,580 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 254 [2019-05-23 10:05:03,580 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:03,580 INFO L146 ILogger]: trace histogram [31, 31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:03,580 INFO L146 ILogger]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:03,581 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:03,581 INFO L146 ILogger]: Analyzing trace with hash -747935122, now seen corresponding path program 60 times [2019-05-23 10:05:03,581 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:03,604 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:03,610 INFO L146 ILogger]: Trace formula consists of 351 conjuncts, 127 conjunts are in the unsatisfiable core [2019-05-23 10:05:03,613 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:06,030 INFO L146 ILogger]: Checked inductivity of 3721 backedges. 30 proven. 3691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:06,031 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:06,031 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-05-23 10:05:06,031 INFO L146 ILogger]: Interpolant automaton has 65 states [2019-05-23 10:05:06,032 INFO L146 ILogger]: Constructing interpolant automaton starting with 65 interpolants. [2019-05-23 10:05:06,032 INFO L146 ILogger]: CoverageRelationStatistics Valid=158, Invalid=4002, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 10:05:06,032 INFO L146 ILogger]: Start difference. First operand 254 states and 256 transitions. Second operand 65 states. [2019-05-23 10:05:12,008 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:12,009 INFO L146 ILogger]: Finished difference Result 263 states and 265 transitions. [2019-05-23 10:05:12,009 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-23 10:05:12,009 INFO L146 ILogger]: Start accepts. Automaton has 65 states. Word has length 253 [2019-05-23 10:05:12,009 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:12,011 INFO L146 ILogger]: With dead ends: 263 [2019-05-23 10:05:12,011 INFO L146 ILogger]: Without dead ends: 263 [2019-05-23 10:05:12,011 INFO L146 ILogger]: 0 DeclaredPredicates, 253 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=162, Invalid=4128, Unknown=0, NotChecked=0, Total=4290 [2019-05-23 10:05:12,012 INFO L146 ILogger]: Start minimizeSevpa. Operand 263 states. [2019-05-23 10:05:12,014 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 263 to 259. [2019-05-23 10:05:12,014 INFO L146 ILogger]: Start removeUnreachable. Operand 259 states. [2019-05-23 10:05:12,014 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-05-23 10:05:12,014 INFO L146 ILogger]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 253 [2019-05-23 10:05:12,015 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:12,015 INFO L146 ILogger]: Abstraction has 259 states and 261 transitions. [2019-05-23 10:05:12,015 INFO L146 ILogger]: Interpolant automaton has 65 states. [2019-05-23 10:05:12,015 INFO L146 ILogger]: Start isEmpty. Operand 259 states and 261 transitions. [2019-05-23 10:05:12,016 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 259 [2019-05-23 10:05:12,016 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:12,016 INFO L146 ILogger]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:12,017 INFO L146 ILogger]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:12,017 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:12,017 INFO L146 ILogger]: Analyzing trace with hash -1595751224, now seen corresponding path program 61 times [2019-05-23 10:05:12,017 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:12,038 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:12,042 INFO L146 ILogger]: Trace formula consists of 358 conjuncts, 66 conjunts are in the unsatisfiable core [2019-05-23 10:05:12,044 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:13,488 INFO L146 ILogger]: Checked inductivity of 3875 backedges. 2449 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:13,488 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:13,488 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-05-23 10:05:13,488 INFO L146 ILogger]: Interpolant automaton has 67 states [2019-05-23 10:05:13,489 INFO L146 ILogger]: Constructing interpolant automaton starting with 67 interpolants. [2019-05-23 10:05:13,489 INFO L146 ILogger]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 10:05:13,489 INFO L146 ILogger]: Start difference. First operand 259 states and 261 transitions. Second operand 67 states. [2019-05-23 10:05:15,372 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:15,372 INFO L146 ILogger]: Finished difference Result 421 states and 423 transitions. [2019-05-23 10:05:15,372 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-05-23 10:05:15,372 INFO L146 ILogger]: Start accepts. Automaton has 67 states. Word has length 258 [2019-05-23 10:05:15,373 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:15,374 INFO L146 ILogger]: With dead ends: 421 [2019-05-23 10:05:15,374 INFO L146 ILogger]: Without dead ends: 264 [2019-05-23 10:05:15,375 INFO L146 ILogger]: 0 DeclaredPredicates, 290 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2343, Invalid=7557, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 10:05:15,375 INFO L146 ILogger]: Start minimizeSevpa. Operand 264 states. [2019-05-23 10:05:15,378 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-05-23 10:05:15,378 INFO L146 ILogger]: Start removeUnreachable. Operand 262 states. [2019-05-23 10:05:15,378 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-05-23 10:05:15,379 INFO L146 ILogger]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-05-23 10:05:15,379 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:15,379 INFO L146 ILogger]: Abstraction has 262 states and 264 transitions. [2019-05-23 10:05:15,379 INFO L146 ILogger]: Interpolant automaton has 67 states. [2019-05-23 10:05:15,379 INFO L146 ILogger]: Start isEmpty. Operand 262 states and 264 transitions. [2019-05-23 10:05:15,380 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 262 [2019-05-23 10:05:15,380 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:15,381 INFO L146 ILogger]: trace histogram [32, 32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:15,381 INFO L146 ILogger]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:15,381 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:15,381 INFO L146 ILogger]: Analyzing trace with hash 1332395691, now seen corresponding path program 62 times [2019-05-23 10:05:15,382 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:15,404 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:15,409 INFO L146 ILogger]: Trace formula consists of 362 conjuncts, 131 conjunts are in the unsatisfiable core [2019-05-23 10:05:15,411 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:18,187 INFO L146 ILogger]: Checked inductivity of 3969 backedges. 31 proven. 3938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:18,187 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:18,187 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-05-23 10:05:18,187 INFO L146 ILogger]: Interpolant automaton has 67 states [2019-05-23 10:05:18,187 INFO L146 ILogger]: Constructing interpolant automaton starting with 67 interpolants. [2019-05-23 10:05:18,188 INFO L146 ILogger]: CoverageRelationStatistics Valid=163, Invalid=4259, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 10:05:18,188 INFO L146 ILogger]: Start difference. First operand 262 states and 264 transitions. Second operand 67 states. [2019-05-23 10:05:24,573 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:24,573 INFO L146 ILogger]: Finished difference Result 271 states and 273 transitions. [2019-05-23 10:05:24,574 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-05-23 10:05:24,574 INFO L146 ILogger]: Start accepts. Automaton has 67 states. Word has length 261 [2019-05-23 10:05:24,574 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:24,575 INFO L146 ILogger]: With dead ends: 271 [2019-05-23 10:05:24,576 INFO L146 ILogger]: Without dead ends: 271 [2019-05-23 10:05:24,576 INFO L146 ILogger]: 0 DeclaredPredicates, 261 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=167, Invalid=4389, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 10:05:24,576 INFO L146 ILogger]: Start minimizeSevpa. Operand 271 states. [2019-05-23 10:05:24,579 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 271 to 267. [2019-05-23 10:05:24,579 INFO L146 ILogger]: Start removeUnreachable. Operand 267 states. [2019-05-23 10:05:24,579 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 267 states to 267 states and 269 transitions. [2019-05-23 10:05:24,579 INFO L146 ILogger]: Start accepts. Automaton has 267 states and 269 transitions. Word has length 261 [2019-05-23 10:05:24,579 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:24,579 INFO L146 ILogger]: Abstraction has 267 states and 269 transitions. [2019-05-23 10:05:24,579 INFO L146 ILogger]: Interpolant automaton has 67 states. [2019-05-23 10:05:24,580 INFO L146 ILogger]: Start isEmpty. Operand 267 states and 269 transitions. [2019-05-23 10:05:24,583 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 267 [2019-05-23 10:05:24,583 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:24,583 INFO L146 ILogger]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:24,583 INFO L146 ILogger]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:24,583 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:24,583 INFO L146 ILogger]: Analyzing trace with hash -1955623253, now seen corresponding path program 63 times [2019-05-23 10:05:24,584 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:24,608 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:24,612 INFO L146 ILogger]: Trace formula consists of 369 conjuncts, 68 conjunts are in the unsatisfiable core [2019-05-23 10:05:24,615 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:26,176 INFO L146 ILogger]: Checked inductivity of 4128 backedges. 2608 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:26,176 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:26,176 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-05-23 10:05:26,176 INFO L146 ILogger]: Interpolant automaton has 69 states [2019-05-23 10:05:26,177 INFO L146 ILogger]: Constructing interpolant automaton starting with 69 interpolants. [2019-05-23 10:05:26,177 INFO L146 ILogger]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 10:05:26,177 INFO L146 ILogger]: Start difference. First operand 267 states and 269 transitions. Second operand 69 states. [2019-05-23 10:05:27,702 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:27,702 INFO L146 ILogger]: Finished difference Result 434 states and 436 transitions. [2019-05-23 10:05:27,703 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-05-23 10:05:27,703 INFO L146 ILogger]: Start accepts. Automaton has 69 states. Word has length 266 [2019-05-23 10:05:27,703 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:27,704 INFO L146 ILogger]: With dead ends: 434 [2019-05-23 10:05:27,704 INFO L146 ILogger]: Without dead ends: 272 [2019-05-23 10:05:27,705 INFO L146 ILogger]: 0 DeclaredPredicates, 299 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1616 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2482, Invalid=8024, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 10:05:27,706 INFO L146 ILogger]: Start minimizeSevpa. Operand 272 states. [2019-05-23 10:05:27,708 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 272 to 270. [2019-05-23 10:05:27,708 INFO L146 ILogger]: Start removeUnreachable. Operand 270 states. [2019-05-23 10:05:27,709 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 270 states to 270 states and 272 transitions. [2019-05-23 10:05:27,709 INFO L146 ILogger]: Start accepts. Automaton has 270 states and 272 transitions. Word has length 266 [2019-05-23 10:05:27,709 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:27,709 INFO L146 ILogger]: Abstraction has 270 states and 272 transitions. [2019-05-23 10:05:27,709 INFO L146 ILogger]: Interpolant automaton has 69 states. [2019-05-23 10:05:27,709 INFO L146 ILogger]: Start isEmpty. Operand 270 states and 272 transitions. [2019-05-23 10:05:27,710 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 270 [2019-05-23 10:05:27,710 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:27,710 INFO L146 ILogger]: trace histogram [33, 33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:27,710 INFO L146 ILogger]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:27,710 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:27,711 INFO L146 ILogger]: Analyzing trace with hash -878905970, now seen corresponding path program 64 times [2019-05-23 10:05:27,711 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:27,732 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:27,737 INFO L146 ILogger]: Trace formula consists of 373 conjuncts, 135 conjunts are in the unsatisfiable core [2019-05-23 10:05:27,739 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:29,748 INFO L146 ILogger]: Checked inductivity of 4225 backedges. 32 proven. 4193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:29,748 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:29,748 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-05-23 10:05:29,749 INFO L146 ILogger]: Interpolant automaton has 69 states [2019-05-23 10:05:29,749 INFO L146 ILogger]: Constructing interpolant automaton starting with 69 interpolants. [2019-05-23 10:05:29,750 INFO L146 ILogger]: CoverageRelationStatistics Valid=168, Invalid=4524, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 10:05:29,750 INFO L146 ILogger]: Start difference. First operand 270 states and 272 transitions. Second operand 69 states. [2019-05-23 10:05:37,817 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:37,818 INFO L146 ILogger]: Finished difference Result 279 states and 281 transitions. [2019-05-23 10:05:37,818 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-05-23 10:05:37,818 INFO L146 ILogger]: Start accepts. Automaton has 69 states. Word has length 269 [2019-05-23 10:05:37,819 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:37,820 INFO L146 ILogger]: With dead ends: 279 [2019-05-23 10:05:37,820 INFO L146 ILogger]: Without dead ends: 279 [2019-05-23 10:05:37,821 INFO L146 ILogger]: 0 DeclaredPredicates, 269 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=172, Invalid=4658, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 10:05:37,821 INFO L146 ILogger]: Start minimizeSevpa. Operand 279 states. [2019-05-23 10:05:37,822 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 279 to 275. [2019-05-23 10:05:37,822 INFO L146 ILogger]: Start removeUnreachable. Operand 275 states. [2019-05-23 10:05:37,823 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 275 states to 275 states and 277 transitions. [2019-05-23 10:05:37,823 INFO L146 ILogger]: Start accepts. Automaton has 275 states and 277 transitions. Word has length 269 [2019-05-23 10:05:37,823 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:37,823 INFO L146 ILogger]: Abstraction has 275 states and 277 transitions. [2019-05-23 10:05:37,823 INFO L146 ILogger]: Interpolant automaton has 69 states. [2019-05-23 10:05:37,823 INFO L146 ILogger]: Start isEmpty. Operand 275 states and 277 transitions. [2019-05-23 10:05:37,824 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 275 [2019-05-23 10:05:37,824 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:37,825 INFO L146 ILogger]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:37,825 INFO L146 ILogger]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:37,825 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:37,825 INFO L146 ILogger]: Analyzing trace with hash -2020921944, now seen corresponding path program 65 times [2019-05-23 10:05:37,826 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:37,850 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:37,854 INFO L146 ILogger]: Trace formula consists of 380 conjuncts, 70 conjunts are in the unsatisfiable core [2019-05-23 10:05:37,857 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:39,515 INFO L146 ILogger]: Checked inductivity of 4389 backedges. 2772 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:39,515 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:39,515 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-05-23 10:05:39,516 INFO L146 ILogger]: Interpolant automaton has 71 states [2019-05-23 10:05:39,516 INFO L146 ILogger]: Constructing interpolant automaton starting with 71 interpolants. [2019-05-23 10:05:39,517 INFO L146 ILogger]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 10:05:39,517 INFO L146 ILogger]: Start difference. First operand 275 states and 277 transitions. Second operand 71 states. [2019-05-23 10:05:41,184 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:41,184 INFO L146 ILogger]: Finished difference Result 447 states and 449 transitions. [2019-05-23 10:05:41,184 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-05-23 10:05:41,185 INFO L146 ILogger]: Start accepts. Automaton has 71 states. Word has length 274 [2019-05-23 10:05:41,185 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:41,186 INFO L146 ILogger]: With dead ends: 447 [2019-05-23 10:05:41,186 INFO L146 ILogger]: Without dead ends: 280 [2019-05-23 10:05:41,187 INFO L146 ILogger]: 0 DeclaredPredicates, 308 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2625, Invalid=8505, Unknown=0, NotChecked=0, Total=11130 [2019-05-23 10:05:41,188 INFO L146 ILogger]: Start minimizeSevpa. Operand 280 states. [2019-05-23 10:05:41,190 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 280 to 278. [2019-05-23 10:05:41,190 INFO L146 ILogger]: Start removeUnreachable. Operand 278 states. [2019-05-23 10:05:41,190 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 278 states to 278 states and 280 transitions. [2019-05-23 10:05:41,191 INFO L146 ILogger]: Start accepts. Automaton has 278 states and 280 transitions. Word has length 274 [2019-05-23 10:05:41,191 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:41,191 INFO L146 ILogger]: Abstraction has 278 states and 280 transitions. [2019-05-23 10:05:41,191 INFO L146 ILogger]: Interpolant automaton has 71 states. [2019-05-23 10:05:41,191 INFO L146 ILogger]: Start isEmpty. Operand 278 states and 280 transitions. [2019-05-23 10:05:41,192 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 278 [2019-05-23 10:05:41,192 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:41,193 INFO L146 ILogger]: trace histogram [34, 34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:41,193 INFO L146 ILogger]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:41,193 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:41,193 INFO L146 ILogger]: Analyzing trace with hash 127992203, now seen corresponding path program 66 times [2019-05-23 10:05:41,194 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:41,218 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:41,223 INFO L146 ILogger]: Trace formula consists of 384 conjuncts, 139 conjunts are in the unsatisfiable core [2019-05-23 10:05:41,226 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:43,357 INFO L146 ILogger]: Checked inductivity of 4489 backedges. 33 proven. 4456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:43,358 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:43,358 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-05-23 10:05:43,358 INFO L146 ILogger]: Interpolant automaton has 71 states [2019-05-23 10:05:43,358 INFO L146 ILogger]: Constructing interpolant automaton starting with 71 interpolants. [2019-05-23 10:05:43,358 INFO L146 ILogger]: CoverageRelationStatistics Valid=173, Invalid=4797, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 10:05:43,359 INFO L146 ILogger]: Start difference. First operand 278 states and 280 transitions. Second operand 71 states. [2019-05-23 10:05:50,536 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:50,536 INFO L146 ILogger]: Finished difference Result 287 states and 289 transitions. [2019-05-23 10:05:50,537 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-23 10:05:50,537 INFO L146 ILogger]: Start accepts. Automaton has 71 states. Word has length 277 [2019-05-23 10:05:50,537 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:50,539 INFO L146 ILogger]: With dead ends: 287 [2019-05-23 10:05:50,539 INFO L146 ILogger]: Without dead ends: 287 [2019-05-23 10:05:50,539 INFO L146 ILogger]: 0 DeclaredPredicates, 277 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=177, Invalid=4935, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 10:05:50,539 INFO L146 ILogger]: Start minimizeSevpa. Operand 287 states. [2019-05-23 10:05:50,542 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 287 to 283. [2019-05-23 10:05:50,542 INFO L146 ILogger]: Start removeUnreachable. Operand 283 states. [2019-05-23 10:05:50,542 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 283 states to 283 states and 285 transitions. [2019-05-23 10:05:50,542 INFO L146 ILogger]: Start accepts. Automaton has 283 states and 285 transitions. Word has length 277 [2019-05-23 10:05:50,542 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:50,542 INFO L146 ILogger]: Abstraction has 283 states and 285 transitions. [2019-05-23 10:05:50,543 INFO L146 ILogger]: Interpolant automaton has 71 states. [2019-05-23 10:05:50,543 INFO L146 ILogger]: Start isEmpty. Operand 283 states and 285 transitions. [2019-05-23 10:05:50,543 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 283 [2019-05-23 10:05:50,544 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:50,544 INFO L146 ILogger]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:50,544 INFO L146 ILogger]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:50,544 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:50,544 INFO L146 ILogger]: Analyzing trace with hash -1559226421, now seen corresponding path program 67 times [2019-05-23 10:05:50,545 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:50,578 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:50,581 INFO L146 ILogger]: Trace formula consists of 391 conjuncts, 72 conjunts are in the unsatisfiable core [2019-05-23 10:05:50,584 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:52,322 INFO L146 ILogger]: Checked inductivity of 4658 backedges. 2941 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:52,323 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:52,323 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-05-23 10:05:52,323 INFO L146 ILogger]: Interpolant automaton has 73 states [2019-05-23 10:05:52,323 INFO L146 ILogger]: Constructing interpolant automaton starting with 73 interpolants. [2019-05-23 10:05:52,324 INFO L146 ILogger]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 10:05:52,324 INFO L146 ILogger]: Start difference. First operand 283 states and 285 transitions. Second operand 73 states. [2019-05-23 10:05:54,419 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:54,420 INFO L146 ILogger]: Finished difference Result 460 states and 462 transitions. [2019-05-23 10:05:54,420 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-05-23 10:05:54,420 INFO L146 ILogger]: Start accepts. Automaton has 73 states. Word has length 282 [2019-05-23 10:05:54,420 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:54,421 INFO L146 ILogger]: With dead ends: 460 [2019-05-23 10:05:54,421 INFO L146 ILogger]: Without dead ends: 288 [2019-05-23 10:05:54,422 INFO L146 ILogger]: 0 DeclaredPredicates, 317 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2772, Invalid=9000, Unknown=0, NotChecked=0, Total=11772 [2019-05-23 10:05:54,423 INFO L146 ILogger]: Start minimizeSevpa. Operand 288 states. [2019-05-23 10:05:54,425 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 288 to 286. [2019-05-23 10:05:54,425 INFO L146 ILogger]: Start removeUnreachable. Operand 286 states. [2019-05-23 10:05:54,425 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 286 states to 286 states and 288 transitions. [2019-05-23 10:05:54,425 INFO L146 ILogger]: Start accepts. Automaton has 286 states and 288 transitions. Word has length 282 [2019-05-23 10:05:54,425 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:54,426 INFO L146 ILogger]: Abstraction has 286 states and 288 transitions. [2019-05-23 10:05:54,426 INFO L146 ILogger]: Interpolant automaton has 73 states. [2019-05-23 10:05:54,426 INFO L146 ILogger]: Start isEmpty. Operand 286 states and 288 transitions. [2019-05-23 10:05:54,427 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 286 [2019-05-23 10:05:54,427 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:54,427 INFO L146 ILogger]: trace histogram [35, 35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:54,427 INFO L146 ILogger]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:54,427 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:54,427 INFO L146 ILogger]: Analyzing trace with hash 508647598, now seen corresponding path program 68 times [2019-05-23 10:05:54,428 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:54,468 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:54,473 INFO L146 ILogger]: Trace formula consists of 395 conjuncts, 143 conjunts are in the unsatisfiable core [2019-05-23 10:05:54,476 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:56,701 INFO L146 ILogger]: Checked inductivity of 4761 backedges. 34 proven. 4727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:56,701 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:56,701 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-05-23 10:05:56,702 INFO L146 ILogger]: Interpolant automaton has 73 states [2019-05-23 10:05:56,702 INFO L146 ILogger]: Constructing interpolant automaton starting with 73 interpolants. [2019-05-23 10:05:56,702 INFO L146 ILogger]: CoverageRelationStatistics Valid=178, Invalid=5078, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 10:05:56,702 INFO L146 ILogger]: Start difference. First operand 286 states and 288 transitions. Second operand 73 states. [2019-05-23 10:06:04,479 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:04,479 INFO L146 ILogger]: Finished difference Result 295 states and 297 transitions. [2019-05-23 10:06:04,480 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-05-23 10:06:04,480 INFO L146 ILogger]: Start accepts. Automaton has 73 states. Word has length 285 [2019-05-23 10:06:04,480 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:04,481 INFO L146 ILogger]: With dead ends: 295 [2019-05-23 10:06:04,482 INFO L146 ILogger]: Without dead ends: 295 [2019-05-23 10:06:04,482 INFO L146 ILogger]: 0 DeclaredPredicates, 285 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=182, Invalid=5220, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 10:06:04,483 INFO L146 ILogger]: Start minimizeSevpa. Operand 295 states. [2019-05-23 10:06:04,485 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 295 to 291. [2019-05-23 10:06:04,485 INFO L146 ILogger]: Start removeUnreachable. Operand 291 states. [2019-05-23 10:06:04,485 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 291 states to 291 states and 293 transitions. [2019-05-23 10:06:04,485 INFO L146 ILogger]: Start accepts. Automaton has 291 states and 293 transitions. Word has length 285 [2019-05-23 10:06:04,485 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:04,485 INFO L146 ILogger]: Abstraction has 291 states and 293 transitions. [2019-05-23 10:06:04,485 INFO L146 ILogger]: Interpolant automaton has 73 states. [2019-05-23 10:06:04,485 INFO L146 ILogger]: Start isEmpty. Operand 291 states and 293 transitions. [2019-05-23 10:06:04,486 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 291 [2019-05-23 10:06:04,487 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:04,487 INFO L146 ILogger]: trace histogram [36, 36, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:04,487 INFO L146 ILogger]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:04,487 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:04,487 INFO L146 ILogger]: Analyzing trace with hash -340279672, now seen corresponding path program 69 times [2019-05-23 10:06:04,488 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:04,514 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:04,517 INFO L146 ILogger]: Trace formula consists of 402 conjuncts, 74 conjunts are in the unsatisfiable core [2019-05-23 10:06:04,519 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:06,379 INFO L146 ILogger]: Checked inductivity of 4935 backedges. 3115 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:06,379 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:06,380 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-05-23 10:06:06,380 INFO L146 ILogger]: Interpolant automaton has 75 states [2019-05-23 10:06:06,380 INFO L146 ILogger]: Constructing interpolant automaton starting with 75 interpolants. [2019-05-23 10:06:06,381 INFO L146 ILogger]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 10:06:06,381 INFO L146 ILogger]: Start difference. First operand 291 states and 293 transitions. Second operand 75 states. [2019-05-23 10:06:08,292 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:08,293 INFO L146 ILogger]: Finished difference Result 473 states and 475 transitions. [2019-05-23 10:06:08,293 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-05-23 10:06:08,293 INFO L146 ILogger]: Start accepts. Automaton has 75 states. Word has length 290 [2019-05-23 10:06:08,294 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:08,295 INFO L146 ILogger]: With dead ends: 473 [2019-05-23 10:06:08,295 INFO L146 ILogger]: Without dead ends: 296 [2019-05-23 10:06:08,296 INFO L146 ILogger]: 0 DeclaredPredicates, 326 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2923, Invalid=9509, Unknown=0, NotChecked=0, Total=12432 [2019-05-23 10:06:08,296 INFO L146 ILogger]: Start minimizeSevpa. Operand 296 states. [2019-05-23 10:06:08,299 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-05-23 10:06:08,299 INFO L146 ILogger]: Start removeUnreachable. Operand 294 states. [2019-05-23 10:06:08,299 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 294 states to 294 states and 296 transitions. [2019-05-23 10:06:08,300 INFO L146 ILogger]: Start accepts. Automaton has 294 states and 296 transitions. Word has length 290 [2019-05-23 10:06:08,300 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:08,300 INFO L146 ILogger]: Abstraction has 294 states and 296 transitions. [2019-05-23 10:06:08,300 INFO L146 ILogger]: Interpolant automaton has 75 states. [2019-05-23 10:06:08,300 INFO L146 ILogger]: Start isEmpty. Operand 294 states and 296 transitions. [2019-05-23 10:06:08,301 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 294 [2019-05-23 10:06:08,301 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:08,302 INFO L146 ILogger]: trace histogram [36, 36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:08,302 INFO L146 ILogger]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:08,302 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:08,302 INFO L146 ILogger]: Analyzing trace with hash 711421035, now seen corresponding path program 70 times [2019-05-23 10:06:08,303 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:08,330 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:08,335 INFO L146 ILogger]: Trace formula consists of 406 conjuncts, 147 conjunts are in the unsatisfiable core [2019-05-23 10:06:08,338 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:10,734 INFO L146 ILogger]: Checked inductivity of 5041 backedges. 35 proven. 5006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:10,734 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:10,734 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-05-23 10:06:10,735 INFO L146 ILogger]: Interpolant automaton has 75 states [2019-05-23 10:06:10,735 INFO L146 ILogger]: Constructing interpolant automaton starting with 75 interpolants. [2019-05-23 10:06:10,735 INFO L146 ILogger]: CoverageRelationStatistics Valid=183, Invalid=5367, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 10:06:10,735 INFO L146 ILogger]: Start difference. First operand 294 states and 296 transitions. Second operand 75 states. [2019-05-23 10:06:18,775 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:18,776 INFO L146 ILogger]: Finished difference Result 303 states and 305 transitions. [2019-05-23 10:06:18,776 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-05-23 10:06:18,776 INFO L146 ILogger]: Start accepts. Automaton has 75 states. Word has length 293 [2019-05-23 10:06:18,777 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:18,778 INFO L146 ILogger]: With dead ends: 303 [2019-05-23 10:06:18,778 INFO L146 ILogger]: Without dead ends: 303 [2019-05-23 10:06:18,778 INFO L146 ILogger]: 0 DeclaredPredicates, 293 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=187, Invalid=5513, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 10:06:18,778 INFO L146 ILogger]: Start minimizeSevpa. Operand 303 states. [2019-05-23 10:06:18,780 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 303 to 299. [2019-05-23 10:06:18,780 INFO L146 ILogger]: Start removeUnreachable. Operand 299 states. [2019-05-23 10:06:18,781 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 299 states to 299 states and 301 transitions. [2019-05-23 10:06:18,781 INFO L146 ILogger]: Start accepts. Automaton has 299 states and 301 transitions. Word has length 293 [2019-05-23 10:06:18,781 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:18,781 INFO L146 ILogger]: Abstraction has 299 states and 301 transitions. [2019-05-23 10:06:18,781 INFO L146 ILogger]: Interpolant automaton has 75 states. [2019-05-23 10:06:18,782 INFO L146 ILogger]: Start isEmpty. Operand 299 states and 301 transitions. [2019-05-23 10:06:18,783 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 299 [2019-05-23 10:06:18,783 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:18,783 INFO L146 ILogger]: trace histogram [37, 37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:18,783 INFO L146 ILogger]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:18,784 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:18,784 INFO L146 ILogger]: Analyzing trace with hash -1409713941, now seen corresponding path program 71 times [2019-05-23 10:06:18,784 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:18,811 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:18,816 INFO L146 ILogger]: Trace formula consists of 413 conjuncts, 76 conjunts are in the unsatisfiable core [2019-05-23 10:06:18,818 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:20,846 INFO L146 ILogger]: Checked inductivity of 5220 backedges. 3294 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:20,847 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:20,847 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-05-23 10:06:20,847 INFO L146 ILogger]: Interpolant automaton has 77 states [2019-05-23 10:06:20,847 INFO L146 ILogger]: Constructing interpolant automaton starting with 77 interpolants. [2019-05-23 10:06:20,848 INFO L146 ILogger]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 10:06:20,848 INFO L146 ILogger]: Start difference. First operand 299 states and 301 transitions. Second operand 77 states. [2019-05-23 10:06:22,866 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:22,866 INFO L146 ILogger]: Finished difference Result 486 states and 488 transitions. [2019-05-23 10:06:22,867 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-05-23 10:06:22,867 INFO L146 ILogger]: Start accepts. Automaton has 77 states. Word has length 298 [2019-05-23 10:06:22,867 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:22,869 INFO L146 ILogger]: With dead ends: 486 [2019-05-23 10:06:22,869 INFO L146 ILogger]: Without dead ends: 304 [2019-05-23 10:06:22,870 INFO L146 ILogger]: 0 DeclaredPredicates, 335 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2034 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3078, Invalid=10032, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 10:06:22,870 INFO L146 ILogger]: Start minimizeSevpa. Operand 304 states. [2019-05-23 10:06:22,872 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 304 to 302. [2019-05-23 10:06:22,872 INFO L146 ILogger]: Start removeUnreachable. Operand 302 states. [2019-05-23 10:06:22,872 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 302 states to 302 states and 304 transitions. [2019-05-23 10:06:22,872 INFO L146 ILogger]: Start accepts. Automaton has 302 states and 304 transitions. Word has length 298 [2019-05-23 10:06:22,873 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:22,873 INFO L146 ILogger]: Abstraction has 302 states and 304 transitions. [2019-05-23 10:06:22,873 INFO L146 ILogger]: Interpolant automaton has 77 states. [2019-05-23 10:06:22,873 INFO L146 ILogger]: Start isEmpty. Operand 302 states and 304 transitions. [2019-05-23 10:06:22,874 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 302 [2019-05-23 10:06:22,874 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:22,874 INFO L146 ILogger]: trace histogram [37, 37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:22,874 INFO L146 ILogger]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:22,874 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:22,874 INFO L146 ILogger]: Analyzing trace with hash -2091215922, now seen corresponding path program 72 times [2019-05-23 10:06:22,875 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:22,894 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:22,898 INFO L146 ILogger]: Trace formula consists of 417 conjuncts, 151 conjunts are in the unsatisfiable core [2019-05-23 10:06:22,900 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:25,406 INFO L146 ILogger]: Checked inductivity of 5329 backedges. 36 proven. 5293 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:25,406 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:25,406 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-05-23 10:06:25,406 INFO L146 ILogger]: Interpolant automaton has 77 states [2019-05-23 10:06:25,407 INFO L146 ILogger]: Constructing interpolant automaton starting with 77 interpolants. [2019-05-23 10:06:25,407 INFO L146 ILogger]: CoverageRelationStatistics Valid=188, Invalid=5664, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 10:06:25,407 INFO L146 ILogger]: Start difference. First operand 302 states and 304 transitions. Second operand 77 states. [2019-05-23 10:06:35,320 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:35,321 INFO L146 ILogger]: Finished difference Result 311 states and 313 transitions. [2019-05-23 10:06:35,321 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-23 10:06:35,321 INFO L146 ILogger]: Start accepts. Automaton has 77 states. Word has length 301 [2019-05-23 10:06:35,322 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:35,323 INFO L146 ILogger]: With dead ends: 311 [2019-05-23 10:06:35,323 INFO L146 ILogger]: Without dead ends: 311 [2019-05-23 10:06:35,323 INFO L146 ILogger]: 0 DeclaredPredicates, 301 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=192, Invalid=5814, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 10:06:35,324 INFO L146 ILogger]: Start minimizeSevpa. Operand 311 states. [2019-05-23 10:06:35,326 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 311 to 307. [2019-05-23 10:06:35,326 INFO L146 ILogger]: Start removeUnreachable. Operand 307 states. [2019-05-23 10:06:35,326 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 307 states to 307 states and 309 transitions. [2019-05-23 10:06:35,326 INFO L146 ILogger]: Start accepts. Automaton has 307 states and 309 transitions. Word has length 301 [2019-05-23 10:06:35,327 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:35,327 INFO L146 ILogger]: Abstraction has 307 states and 309 transitions. [2019-05-23 10:06:35,327 INFO L146 ILogger]: Interpolant automaton has 77 states. [2019-05-23 10:06:35,327 INFO L146 ILogger]: Start isEmpty. Operand 307 states and 309 transitions. [2019-05-23 10:06:35,328 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 307 [2019-05-23 10:06:35,328 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:35,329 INFO L146 ILogger]: trace histogram [38, 38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:35,329 INFO L146 ILogger]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:35,329 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:35,329 INFO L146 ILogger]: Analyzing trace with hash 685143912, now seen corresponding path program 73 times [2019-05-23 10:06:35,330 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:35,363 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:35,370 INFO L146 ILogger]: Trace formula consists of 424 conjuncts, 78 conjunts are in the unsatisfiable core [2019-05-23 10:06:35,373 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:37,382 INFO L146 ILogger]: Checked inductivity of 5513 backedges. 3478 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:37,383 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:37,383 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-05-23 10:06:37,383 INFO L146 ILogger]: Interpolant automaton has 79 states [2019-05-23 10:06:37,383 INFO L146 ILogger]: Constructing interpolant automaton starting with 79 interpolants. [2019-05-23 10:06:37,384 INFO L146 ILogger]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 10:06:37,384 INFO L146 ILogger]: Start difference. First operand 307 states and 309 transitions. Second operand 79 states. [2019-05-23 10:06:39,383 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:39,383 INFO L146 ILogger]: Finished difference Result 499 states and 501 transitions. [2019-05-23 10:06:39,384 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-05-23 10:06:39,384 INFO L146 ILogger]: Start accepts. Automaton has 79 states. Word has length 306 [2019-05-23 10:06:39,384 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:39,386 INFO L146 ILogger]: With dead ends: 499 [2019-05-23 10:06:39,386 INFO L146 ILogger]: Without dead ends: 312 [2019-05-23 10:06:39,387 INFO L146 ILogger]: 0 DeclaredPredicates, 344 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3237, Invalid=10569, Unknown=0, NotChecked=0, Total=13806 [2019-05-23 10:06:39,387 INFO L146 ILogger]: Start minimizeSevpa. Operand 312 states. [2019-05-23 10:06:39,389 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 312 to 310. [2019-05-23 10:06:39,389 INFO L146 ILogger]: Start removeUnreachable. Operand 310 states. [2019-05-23 10:06:39,390 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 310 states to 310 states and 312 transitions. [2019-05-23 10:06:39,390 INFO L146 ILogger]: Start accepts. Automaton has 310 states and 312 transitions. Word has length 306 [2019-05-23 10:06:39,390 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:39,390 INFO L146 ILogger]: Abstraction has 310 states and 312 transitions. [2019-05-23 10:06:39,390 INFO L146 ILogger]: Interpolant automaton has 79 states. [2019-05-23 10:06:39,390 INFO L146 ILogger]: Start isEmpty. Operand 310 states and 312 transitions. [2019-05-23 10:06:39,391 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 310 [2019-05-23 10:06:39,391 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:39,391 INFO L146 ILogger]: trace histogram [38, 38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:39,391 INFO L146 ILogger]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:39,392 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:39,392 INFO L146 ILogger]: Analyzing trace with hash 2066480971, now seen corresponding path program 74 times [2019-05-23 10:06:39,392 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:39,411 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:39,415 INFO L146 ILogger]: Trace formula consists of 428 conjuncts, 155 conjunts are in the unsatisfiable core [2019-05-23 10:06:39,417 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:42,045 INFO L146 ILogger]: Checked inductivity of 5625 backedges. 37 proven. 5588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:42,046 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:42,046 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-05-23 10:06:42,046 INFO L146 ILogger]: Interpolant automaton has 79 states [2019-05-23 10:06:42,046 INFO L146 ILogger]: Constructing interpolant automaton starting with 79 interpolants. [2019-05-23 10:06:42,047 INFO L146 ILogger]: CoverageRelationStatistics Valid=193, Invalid=5969, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 10:06:42,047 INFO L146 ILogger]: Start difference. First operand 310 states and 312 transitions. Second operand 79 states. [2019-05-23 10:06:50,302 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:50,302 INFO L146 ILogger]: Finished difference Result 319 states and 321 transitions. [2019-05-23 10:06:50,302 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-05-23 10:06:50,303 INFO L146 ILogger]: Start accepts. Automaton has 79 states. Word has length 309 [2019-05-23 10:06:50,303 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:50,304 INFO L146 ILogger]: With dead ends: 319 [2019-05-23 10:06:50,305 INFO L146 ILogger]: Without dead ends: 319 [2019-05-23 10:06:50,305 INFO L146 ILogger]: 0 DeclaredPredicates, 309 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=197, Invalid=6123, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 10:06:50,305 INFO L146 ILogger]: Start minimizeSevpa. Operand 319 states. [2019-05-23 10:06:50,308 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 319 to 315. [2019-05-23 10:06:50,308 INFO L146 ILogger]: Start removeUnreachable. Operand 315 states. [2019-05-23 10:06:50,308 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 315 states to 315 states and 317 transitions. [2019-05-23 10:06:50,308 INFO L146 ILogger]: Start accepts. Automaton has 315 states and 317 transitions. Word has length 309 [2019-05-23 10:06:50,309 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:50,309 INFO L146 ILogger]: Abstraction has 315 states and 317 transitions. [2019-05-23 10:06:50,309 INFO L146 ILogger]: Interpolant automaton has 79 states. [2019-05-23 10:06:50,309 INFO L146 ILogger]: Start isEmpty. Operand 315 states and 317 transitions. [2019-05-23 10:06:50,316 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 315 [2019-05-23 10:06:50,316 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:50,316 INFO L146 ILogger]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:50,316 INFO L146 ILogger]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:50,316 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:50,317 INFO L146 ILogger]: Analyzing trace with hash -679628277, now seen corresponding path program 75 times [2019-05-23 10:06:50,317 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:50,337 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:50,341 INFO L146 ILogger]: Trace formula consists of 435 conjuncts, 80 conjunts are in the unsatisfiable core [2019-05-23 10:06:50,343 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:52,312 INFO L146 ILogger]: Checked inductivity of 5814 backedges. 3667 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:52,312 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:52,312 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-05-23 10:06:52,313 INFO L146 ILogger]: Interpolant automaton has 81 states [2019-05-23 10:06:52,313 INFO L146 ILogger]: Constructing interpolant automaton starting with 81 interpolants. [2019-05-23 10:06:52,314 INFO L146 ILogger]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 10:06:52,314 INFO L146 ILogger]: Start difference. First operand 315 states and 317 transitions. Second operand 81 states. [2019-05-23 10:06:54,855 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:54,855 INFO L146 ILogger]: Finished difference Result 512 states and 514 transitions. [2019-05-23 10:06:54,855 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-05-23 10:06:54,855 INFO L146 ILogger]: Start accepts. Automaton has 81 states. Word has length 314 [2019-05-23 10:06:54,856 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:54,857 INFO L146 ILogger]: With dead ends: 512 [2019-05-23 10:06:54,857 INFO L146 ILogger]: Without dead ends: 320 [2019-05-23 10:06:54,858 INFO L146 ILogger]: 0 DeclaredPredicates, 353 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2261 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3400, Invalid=11120, Unknown=0, NotChecked=0, Total=14520 [2019-05-23 10:06:54,859 INFO L146 ILogger]: Start minimizeSevpa. Operand 320 states. [2019-05-23 10:06:54,861 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 320 to 318. [2019-05-23 10:06:54,861 INFO L146 ILogger]: Start removeUnreachable. Operand 318 states. [2019-05-23 10:06:54,861 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 318 states to 318 states and 320 transitions. [2019-05-23 10:06:54,861 INFO L146 ILogger]: Start accepts. Automaton has 318 states and 320 transitions. Word has length 314 [2019-05-23 10:06:54,861 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:54,862 INFO L146 ILogger]: Abstraction has 318 states and 320 transitions. [2019-05-23 10:06:54,862 INFO L146 ILogger]: Interpolant automaton has 81 states. [2019-05-23 10:06:54,862 INFO L146 ILogger]: Start isEmpty. Operand 318 states and 320 transitions. [2019-05-23 10:06:54,863 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 318 [2019-05-23 10:06:54,863 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:54,863 INFO L146 ILogger]: trace histogram [39, 39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:54,863 INFO L146 ILogger]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:54,864 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:54,864 INFO L146 ILogger]: Analyzing trace with hash -1811241234, now seen corresponding path program 76 times [2019-05-23 10:06:54,864 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:54,884 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:54,889 INFO L146 ILogger]: Trace formula consists of 439 conjuncts, 159 conjunts are in the unsatisfiable core [2019-05-23 10:06:54,892 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:57,632 INFO L146 ILogger]: Checked inductivity of 5929 backedges. 38 proven. 5891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:57,632 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:57,632 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-05-23 10:06:57,632 INFO L146 ILogger]: Interpolant automaton has 81 states [2019-05-23 10:06:57,633 INFO L146 ILogger]: Constructing interpolant automaton starting with 81 interpolants. [2019-05-23 10:06:57,633 INFO L146 ILogger]: CoverageRelationStatistics Valid=198, Invalid=6282, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 10:06:57,633 INFO L146 ILogger]: Start difference. First operand 318 states and 320 transitions. Second operand 81 states. [2019-05-23 10:07:06,292 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:07:06,293 INFO L146 ILogger]: Finished difference Result 327 states and 329 transitions. [2019-05-23 10:07:06,293 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-05-23 10:07:06,293 INFO L146 ILogger]: Start accepts. Automaton has 81 states. Word has length 317 [2019-05-23 10:07:06,294 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:07:06,295 INFO L146 ILogger]: With dead ends: 327 [2019-05-23 10:07:06,295 INFO L146 ILogger]: Without dead ends: 327 [2019-05-23 10:07:06,295 INFO L146 ILogger]: 0 DeclaredPredicates, 317 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=202, Invalid=6440, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 10:07:06,296 INFO L146 ILogger]: Start minimizeSevpa. Operand 327 states. [2019-05-23 10:07:06,298 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 327 to 323. [2019-05-23 10:07:06,298 INFO L146 ILogger]: Start removeUnreachable. Operand 323 states. [2019-05-23 10:07:06,299 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 323 states to 323 states and 325 transitions. [2019-05-23 10:07:06,299 INFO L146 ILogger]: Start accepts. Automaton has 323 states and 325 transitions. Word has length 317 [2019-05-23 10:07:06,299 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:07:06,299 INFO L146 ILogger]: Abstraction has 323 states and 325 transitions. [2019-05-23 10:07:06,299 INFO L146 ILogger]: Interpolant automaton has 81 states. [2019-05-23 10:07:06,299 INFO L146 ILogger]: Start isEmpty. Operand 323 states and 325 transitions. [2019-05-23 10:07:06,300 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 323 [2019-05-23 10:07:06,300 INFO L146 ILogger]: Found error trace [2019-05-23 10:07:06,300 INFO L146 ILogger]: trace histogram [40, 40, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:07:06,301 INFO L146 ILogger]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:07:06,301 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:07:06,301 INFO L146 ILogger]: Analyzing trace with hash -1462413240, now seen corresponding path program 77 times [2019-05-23 10:07:06,301 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:07:06,323 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:07:06,327 INFO L146 ILogger]: Trace formula consists of 446 conjuncts, 82 conjunts are in the unsatisfiable core [2019-05-23 10:07:06,329 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:07:08,519 INFO L146 ILogger]: Checked inductivity of 6123 backedges. 3861 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:07:08,519 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:07:08,519 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-05-23 10:07:08,519 INFO L146 ILogger]: Interpolant automaton has 83 states [2019-05-23 10:07:08,520 INFO L146 ILogger]: Constructing interpolant automaton starting with 83 interpolants. [2019-05-23 10:07:08,520 INFO L146 ILogger]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 10:07:08,520 INFO L146 ILogger]: Start difference. First operand 323 states and 325 transitions. Second operand 83 states. [2019-05-23 10:07:10,490 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:07:10,490 INFO L146 ILogger]: Finished difference Result 525 states and 527 transitions. [2019-05-23 10:07:10,490 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-05-23 10:07:10,490 INFO L146 ILogger]: Start accepts. Automaton has 83 states. Word has length 322 [2019-05-23 10:07:10,491 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:07:10,492 INFO L146 ILogger]: With dead ends: 525 [2019-05-23 10:07:10,492 INFO L146 ILogger]: Without dead ends: 328 [2019-05-23 10:07:10,493 INFO L146 ILogger]: 0 DeclaredPredicates, 362 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2379 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3567, Invalid=11685, Unknown=0, NotChecked=0, Total=15252 [2019-05-23 10:07:10,494 INFO L146 ILogger]: Start minimizeSevpa. Operand 328 states. [2019-05-23 10:07:10,496 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 328 to 326. [2019-05-23 10:07:10,496 INFO L146 ILogger]: Start removeUnreachable. Operand 326 states. [2019-05-23 10:07:10,497 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 326 states to 326 states and 328 transitions. [2019-05-23 10:07:10,497 INFO L146 ILogger]: Start accepts. Automaton has 326 states and 328 transitions. Word has length 322 [2019-05-23 10:07:10,497 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:07:10,497 INFO L146 ILogger]: Abstraction has 326 states and 328 transitions. [2019-05-23 10:07:10,497 INFO L146 ILogger]: Interpolant automaton has 83 states. [2019-05-23 10:07:10,497 INFO L146 ILogger]: Start isEmpty. Operand 326 states and 328 transitions. [2019-05-23 10:07:10,499 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 326 [2019-05-23 10:07:10,499 INFO L146 ILogger]: Found error trace [2019-05-23 10:07:10,499 INFO L146 ILogger]: trace histogram [40, 40, 40, 40, 40, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:07:10,499 INFO L146 ILogger]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:07:10,499 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:07:10,500 INFO L146 ILogger]: Analyzing trace with hash -874726869, now seen corresponding path program 78 times [2019-05-23 10:07:10,500 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:07:10,521 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:07:10,526 INFO L146 ILogger]: Trace formula consists of 450 conjuncts, 163 conjunts are in the unsatisfiable core [2019-05-23 10:07:10,528 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:07:13,367 INFO L146 ILogger]: Checked inductivity of 6241 backedges. 39 proven. 6202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:07:13,367 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:07:13,367 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-05-23 10:07:13,368 INFO L146 ILogger]: Interpolant automaton has 83 states [2019-05-23 10:07:13,368 INFO L146 ILogger]: Constructing interpolant automaton starting with 83 interpolants. [2019-05-23 10:07:13,368 INFO L146 ILogger]: CoverageRelationStatistics Valid=203, Invalid=6603, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 10:07:13,368 INFO L146 ILogger]: Start difference. First operand 326 states and 328 transitions. Second operand 83 states. [2019-05-23 10:07:24,317 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:07:24,318 INFO L146 ILogger]: Finished difference Result 335 states and 337 transitions. [2019-05-23 10:07:24,318 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-23 10:07:24,318 INFO L146 ILogger]: Start accepts. Automaton has 83 states. Word has length 325 [2019-05-23 10:07:24,318 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:07:24,320 INFO L146 ILogger]: With dead ends: 335 [2019-05-23 10:07:24,320 INFO L146 ILogger]: Without dead ends: 335 [2019-05-23 10:07:24,320 INFO L146 ILogger]: 0 DeclaredPredicates, 325 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=207, Invalid=6765, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 10:07:24,321 INFO L146 ILogger]: Start minimizeSevpa. Operand 335 states. [2019-05-23 10:07:24,323 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 335 to 331. [2019-05-23 10:07:24,323 INFO L146 ILogger]: Start removeUnreachable. Operand 331 states. [2019-05-23 10:07:24,323 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 331 states to 331 states and 333 transitions. [2019-05-23 10:07:24,324 INFO L146 ILogger]: Start accepts. Automaton has 331 states and 333 transitions. Word has length 325 [2019-05-23 10:07:24,324 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:07:24,324 INFO L146 ILogger]: Abstraction has 331 states and 333 transitions. [2019-05-23 10:07:24,324 INFO L146 ILogger]: Interpolant automaton has 83 states. [2019-05-23 10:07:24,324 INFO L146 ILogger]: Start isEmpty. Operand 331 states and 333 transitions. [2019-05-23 10:07:24,325 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 331 [2019-05-23 10:07:24,325 INFO L146 ILogger]: Found error trace [2019-05-23 10:07:24,325 INFO L146 ILogger]: trace histogram [41, 41, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:07:24,325 INFO L146 ILogger]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:07:24,325 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:07:24,326 INFO L146 ILogger]: Analyzing trace with hash 1483653931, now seen corresponding path program 79 times [2019-05-23 10:07:24,326 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:07:24,348 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:07:24,351 INFO L146 ILogger]: Trace formula consists of 457 conjuncts, 84 conjunts are in the unsatisfiable core [2019-05-23 10:07:24,353 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:07:26,815 INFO L146 ILogger]: Checked inductivity of 6440 backedges. 4060 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:07:26,815 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:07:26,815 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-05-23 10:07:26,816 INFO L146 ILogger]: Interpolant automaton has 85 states [2019-05-23 10:07:26,816 INFO L146 ILogger]: Constructing interpolant automaton starting with 85 interpolants. [2019-05-23 10:07:26,816 INFO L146 ILogger]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 10:07:26,817 INFO L146 ILogger]: Start difference. First operand 331 states and 333 transitions. Second operand 85 states. [2019-05-23 10:07:28,883 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:07:28,883 INFO L146 ILogger]: Finished difference Result 538 states and 540 transitions. [2019-05-23 10:07:28,888 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-05-23 10:07:28,888 INFO L146 ILogger]: Start accepts. Automaton has 85 states. Word has length 330 [2019-05-23 10:07:28,889 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:07:28,890 INFO L146 ILogger]: With dead ends: 538 [2019-05-23 10:07:28,890 INFO L146 ILogger]: Without dead ends: 336 [2019-05-23 10:07:28,891 INFO L146 ILogger]: 0 DeclaredPredicates, 371 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2500 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3738, Invalid=12264, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 10:07:28,891 INFO L146 ILogger]: Start minimizeSevpa. Operand 336 states. [2019-05-23 10:07:28,892 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-05-23 10:07:28,893 INFO L146 ILogger]: Start removeUnreachable. Operand 334 states. [2019-05-23 10:07:28,893 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 334 states to 334 states and 336 transitions. [2019-05-23 10:07:28,893 INFO L146 ILogger]: Start accepts. Automaton has 334 states and 336 transitions. Word has length 330 [2019-05-23 10:07:28,893 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:07:28,893 INFO L146 ILogger]: Abstraction has 334 states and 336 transitions. [2019-05-23 10:07:28,893 INFO L146 ILogger]: Interpolant automaton has 85 states. [2019-05-23 10:07:28,893 INFO L146 ILogger]: Start isEmpty. Operand 334 states and 336 transitions. [2019-05-23 10:07:28,894 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 334 [2019-05-23 10:07:28,894 INFO L146 ILogger]: Found error trace [2019-05-23 10:07:28,894 INFO L146 ILogger]: trace histogram [41, 41, 41, 41, 41, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:07:28,895 INFO L146 ILogger]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:07:28,895 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:07:28,895 INFO L146 ILogger]: Analyzing trace with hash -348941810, now seen corresponding path program 80 times [2019-05-23 10:07:28,895 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:07:28,917 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:07:28,921 INFO L146 ILogger]: Trace formula consists of 461 conjuncts, 167 conjunts are in the unsatisfiable core [2019-05-23 10:07:28,923 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:07:31,935 INFO L146 ILogger]: Checked inductivity of 6561 backedges. 40 proven. 6521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:07:31,935 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:07:31,935 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-05-23 10:07:31,936 INFO L146 ILogger]: Interpolant automaton has 85 states [2019-05-23 10:07:31,936 INFO L146 ILogger]: Constructing interpolant automaton starting with 85 interpolants. [2019-05-23 10:07:31,936 INFO L146 ILogger]: CoverageRelationStatistics Valid=208, Invalid=6932, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 10:07:31,936 INFO L146 ILogger]: Start difference. First operand 334 states and 336 transitions. Second operand 85 states. [2019-05-23 10:07:41,557 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:07:41,558 INFO L146 ILogger]: Finished difference Result 343 states and 345 transitions. [2019-05-23 10:07:41,558 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-05-23 10:07:41,558 INFO L146 ILogger]: Start accepts. Automaton has 85 states. Word has length 333 [2019-05-23 10:07:41,559 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:07:41,560 INFO L146 ILogger]: With dead ends: 343 [2019-05-23 10:07:41,560 INFO L146 ILogger]: Without dead ends: 343 [2019-05-23 10:07:41,561 INFO L146 ILogger]: 0 DeclaredPredicates, 333 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=212, Invalid=7098, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 10:07:41,561 INFO L146 ILogger]: Start minimizeSevpa. Operand 343 states. [2019-05-23 10:07:41,563 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 343 to 339. [2019-05-23 10:07:41,563 INFO L146 ILogger]: Start removeUnreachable. Operand 339 states. [2019-05-23 10:07:41,564 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 339 states to 339 states and 341 transitions. [2019-05-23 10:07:41,564 INFO L146 ILogger]: Start accepts. Automaton has 339 states and 341 transitions. Word has length 333 [2019-05-23 10:07:41,564 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:07:41,564 INFO L146 ILogger]: Abstraction has 339 states and 341 transitions. [2019-05-23 10:07:41,564 INFO L146 ILogger]: Interpolant automaton has 85 states. [2019-05-23 10:07:41,564 INFO L146 ILogger]: Start isEmpty. Operand 339 states and 341 transitions. [2019-05-23 10:07:41,565 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 339 [2019-05-23 10:07:41,565 INFO L146 ILogger]: Found error trace [2019-05-23 10:07:41,566 INFO L146 ILogger]: trace histogram [42, 42, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:07:41,566 INFO L146 ILogger]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:07:41,566 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:07:41,566 INFO L146 ILogger]: Analyzing trace with hash -1004379864, now seen corresponding path program 81 times [2019-05-23 10:07:41,567 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:07:41,592 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:07:41,597 INFO L146 ILogger]: Trace formula consists of 468 conjuncts, 86 conjunts are in the unsatisfiable core [2019-05-23 10:07:41,599 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:07:43,855 INFO L146 ILogger]: Checked inductivity of 6765 backedges. 4264 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:07:43,856 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:07:43,856 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-05-23 10:07:43,856 INFO L146 ILogger]: Interpolant automaton has 87 states [2019-05-23 10:07:43,857 INFO L146 ILogger]: Constructing interpolant automaton starting with 87 interpolants. [2019-05-23 10:07:43,857 INFO L146 ILogger]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 10:07:43,857 INFO L146 ILogger]: Start difference. First operand 339 states and 341 transitions. Second operand 87 states. [2019-05-23 10:07:46,709 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:07:46,709 INFO L146 ILogger]: Finished difference Result 551 states and 553 transitions. [2019-05-23 10:07:46,709 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-05-23 10:07:46,709 INFO L146 ILogger]: Start accepts. Automaton has 87 states. Word has length 338 [2019-05-23 10:07:46,710 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:07:46,711 INFO L146 ILogger]: With dead ends: 551 [2019-05-23 10:07:46,711 INFO L146 ILogger]: Without dead ends: 344 [2019-05-23 10:07:46,712 INFO L146 ILogger]: 0 DeclaredPredicates, 380 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2624 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3913, Invalid=12857, Unknown=0, NotChecked=0, Total=16770 [2019-05-23 10:07:46,713 INFO L146 ILogger]: Start minimizeSevpa. Operand 344 states. [2019-05-23 10:07:46,715 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 344 to 342. [2019-05-23 10:07:46,715 INFO L146 ILogger]: Start removeUnreachable. Operand 342 states. [2019-05-23 10:07:46,716 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 342 states to 342 states and 344 transitions. [2019-05-23 10:07:46,716 INFO L146 ILogger]: Start accepts. Automaton has 342 states and 344 transitions. Word has length 338 [2019-05-23 10:07:46,716 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:07:46,716 INFO L146 ILogger]: Abstraction has 342 states and 344 transitions. [2019-05-23 10:07:46,716 INFO L146 ILogger]: Interpolant automaton has 87 states. [2019-05-23 10:07:46,716 INFO L146 ILogger]: Start isEmpty. Operand 342 states and 344 transitions. [2019-05-23 10:07:46,718 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 342 [2019-05-23 10:07:46,718 INFO L146 ILogger]: Found error trace [2019-05-23 10:07:46,718 INFO L146 ILogger]: trace histogram [42, 42, 42, 42, 42, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:07:46,718 INFO L146 ILogger]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:07:46,719 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:07:46,719 INFO L146 ILogger]: Analyzing trace with hash -588800757, now seen corresponding path program 82 times [2019-05-23 10:07:46,719 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:07:46,747 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:07:46,753 INFO L146 ILogger]: Trace formula consists of 472 conjuncts, 171 conjunts are in the unsatisfiable core [2019-05-23 10:07:46,756 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:07:49,957 INFO L146 ILogger]: Checked inductivity of 6889 backedges. 41 proven. 6848 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:07:49,957 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:07:49,958 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-05-23 10:07:49,958 INFO L146 ILogger]: Interpolant automaton has 87 states [2019-05-23 10:07:49,958 INFO L146 ILogger]: Constructing interpolant automaton starting with 87 interpolants. [2019-05-23 10:07:49,959 INFO L146 ILogger]: CoverageRelationStatistics Valid=213, Invalid=7269, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 10:07:49,959 INFO L146 ILogger]: Start difference. First operand 342 states and 344 transitions. Second operand 87 states. [2019-05-23 10:08:00,383 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:08:00,383 INFO L146 ILogger]: Finished difference Result 351 states and 353 transitions. [2019-05-23 10:08:00,383 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-05-23 10:08:00,384 INFO L146 ILogger]: Start accepts. Automaton has 87 states. Word has length 341 [2019-05-23 10:08:00,384 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:08:00,385 INFO L146 ILogger]: With dead ends: 351 [2019-05-23 10:08:00,385 INFO L146 ILogger]: Without dead ends: 351 [2019-05-23 10:08:00,386 INFO L146 ILogger]: 0 DeclaredPredicates, 341 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=217, Invalid=7439, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 10:08:00,387 INFO L146 ILogger]: Start minimizeSevpa. Operand 351 states. [2019-05-23 10:08:00,389 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 351 to 347. [2019-05-23 10:08:00,389 INFO L146 ILogger]: Start removeUnreachable. Operand 347 states. [2019-05-23 10:08:00,390 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 347 states to 347 states and 349 transitions. [2019-05-23 10:08:00,390 INFO L146 ILogger]: Start accepts. Automaton has 347 states and 349 transitions. Word has length 341 [2019-05-23 10:08:00,390 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:08:00,390 INFO L146 ILogger]: Abstraction has 347 states and 349 transitions. [2019-05-23 10:08:00,390 INFO L146 ILogger]: Interpolant automaton has 87 states. [2019-05-23 10:08:00,390 INFO L146 ILogger]: Start isEmpty. Operand 347 states and 349 transitions. [2019-05-23 10:08:00,391 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 347 [2019-05-23 10:08:00,392 INFO L146 ILogger]: Found error trace [2019-05-23 10:08:00,392 INFO L146 ILogger]: trace histogram [43, 43, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:08:00,392 INFO L146 ILogger]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:08:00,392 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:08:00,392 INFO L146 ILogger]: Analyzing trace with hash -2095141813, now seen corresponding path program 83 times [2019-05-23 10:08:00,393 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:08:00,417 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:08:00,422 INFO L146 ILogger]: Trace formula consists of 479 conjuncts, 88 conjunts are in the unsatisfiable core [2019-05-23 10:08:00,424 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:08:02,759 INFO L146 ILogger]: Checked inductivity of 7098 backedges. 4473 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:08:02,760 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:08:02,760 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-05-23 10:08:02,760 INFO L146 ILogger]: Interpolant automaton has 89 states [2019-05-23 10:08:02,761 INFO L146 ILogger]: Constructing interpolant automaton starting with 89 interpolants. [2019-05-23 10:08:02,761 INFO L146 ILogger]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 10:08:02,761 INFO L146 ILogger]: Start difference. First operand 347 states and 349 transitions. Second operand 89 states. [2019-05-23 10:08:05,127 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:08:05,127 INFO L146 ILogger]: Finished difference Result 564 states and 566 transitions. [2019-05-23 10:08:05,128 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-05-23 10:08:05,128 INFO L146 ILogger]: Start accepts. Automaton has 89 states. Word has length 346 [2019-05-23 10:08:05,128 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:08:05,130 INFO L146 ILogger]: With dead ends: 564 [2019-05-23 10:08:05,130 INFO L146 ILogger]: Without dead ends: 352 [2019-05-23 10:08:05,131 INFO L146 ILogger]: 0 DeclaredPredicates, 389 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2751 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4092, Invalid=13464, Unknown=0, NotChecked=0, Total=17556 [2019-05-23 10:08:05,131 INFO L146 ILogger]: Start minimizeSevpa. Operand 352 states. [2019-05-23 10:08:05,134 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 352 to 350. [2019-05-23 10:08:05,134 INFO L146 ILogger]: Start removeUnreachable. Operand 350 states. [2019-05-23 10:08:05,134 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 350 states to 350 states and 352 transitions. [2019-05-23 10:08:05,134 INFO L146 ILogger]: Start accepts. Automaton has 350 states and 352 transitions. Word has length 346 [2019-05-23 10:08:05,134 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:08:05,134 INFO L146 ILogger]: Abstraction has 350 states and 352 transitions. [2019-05-23 10:08:05,134 INFO L146 ILogger]: Interpolant automaton has 89 states. [2019-05-23 10:08:05,134 INFO L146 ILogger]: Start isEmpty. Operand 350 states and 352 transitions. [2019-05-23 10:08:05,135 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 350 [2019-05-23 10:08:05,136 INFO L146 ILogger]: Found error trace [2019-05-23 10:08:05,136 INFO L146 ILogger]: trace histogram [43, 43, 43, 43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:08:05,136 INFO L146 ILogger]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:08:05,136 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:08:05,136 INFO L146 ILogger]: Analyzing trace with hash 1160205614, now seen corresponding path program 84 times [2019-05-23 10:08:05,137 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:08:05,162 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:08:05,167 INFO L146 ILogger]: Trace formula consists of 483 conjuncts, 175 conjunts are in the unsatisfiable core [2019-05-23 10:08:05,169 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:08:08,475 INFO L146 ILogger]: Checked inductivity of 7225 backedges. 42 proven. 7183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:08:08,475 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:08:08,475 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-05-23 10:08:08,476 INFO L146 ILogger]: Interpolant automaton has 89 states [2019-05-23 10:08:08,476 INFO L146 ILogger]: Constructing interpolant automaton starting with 89 interpolants. [2019-05-23 10:08:08,476 INFO L146 ILogger]: CoverageRelationStatistics Valid=218, Invalid=7614, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 10:08:08,476 INFO L146 ILogger]: Start difference. First operand 350 states and 352 transitions. Second operand 89 states. [2019-05-23 10:08:18,985 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:08:18,985 INFO L146 ILogger]: Finished difference Result 359 states and 361 transitions. [2019-05-23 10:08:18,986 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-23 10:08:18,986 INFO L146 ILogger]: Start accepts. Automaton has 89 states. Word has length 349 [2019-05-23 10:08:18,986 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:08:18,988 INFO L146 ILogger]: With dead ends: 359 [2019-05-23 10:08:18,988 INFO L146 ILogger]: Without dead ends: 359 [2019-05-23 10:08:18,988 INFO L146 ILogger]: 0 DeclaredPredicates, 349 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=222, Invalid=7788, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 10:08:18,989 INFO L146 ILogger]: Start minimizeSevpa. Operand 359 states. [2019-05-23 10:08:18,991 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 359 to 355. [2019-05-23 10:08:18,991 INFO L146 ILogger]: Start removeUnreachable. Operand 355 states. [2019-05-23 10:08:18,992 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 355 states to 355 states and 357 transitions. [2019-05-23 10:08:18,992 INFO L146 ILogger]: Start accepts. Automaton has 355 states and 357 transitions. Word has length 349 [2019-05-23 10:08:18,992 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:08:18,992 INFO L146 ILogger]: Abstraction has 355 states and 357 transitions. [2019-05-23 10:08:18,992 INFO L146 ILogger]: Interpolant automaton has 89 states. [2019-05-23 10:08:18,992 INFO L146 ILogger]: Start isEmpty. Operand 355 states and 357 transitions. [2019-05-23 10:08:18,993 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 355 [2019-05-23 10:08:18,993 INFO L146 ILogger]: Found error trace [2019-05-23 10:08:18,994 INFO L146 ILogger]: trace histogram [44, 44, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:08:18,994 INFO L146 ILogger]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:08:18,994 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:08:18,994 INFO L146 ILogger]: Analyzing trace with hash -1582591480, now seen corresponding path program 85 times [2019-05-23 10:08:18,994 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:08:19,022 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:08:19,026 INFO L146 ILogger]: Trace formula consists of 490 conjuncts, 90 conjunts are in the unsatisfiable core [2019-05-23 10:08:19,029 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:08:21,470 INFO L146 ILogger]: Checked inductivity of 7439 backedges. 4687 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:08:21,471 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:08:21,471 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-05-23 10:08:21,471 INFO L146 ILogger]: Interpolant automaton has 91 states [2019-05-23 10:08:21,472 INFO L146 ILogger]: Constructing interpolant automaton starting with 91 interpolants. [2019-05-23 10:08:21,472 INFO L146 ILogger]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 10:08:21,472 INFO L146 ILogger]: Start difference. First operand 355 states and 357 transitions. Second operand 91 states. [2019-05-23 10:08:24,081 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:08:24,082 INFO L146 ILogger]: Finished difference Result 577 states and 579 transitions. [2019-05-23 10:08:24,082 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-05-23 10:08:24,082 INFO L146 ILogger]: Start accepts. Automaton has 91 states. Word has length 354 [2019-05-23 10:08:24,083 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:08:24,084 INFO L146 ILogger]: With dead ends: 577 [2019-05-23 10:08:24,084 INFO L146 ILogger]: Without dead ends: 360 [2019-05-23 10:08:24,085 INFO L146 ILogger]: 0 DeclaredPredicates, 398 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2881 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4275, Invalid=14085, Unknown=0, NotChecked=0, Total=18360 [2019-05-23 10:08:24,086 INFO L146 ILogger]: Start minimizeSevpa. Operand 360 states. [2019-05-23 10:08:24,088 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 360 to 358. [2019-05-23 10:08:24,088 INFO L146 ILogger]: Start removeUnreachable. Operand 358 states. [2019-05-23 10:08:24,089 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 358 states to 358 states and 360 transitions. [2019-05-23 10:08:24,089 INFO L146 ILogger]: Start accepts. Automaton has 358 states and 360 transitions. Word has length 354 [2019-05-23 10:08:24,089 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:08:24,089 INFO L146 ILogger]: Abstraction has 358 states and 360 transitions. [2019-05-23 10:08:24,089 INFO L146 ILogger]: Interpolant automaton has 91 states. [2019-05-23 10:08:24,089 INFO L146 ILogger]: Start isEmpty. Operand 358 states and 360 transitions. [2019-05-23 10:08:24,090 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 358 [2019-05-23 10:08:24,090 INFO L146 ILogger]: Found error trace [2019-05-23 10:08:24,090 INFO L146 ILogger]: trace histogram [44, 44, 44, 44, 44, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:08:24,090 INFO L146 ILogger]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:08:24,091 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:08:24,091 INFO L146 ILogger]: Analyzing trace with hash 1027254251, now seen corresponding path program 86 times [2019-05-23 10:08:24,091 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:08:24,117 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:08:24,121 INFO L146 ILogger]: Trace formula consists of 494 conjuncts, 179 conjunts are in the unsatisfiable core [2019-05-23 10:08:24,124 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:08:27,578 INFO L146 ILogger]: Checked inductivity of 7569 backedges. 43 proven. 7526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:08:27,578 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:08:27,578 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-05-23 10:08:27,578 INFO L146 ILogger]: Interpolant automaton has 91 states [2019-05-23 10:08:27,579 INFO L146 ILogger]: Constructing interpolant automaton starting with 91 interpolants. [2019-05-23 10:08:27,579 INFO L146 ILogger]: CoverageRelationStatistics Valid=223, Invalid=7967, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 10:08:27,579 INFO L146 ILogger]: Start difference. First operand 358 states and 360 transitions. Second operand 91 states. [2019-05-23 10:08:40,181 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:08:40,181 INFO L146 ILogger]: Finished difference Result 367 states and 369 transitions. [2019-05-23 10:08:40,181 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-05-23 10:08:40,182 INFO L146 ILogger]: Start accepts. Automaton has 91 states. Word has length 357 [2019-05-23 10:08:40,182 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:08:40,183 INFO L146 ILogger]: With dead ends: 367 [2019-05-23 10:08:40,184 INFO L146 ILogger]: Without dead ends: 367 [2019-05-23 10:08:40,184 INFO L146 ILogger]: 0 DeclaredPredicates, 357 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=227, Invalid=8145, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 10:08:40,185 INFO L146 ILogger]: Start minimizeSevpa. Operand 367 states. [2019-05-23 10:08:40,187 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 367 to 363. [2019-05-23 10:08:40,187 INFO L146 ILogger]: Start removeUnreachable. Operand 363 states. [2019-05-23 10:08:40,187 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 363 states to 363 states and 365 transitions. [2019-05-23 10:08:40,187 INFO L146 ILogger]: Start accepts. Automaton has 363 states and 365 transitions. Word has length 357 [2019-05-23 10:08:40,187 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:08:40,188 INFO L146 ILogger]: Abstraction has 363 states and 365 transitions. [2019-05-23 10:08:40,188 INFO L146 ILogger]: Interpolant automaton has 91 states. [2019-05-23 10:08:40,188 INFO L146 ILogger]: Start isEmpty. Operand 363 states and 365 transitions. [2019-05-23 10:08:40,189 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 363 [2019-05-23 10:08:40,189 INFO L146 ILogger]: Found error trace [2019-05-23 10:08:40,189 INFO L146 ILogger]: trace histogram [45, 45, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:08:40,189 INFO L146 ILogger]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:08:40,189 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:08:40,190 INFO L146 ILogger]: Analyzing trace with hash -312513173, now seen corresponding path program 87 times [2019-05-23 10:08:40,190 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:08:40,216 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:08:40,221 INFO L146 ILogger]: Trace formula consists of 501 conjuncts, 92 conjunts are in the unsatisfiable core [2019-05-23 10:08:40,223 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:08:42,794 INFO L146 ILogger]: Checked inductivity of 7788 backedges. 4906 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:08:42,794 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:08:42,795 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-05-23 10:08:42,795 INFO L146 ILogger]: Interpolant automaton has 93 states [2019-05-23 10:08:42,795 INFO L146 ILogger]: Constructing interpolant automaton starting with 93 interpolants. [2019-05-23 10:08:42,796 INFO L146 ILogger]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 10:08:42,796 INFO L146 ILogger]: Start difference. First operand 363 states and 365 transitions. Second operand 93 states. [2019-05-23 10:08:45,457 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:08:45,457 INFO L146 ILogger]: Finished difference Result 590 states and 592 transitions. [2019-05-23 10:08:45,457 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-05-23 10:08:45,457 INFO L146 ILogger]: Start accepts. Automaton has 93 states. Word has length 362 [2019-05-23 10:08:45,458 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:08:45,460 INFO L146 ILogger]: With dead ends: 590 [2019-05-23 10:08:45,460 INFO L146 ILogger]: Without dead ends: 368 [2019-05-23 10:08:45,461 INFO L146 ILogger]: 0 DeclaredPredicates, 407 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3014 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4462, Invalid=14720, Unknown=0, NotChecked=0, Total=19182 [2019-05-23 10:08:45,461 INFO L146 ILogger]: Start minimizeSevpa. Operand 368 states. [2019-05-23 10:08:45,464 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 368 to 366. [2019-05-23 10:08:45,464 INFO L146 ILogger]: Start removeUnreachable. Operand 366 states. [2019-05-23 10:08:45,464 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 366 states to 366 states and 368 transitions. [2019-05-23 10:08:45,464 INFO L146 ILogger]: Start accepts. Automaton has 366 states and 368 transitions. Word has length 362 [2019-05-23 10:08:45,464 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:08:45,464 INFO L146 ILogger]: Abstraction has 366 states and 368 transitions. [2019-05-23 10:08:45,464 INFO L146 ILogger]: Interpolant automaton has 93 states. [2019-05-23 10:08:45,465 INFO L146 ILogger]: Start isEmpty. Operand 366 states and 368 transitions. [2019-05-23 10:08:45,466 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 366 [2019-05-23 10:08:45,466 INFO L146 ILogger]: Found error trace [2019-05-23 10:08:45,466 INFO L146 ILogger]: trace histogram [45, 45, 45, 45, 45, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:08:45,466 INFO L146 ILogger]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:08:45,466 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:08:45,466 INFO L146 ILogger]: Analyzing trace with hash -1615335346, now seen corresponding path program 88 times [2019-05-23 10:08:45,467 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:08:45,493 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:08:45,498 INFO L146 ILogger]: Trace formula consists of 505 conjuncts, 183 conjunts are in the unsatisfiable core [2019-05-23 10:08:45,500 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:08:49,099 INFO L146 ILogger]: Checked inductivity of 7921 backedges. 44 proven. 7877 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:08:49,099 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:08:49,099 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-05-23 10:08:49,099 INFO L146 ILogger]: Interpolant automaton has 93 states [2019-05-23 10:08:49,100 INFO L146 ILogger]: Constructing interpolant automaton starting with 93 interpolants. [2019-05-23 10:08:49,100 INFO L146 ILogger]: CoverageRelationStatistics Valid=228, Invalid=8328, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 10:08:49,100 INFO L146 ILogger]: Start difference. First operand 366 states and 368 transitions. Second operand 93 states. [2019-05-23 10:09:02,771 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:09:02,772 INFO L146 ILogger]: Finished difference Result 375 states and 377 transitions. [2019-05-23 10:09:02,772 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-05-23 10:09:02,772 INFO L146 ILogger]: Start accepts. Automaton has 93 states. Word has length 365 [2019-05-23 10:09:02,773 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:09:02,774 INFO L146 ILogger]: With dead ends: 375 [2019-05-23 10:09:02,774 INFO L146 ILogger]: Without dead ends: 375 [2019-05-23 10:09:02,775 INFO L146 ILogger]: 0 DeclaredPredicates, 365 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=232, Invalid=8510, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 10:09:02,775 INFO L146 ILogger]: Start minimizeSevpa. Operand 375 states. [2019-05-23 10:09:02,778 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 375 to 371. [2019-05-23 10:09:02,778 INFO L146 ILogger]: Start removeUnreachable. Operand 371 states. [2019-05-23 10:09:02,778 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 371 states to 371 states and 373 transitions. [2019-05-23 10:09:02,778 INFO L146 ILogger]: Start accepts. Automaton has 371 states and 373 transitions. Word has length 365 [2019-05-23 10:09:02,779 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:09:02,779 INFO L146 ILogger]: Abstraction has 371 states and 373 transitions. [2019-05-23 10:09:02,779 INFO L146 ILogger]: Interpolant automaton has 93 states. [2019-05-23 10:09:02,779 INFO L146 ILogger]: Start isEmpty. Operand 371 states and 373 transitions. [2019-05-23 10:09:02,780 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 371 [2019-05-23 10:09:02,780 INFO L146 ILogger]: Found error trace [2019-05-23 10:09:02,780 INFO L146 ILogger]: trace histogram [46, 46, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:09:02,780 INFO L146 ILogger]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:09:02,781 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:09:02,781 INFO L146 ILogger]: Analyzing trace with hash 383707880, now seen corresponding path program 89 times [2019-05-23 10:09:02,781 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:09:02,821 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:09:02,829 INFO L146 ILogger]: Trace formula consists of 512 conjuncts, 94 conjunts are in the unsatisfiable core [2019-05-23 10:09:02,832 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:09:05,518 INFO L146 ILogger]: Checked inductivity of 8145 backedges. 5130 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:09:05,518 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:09:05,519 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-05-23 10:09:05,519 INFO L146 ILogger]: Interpolant automaton has 95 states [2019-05-23 10:09:05,519 INFO L146 ILogger]: Constructing interpolant automaton starting with 95 interpolants. [2019-05-23 10:09:05,520 INFO L146 ILogger]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 10:09:05,520 INFO L146 ILogger]: Start difference. First operand 371 states and 373 transitions. Second operand 95 states. [2019-05-23 10:09:08,757 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:09:08,758 INFO L146 ILogger]: Finished difference Result 603 states and 605 transitions. [2019-05-23 10:09:08,758 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-05-23 10:09:08,758 INFO L146 ILogger]: Start accepts. Automaton has 95 states. Word has length 370 [2019-05-23 10:09:08,759 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:09:08,760 INFO L146 ILogger]: With dead ends: 603 [2019-05-23 10:09:08,760 INFO L146 ILogger]: Without dead ends: 376 [2019-05-23 10:09:08,762 INFO L146 ILogger]: 0 DeclaredPredicates, 416 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3150 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4653, Invalid=15369, Unknown=0, NotChecked=0, Total=20022 [2019-05-23 10:09:08,762 INFO L146 ILogger]: Start minimizeSevpa. Operand 376 states. [2019-05-23 10:09:08,764 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 376 to 374. [2019-05-23 10:09:08,764 INFO L146 ILogger]: Start removeUnreachable. Operand 374 states. [2019-05-23 10:09:08,764 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 374 states to 374 states and 376 transitions. [2019-05-23 10:09:08,764 INFO L146 ILogger]: Start accepts. Automaton has 374 states and 376 transitions. Word has length 370 [2019-05-23 10:09:08,765 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:09:08,765 INFO L146 ILogger]: Abstraction has 374 states and 376 transitions. [2019-05-23 10:09:08,765 INFO L146 ILogger]: Interpolant automaton has 95 states. [2019-05-23 10:09:08,765 INFO L146 ILogger]: Start isEmpty. Operand 374 states and 376 transitions. [2019-05-23 10:09:08,766 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 374 [2019-05-23 10:09:08,766 INFO L146 ILogger]: Found error trace [2019-05-23 10:09:08,766 INFO L146 ILogger]: trace histogram [46, 46, 46, 46, 46, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:09:08,766 INFO L146 ILogger]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:09:08,767 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:09:08,767 INFO L146 ILogger]: Analyzing trace with hash 709089995, now seen corresponding path program 90 times [2019-05-23 10:09:08,767 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:09:08,796 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:09:08,813 INFO L146 ILogger]: Trace formula consists of 516 conjuncts, 187 conjunts are in the unsatisfiable core [2019-05-23 10:09:08,816 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:09:12,602 INFO L146 ILogger]: Checked inductivity of 8281 backedges. 45 proven. 8236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:09:12,602 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:09:12,602 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-05-23 10:09:12,602 INFO L146 ILogger]: Interpolant automaton has 95 states [2019-05-23 10:09:12,603 INFO L146 ILogger]: Constructing interpolant automaton starting with 95 interpolants. [2019-05-23 10:09:12,603 INFO L146 ILogger]: CoverageRelationStatistics Valid=233, Invalid=8697, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 10:09:12,603 INFO L146 ILogger]: Start difference. First operand 374 states and 376 transitions. Second operand 95 states. [2019-05-23 10:09:26,913 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:09:26,913 INFO L146 ILogger]: Finished difference Result 383 states and 385 transitions. [2019-05-23 10:09:26,914 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-05-23 10:09:26,914 INFO L146 ILogger]: Start accepts. Automaton has 95 states. Word has length 373 [2019-05-23 10:09:26,914 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:09:26,916 INFO L146 ILogger]: With dead ends: 383 [2019-05-23 10:09:26,916 INFO L146 ILogger]: Without dead ends: 383 [2019-05-23 10:09:26,917 INFO L146 ILogger]: 0 DeclaredPredicates, 373 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=237, Invalid=8883, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 10:09:26,917 INFO L146 ILogger]: Start minimizeSevpa. Operand 383 states. [2019-05-23 10:09:26,919 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 383 to 379. [2019-05-23 10:09:26,919 INFO L146 ILogger]: Start removeUnreachable. Operand 379 states. [2019-05-23 10:09:26,920 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 379 states to 379 states and 381 transitions. [2019-05-23 10:09:26,920 INFO L146 ILogger]: Start accepts. Automaton has 379 states and 381 transitions. Word has length 373 [2019-05-23 10:09:26,920 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:09:26,920 INFO L146 ILogger]: Abstraction has 379 states and 381 transitions. [2019-05-23 10:09:26,920 INFO L146 ILogger]: Interpolant automaton has 95 states. [2019-05-23 10:09:26,920 INFO L146 ILogger]: Start isEmpty. Operand 379 states and 381 transitions. [2019-05-23 10:09:26,921 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 379 [2019-05-23 10:09:26,922 INFO L146 ILogger]: Found error trace [2019-05-23 10:09:26,922 INFO L146 ILogger]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:09:26,922 INFO L146 ILogger]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:09:26,922 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:09:26,922 INFO L146 ILogger]: Analyzing trace with hash -1904015733, now seen corresponding path program 91 times [2019-05-23 10:09:26,923 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:09:26,951 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:09:26,956 INFO L146 ILogger]: Trace formula consists of 523 conjuncts, 96 conjunts are in the unsatisfiable core [2019-05-23 10:09:26,958 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:09:29,951 INFO L146 ILogger]: Checked inductivity of 8510 backedges. 5359 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:09:29,951 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:09:29,951 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-05-23 10:09:29,952 INFO L146 ILogger]: Interpolant automaton has 97 states [2019-05-23 10:09:29,952 INFO L146 ILogger]: Constructing interpolant automaton starting with 97 interpolants. [2019-05-23 10:09:29,952 INFO L146 ILogger]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 10:09:29,953 INFO L146 ILogger]: Start difference. First operand 379 states and 381 transitions. Second operand 97 states. [2019-05-23 10:09:32,454 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:09:32,454 INFO L146 ILogger]: Finished difference Result 616 states and 618 transitions. [2019-05-23 10:09:32,455 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-05-23 10:09:32,455 INFO L146 ILogger]: Start accepts. Automaton has 97 states. Word has length 378 [2019-05-23 10:09:32,455 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:09:32,457 INFO L146 ILogger]: With dead ends: 616 [2019-05-23 10:09:32,457 INFO L146 ILogger]: Without dead ends: 384 [2019-05-23 10:09:32,459 INFO L146 ILogger]: 0 DeclaredPredicates, 425 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3289 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4848, Invalid=16032, Unknown=0, NotChecked=0, Total=20880 [2019-05-23 10:09:32,459 INFO L146 ILogger]: Start minimizeSevpa. Operand 384 states. [2019-05-23 10:09:32,461 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 384 to 382. [2019-05-23 10:09:32,461 INFO L146 ILogger]: Start removeUnreachable. Operand 382 states. [2019-05-23 10:09:32,461 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 382 states to 382 states and 384 transitions. [2019-05-23 10:09:32,461 INFO L146 ILogger]: Start accepts. Automaton has 382 states and 384 transitions. Word has length 378 [2019-05-23 10:09:32,461 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:09:32,462 INFO L146 ILogger]: Abstraction has 382 states and 384 transitions. [2019-05-23 10:09:32,462 INFO L146 ILogger]: Interpolant automaton has 97 states. [2019-05-23 10:09:32,462 INFO L146 ILogger]: Start isEmpty. Operand 382 states and 384 transitions. [2019-05-23 10:09:32,463 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 382 [2019-05-23 10:09:32,463 INFO L146 ILogger]: Found error trace [2019-05-23 10:09:32,463 INFO L146 ILogger]: trace histogram [47, 47, 47, 47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:09:32,463 INFO L146 ILogger]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:09:32,463 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:09:32,464 INFO L146 ILogger]: Analyzing trace with hash 1513579374, now seen corresponding path program 92 times [2019-05-23 10:09:32,464 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:09:32,492 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:09:32,498 INFO L146 ILogger]: Trace formula consists of 527 conjuncts, 191 conjunts are in the unsatisfiable core [2019-05-23 10:09:32,500 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:09:36,422 INFO L146 ILogger]: Checked inductivity of 8649 backedges. 46 proven. 8603 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:09:36,423 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:09:36,423 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-05-23 10:09:36,423 INFO L146 ILogger]: Interpolant automaton has 97 states [2019-05-23 10:09:36,423 INFO L146 ILogger]: Constructing interpolant automaton starting with 97 interpolants. [2019-05-23 10:09:36,424 INFO L146 ILogger]: CoverageRelationStatistics Valid=238, Invalid=9074, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 10:09:36,424 INFO L146 ILogger]: Start difference. First operand 382 states and 384 transitions. Second operand 97 states. [2019-05-23 10:09:49,863 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:09:49,863 INFO L146 ILogger]: Finished difference Result 391 states and 393 transitions. [2019-05-23 10:09:49,863 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-05-23 10:09:49,863 INFO L146 ILogger]: Start accepts. Automaton has 97 states. Word has length 381 [2019-05-23 10:09:49,864 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:09:49,865 INFO L146 ILogger]: With dead ends: 391 [2019-05-23 10:09:49,866 INFO L146 ILogger]: Without dead ends: 391 [2019-05-23 10:09:49,866 INFO L146 ILogger]: 0 DeclaredPredicates, 381 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=242, Invalid=9264, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 10:09:49,867 INFO L146 ILogger]: Start minimizeSevpa. Operand 391 states. [2019-05-23 10:09:49,869 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 391 to 387. [2019-05-23 10:09:49,869 INFO L146 ILogger]: Start removeUnreachable. Operand 387 states. [2019-05-23 10:09:49,870 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 387 states to 387 states and 389 transitions. [2019-05-23 10:09:49,870 INFO L146 ILogger]: Start accepts. Automaton has 387 states and 389 transitions. Word has length 381 [2019-05-23 10:09:49,870 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:09:49,870 INFO L146 ILogger]: Abstraction has 387 states and 389 transitions. [2019-05-23 10:09:49,870 INFO L146 ILogger]: Interpolant automaton has 97 states. [2019-05-23 10:09:49,870 INFO L146 ILogger]: Start isEmpty. Operand 387 states and 389 transitions. [2019-05-23 10:09:49,872 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 387 [2019-05-23 10:09:49,872 INFO L146 ILogger]: Found error trace [2019-05-23 10:09:49,872 INFO L146 ILogger]: trace histogram [48, 48, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:09:49,872 INFO L146 ILogger]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:09:49,872 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:09:49,872 INFO L146 ILogger]: Analyzing trace with hash -2018874424, now seen corresponding path program 93 times [2019-05-23 10:09:49,873 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:09:49,906 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:09:49,911 INFO L146 ILogger]: Trace formula consists of 534 conjuncts, 98 conjunts are in the unsatisfiable core [2019-05-23 10:09:49,914 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:09:52,860 INFO L146 ILogger]: Checked inductivity of 8883 backedges. 5593 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:09:52,860 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:09:52,860 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-05-23 10:09:52,861 INFO L146 ILogger]: Interpolant automaton has 99 states [2019-05-23 10:09:52,861 INFO L146 ILogger]: Constructing interpolant automaton starting with 99 interpolants. [2019-05-23 10:09:52,862 INFO L146 ILogger]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 10:09:52,862 INFO L146 ILogger]: Start difference. First operand 387 states and 389 transitions. Second operand 99 states. [2019-05-23 10:09:55,380 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:09:55,381 INFO L146 ILogger]: Finished difference Result 629 states and 631 transitions. [2019-05-23 10:09:55,381 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-05-23 10:09:55,381 INFO L146 ILogger]: Start accepts. Automaton has 99 states. Word has length 386 [2019-05-23 10:09:55,382 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:09:55,383 INFO L146 ILogger]: With dead ends: 629 [2019-05-23 10:09:55,383 INFO L146 ILogger]: Without dead ends: 392 [2019-05-23 10:09:55,384 INFO L146 ILogger]: 0 DeclaredPredicates, 434 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3431 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5047, Invalid=16709, Unknown=0, NotChecked=0, Total=21756 [2019-05-23 10:09:55,385 INFO L146 ILogger]: Start minimizeSevpa. Operand 392 states. [2019-05-23 10:09:55,387 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 392 to 390. [2019-05-23 10:09:55,388 INFO L146 ILogger]: Start removeUnreachable. Operand 390 states. [2019-05-23 10:09:55,388 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 390 states to 390 states and 392 transitions. [2019-05-23 10:09:55,388 INFO L146 ILogger]: Start accepts. Automaton has 390 states and 392 transitions. Word has length 386 [2019-05-23 10:09:55,388 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:09:55,388 INFO L146 ILogger]: Abstraction has 390 states and 392 transitions. [2019-05-23 10:09:55,388 INFO L146 ILogger]: Interpolant automaton has 99 states. [2019-05-23 10:09:55,388 INFO L146 ILogger]: Start isEmpty. Operand 390 states and 392 transitions. [2019-05-23 10:09:55,389 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 390 [2019-05-23 10:09:55,389 INFO L146 ILogger]: Found error trace [2019-05-23 10:09:55,390 INFO L146 ILogger]: trace histogram [48, 48, 48, 48, 48, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:09:55,390 INFO L146 ILogger]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:09:55,390 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:09:55,390 INFO L146 ILogger]: Analyzing trace with hash 1878078891, now seen corresponding path program 94 times [2019-05-23 10:09:55,391 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:09:55,421 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:09:55,427 INFO L146 ILogger]: Trace formula consists of 538 conjuncts, 195 conjunts are in the unsatisfiable core [2019-05-23 10:09:55,429 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:09:59,463 INFO L146 ILogger]: Checked inductivity of 9025 backedges. 47 proven. 8978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:09:59,463 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:09:59,464 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-05-23 10:09:59,464 INFO L146 ILogger]: Interpolant automaton has 99 states [2019-05-23 10:09:59,464 INFO L146 ILogger]: Constructing interpolant automaton starting with 99 interpolants. [2019-05-23 10:09:59,464 INFO L146 ILogger]: CoverageRelationStatistics Valid=243, Invalid=9459, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 10:09:59,465 INFO L146 ILogger]: Start difference. First operand 390 states and 392 transitions. Second operand 99 states. [2019-05-23 10:10:13,601 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:10:13,602 INFO L146 ILogger]: Finished difference Result 399 states and 401 transitions. [2019-05-23 10:10:13,602 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-05-23 10:10:13,602 INFO L146 ILogger]: Start accepts. Automaton has 99 states. Word has length 389 [2019-05-23 10:10:13,603 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:10:13,604 INFO L146 ILogger]: With dead ends: 399 [2019-05-23 10:10:13,604 INFO L146 ILogger]: Without dead ends: 399 [2019-05-23 10:10:13,605 INFO L146 ILogger]: 0 DeclaredPredicates, 389 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=247, Invalid=9653, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 10:10:13,605 INFO L146 ILogger]: Start minimizeSevpa. Operand 399 states. [2019-05-23 10:10:13,609 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 399 to 395. [2019-05-23 10:10:13,609 INFO L146 ILogger]: Start removeUnreachable. Operand 395 states. [2019-05-23 10:10:13,609 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 395 states to 395 states and 397 transitions. [2019-05-23 10:10:13,609 INFO L146 ILogger]: Start accepts. Automaton has 395 states and 397 transitions. Word has length 389 [2019-05-23 10:10:13,609 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:10:13,609 INFO L146 ILogger]: Abstraction has 395 states and 397 transitions. [2019-05-23 10:10:13,609 INFO L146 ILogger]: Interpolant automaton has 99 states. [2019-05-23 10:10:13,610 INFO L146 ILogger]: Start isEmpty. Operand 395 states and 397 transitions. [2019-05-23 10:10:13,611 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 395 [2019-05-23 10:10:13,611 INFO L146 ILogger]: Found error trace [2019-05-23 10:10:13,611 INFO L146 ILogger]: trace histogram [49, 49, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:10:13,611 INFO L146 ILogger]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:10:13,611 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:10:13,612 INFO L146 ILogger]: Analyzing trace with hash -547653717, now seen corresponding path program 95 times [2019-05-23 10:10:13,612 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:10:13,647 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:10:13,652 INFO L146 ILogger]: Trace formula consists of 545 conjuncts, 100 conjunts are in the unsatisfiable core [2019-05-23 10:10:13,654 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:10:16,667 INFO L146 ILogger]: Checked inductivity of 9264 backedges. 5832 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:10:16,668 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:10:16,668 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-05-23 10:10:16,668 INFO L146 ILogger]: Interpolant automaton has 101 states [2019-05-23 10:10:16,669 INFO L146 ILogger]: Constructing interpolant automaton starting with 101 interpolants. [2019-05-23 10:10:16,669 INFO L146 ILogger]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 10:10:16,669 INFO L146 ILogger]: Start difference. First operand 395 states and 397 transitions. Second operand 101 states. [2019-05-23 10:10:20,060 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:10:20,061 INFO L146 ILogger]: Finished difference Result 642 states and 644 transitions. [2019-05-23 10:10:20,061 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-05-23 10:10:20,061 INFO L146 ILogger]: Start accepts. Automaton has 101 states. Word has length 394 [2019-05-23 10:10:20,062 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:10:20,063 INFO L146 ILogger]: With dead ends: 642 [2019-05-23 10:10:20,063 INFO L146 ILogger]: Without dead ends: 400 [2019-05-23 10:10:20,065 INFO L146 ILogger]: 0 DeclaredPredicates, 443 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3576 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5250, Invalid=17400, Unknown=0, NotChecked=0, Total=22650 [2019-05-23 10:10:20,065 INFO L146 ILogger]: Start minimizeSevpa. Operand 400 states. [2019-05-23 10:10:20,067 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 400 to 398. [2019-05-23 10:10:20,067 INFO L146 ILogger]: Start removeUnreachable. Operand 398 states. [2019-05-23 10:10:20,068 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 398 states to 398 states and 400 transitions. [2019-05-23 10:10:20,068 INFO L146 ILogger]: Start accepts. Automaton has 398 states and 400 transitions. Word has length 394 [2019-05-23 10:10:20,068 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:10:20,068 INFO L146 ILogger]: Abstraction has 398 states and 400 transitions. [2019-05-23 10:10:20,068 INFO L146 ILogger]: Interpolant automaton has 101 states. [2019-05-23 10:10:20,068 INFO L146 ILogger]: Start isEmpty. Operand 398 states and 400 transitions. [2019-05-23 10:10:20,069 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 398 [2019-05-23 10:10:20,069 INFO L146 ILogger]: Found error trace [2019-05-23 10:10:20,069 INFO L146 ILogger]: trace histogram [49, 49, 49, 49, 49, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:10:20,070 INFO L146 ILogger]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:10:20,070 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:10:20,070 INFO L146 ILogger]: Analyzing trace with hash 1433906830, now seen corresponding path program 96 times [2019-05-23 10:10:20,070 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:10:20,105 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:10:20,114 INFO L146 ILogger]: Trace formula consists of 549 conjuncts, 199 conjunts are in the unsatisfiable core [2019-05-23 10:10:20,118 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:10:24,328 INFO L146 ILogger]: Checked inductivity of 9409 backedges. 48 proven. 9361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:10:24,329 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:10:24,329 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-05-23 10:10:24,329 INFO L146 ILogger]: Interpolant automaton has 101 states [2019-05-23 10:10:24,329 INFO L146 ILogger]: Constructing interpolant automaton starting with 101 interpolants. [2019-05-23 10:10:24,330 INFO L146 ILogger]: CoverageRelationStatistics Valid=248, Invalid=9852, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 10:10:24,330 INFO L146 ILogger]: Start difference. First operand 398 states and 400 transitions. Second operand 101 states. [2019-05-23 10:10:41,312 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:10:41,312 INFO L146 ILogger]: Finished difference Result 407 states and 409 transitions. [2019-05-23 10:10:41,313 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-05-23 10:10:41,313 INFO L146 ILogger]: Start accepts. Automaton has 101 states. Word has length 397 [2019-05-23 10:10:41,313 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:10:41,315 INFO L146 ILogger]: With dead ends: 407 [2019-05-23 10:10:41,315 INFO L146 ILogger]: Without dead ends: 407 [2019-05-23 10:10:41,316 INFO L146 ILogger]: 0 DeclaredPredicates, 397 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=252, Invalid=10050, Unknown=0, NotChecked=0, Total=10302 [2019-05-23 10:10:41,316 INFO L146 ILogger]: Start minimizeSevpa. Operand 407 states. [2019-05-23 10:10:41,318 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 407 to 403. [2019-05-23 10:10:41,319 INFO L146 ILogger]: Start removeUnreachable. Operand 403 states. [2019-05-23 10:10:41,319 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 403 states to 403 states and 405 transitions. [2019-05-23 10:10:41,319 INFO L146 ILogger]: Start accepts. Automaton has 403 states and 405 transitions. Word has length 397 [2019-05-23 10:10:41,319 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:10:41,319 INFO L146 ILogger]: Abstraction has 403 states and 405 transitions. [2019-05-23 10:10:41,319 INFO L146 ILogger]: Interpolant automaton has 101 states. [2019-05-23 10:10:41,319 INFO L146 ILogger]: Start isEmpty. Operand 403 states and 405 transitions. [2019-05-23 10:10:41,321 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 403 [2019-05-23 10:10:41,321 INFO L146 ILogger]: Found error trace [2019-05-23 10:10:41,321 INFO L146 ILogger]: trace histogram [50, 50, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:10:41,322 INFO L146 ILogger]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:10:41,322 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:10:41,322 INFO L146 ILogger]: Analyzing trace with hash -964946776, now seen corresponding path program 97 times [2019-05-23 10:10:41,322 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:10:41,354 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:10:41,361 INFO L146 ILogger]: Trace formula consists of 556 conjuncts, 102 conjunts are in the unsatisfiable core [2019-05-23 10:10:41,363 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:10:44,501 INFO L146 ILogger]: Checked inductivity of 9653 backedges. 6076 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:10:44,502 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:10:44,502 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-05-23 10:10:44,502 INFO L146 ILogger]: Interpolant automaton has 103 states [2019-05-23 10:10:44,503 INFO L146 ILogger]: Constructing interpolant automaton starting with 103 interpolants. [2019-05-23 10:10:44,503 INFO L146 ILogger]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 10:10:44,503 INFO L146 ILogger]: Start difference. First operand 403 states and 405 transitions. Second operand 103 states. [2019-05-23 10:10:47,262 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:10:47,262 INFO L146 ILogger]: Finished difference Result 655 states and 657 transitions. [2019-05-23 10:10:47,262 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-05-23 10:10:47,262 INFO L146 ILogger]: Start accepts. Automaton has 103 states. Word has length 402 [2019-05-23 10:10:47,263 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:10:47,265 INFO L146 ILogger]: With dead ends: 655 [2019-05-23 10:10:47,265 INFO L146 ILogger]: Without dead ends: 408 [2019-05-23 10:10:47,267 INFO L146 ILogger]: 0 DeclaredPredicates, 452 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3724 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5457, Invalid=18105, Unknown=0, NotChecked=0, Total=23562 [2019-05-23 10:10:47,268 INFO L146 ILogger]: Start minimizeSevpa. Operand 408 states. [2019-05-23 10:10:47,270 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 408 to 406. [2019-05-23 10:10:47,270 INFO L146 ILogger]: Start removeUnreachable. Operand 406 states. [2019-05-23 10:10:47,271 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 406 states to 406 states and 408 transitions. [2019-05-23 10:10:47,271 INFO L146 ILogger]: Start accepts. Automaton has 406 states and 408 transitions. Word has length 402 [2019-05-23 10:10:47,271 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:10:47,271 INFO L146 ILogger]: Abstraction has 406 states and 408 transitions. [2019-05-23 10:10:47,272 INFO L146 ILogger]: Interpolant automaton has 103 states. [2019-05-23 10:10:47,272 INFO L146 ILogger]: Start isEmpty. Operand 406 states and 408 transitions. [2019-05-23 10:10:47,273 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 406 [2019-05-23 10:10:47,273 INFO L146 ILogger]: Found error trace [2019-05-23 10:10:47,274 INFO L146 ILogger]: trace histogram [50, 50, 50, 50, 50, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:10:47,274 INFO L146 ILogger]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:10:47,274 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:10:47,274 INFO L146 ILogger]: Analyzing trace with hash 1219541131, now seen corresponding path program 98 times [2019-05-23 10:10:47,275 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:10:47,324 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:10:47,334 INFO L146 ILogger]: Trace formula consists of 560 conjuncts, 203 conjunts are in the unsatisfiable core [2019-05-23 10:10:47,337 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:10:51,769 INFO L146 ILogger]: Checked inductivity of 9801 backedges. 49 proven. 9752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:10:51,769 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:10:51,770 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-05-23 10:10:51,770 INFO L146 ILogger]: Interpolant automaton has 103 states [2019-05-23 10:10:51,770 INFO L146 ILogger]: Constructing interpolant automaton starting with 103 interpolants. [2019-05-23 10:10:51,771 INFO L146 ILogger]: CoverageRelationStatistics Valid=253, Invalid=10253, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 10:10:51,771 INFO L146 ILogger]: Start difference. First operand 406 states and 408 transitions. Second operand 103 states. [2019-05-23 10:11:08,871 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:11:08,871 INFO L146 ILogger]: Finished difference Result 415 states and 417 transitions. [2019-05-23 10:11:08,872 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-05-23 10:11:08,872 INFO L146 ILogger]: Start accepts. Automaton has 103 states. Word has length 405 [2019-05-23 10:11:08,872 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:11:08,874 INFO L146 ILogger]: With dead ends: 415 [2019-05-23 10:11:08,874 INFO L146 ILogger]: Without dead ends: 415 [2019-05-23 10:11:08,875 INFO L146 ILogger]: 0 DeclaredPredicates, 405 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=257, Invalid=10455, Unknown=0, NotChecked=0, Total=10712 [2019-05-23 10:11:08,875 INFO L146 ILogger]: Start minimizeSevpa. Operand 415 states. [2019-05-23 10:11:08,878 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 415 to 411. [2019-05-23 10:11:08,879 INFO L146 ILogger]: Start removeUnreachable. Operand 411 states. [2019-05-23 10:11:08,879 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 411 states to 411 states and 413 transitions. [2019-05-23 10:11:08,879 INFO L146 ILogger]: Start accepts. Automaton has 411 states and 413 transitions. Word has length 405 [2019-05-23 10:11:08,880 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:11:08,880 INFO L146 ILogger]: Abstraction has 411 states and 413 transitions. [2019-05-23 10:11:08,880 INFO L146 ILogger]: Interpolant automaton has 103 states. [2019-05-23 10:11:08,880 INFO L146 ILogger]: Start isEmpty. Operand 411 states and 413 transitions. [2019-05-23 10:11:08,882 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 411 [2019-05-23 10:11:08,882 INFO L146 ILogger]: Found error trace [2019-05-23 10:11:08,882 INFO L146 ILogger]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:11:08,882 INFO L146 ILogger]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:11:08,882 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:11:08,883 INFO L146 ILogger]: Analyzing trace with hash -96812853, now seen corresponding path program 99 times [2019-05-23 10:11:08,883 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:11:08,916 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:11:08,921 INFO L146 ILogger]: Trace formula consists of 567 conjuncts, 104 conjunts are in the unsatisfiable core [2019-05-23 10:11:08,924 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:11:12,223 INFO L146 ILogger]: Checked inductivity of 10050 backedges. 6325 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:11:12,223 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:11:12,223 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-05-23 10:11:12,224 INFO L146 ILogger]: Interpolant automaton has 105 states [2019-05-23 10:11:12,224 INFO L146 ILogger]: Constructing interpolant automaton starting with 105 interpolants. [2019-05-23 10:11:12,225 INFO L146 ILogger]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 10:11:12,225 INFO L146 ILogger]: Start difference. First operand 411 states and 413 transitions. Second operand 105 states. [2019-05-23 10:11:15,282 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:11:15,282 INFO L146 ILogger]: Finished difference Result 668 states and 670 transitions. [2019-05-23 10:11:15,283 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-05-23 10:11:15,283 INFO L146 ILogger]: Start accepts. Automaton has 105 states. Word has length 410 [2019-05-23 10:11:15,284 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:11:15,284 INFO L146 ILogger]: With dead ends: 668 [2019-05-23 10:11:15,285 INFO L146 ILogger]: Without dead ends: 416 [2019-05-23 10:11:15,287 INFO L146 ILogger]: 0 DeclaredPredicates, 461 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3875 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5668, Invalid=18824, Unknown=0, NotChecked=0, Total=24492 [2019-05-23 10:11:15,287 INFO L146 ILogger]: Start minimizeSevpa. Operand 416 states. [2019-05-23 10:11:15,290 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 416 to 414. [2019-05-23 10:11:15,290 INFO L146 ILogger]: Start removeUnreachable. Operand 414 states. [2019-05-23 10:11:15,290 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 414 states to 414 states and 416 transitions. [2019-05-23 10:11:15,290 INFO L146 ILogger]: Start accepts. Automaton has 414 states and 416 transitions. Word has length 410 [2019-05-23 10:11:15,291 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:11:15,291 INFO L146 ILogger]: Abstraction has 414 states and 416 transitions. [2019-05-23 10:11:15,291 INFO L146 ILogger]: Interpolant automaton has 105 states. [2019-05-23 10:11:15,291 INFO L146 ILogger]: Start isEmpty. Operand 414 states and 416 transitions. [2019-05-23 10:11:15,293 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 414 [2019-05-23 10:11:15,293 INFO L146 ILogger]: Found error trace [2019-05-23 10:11:15,293 INFO L146 ILogger]: trace histogram [51, 51, 51, 51, 51, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:11:15,293 INFO L146 ILogger]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:11:15,293 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:11:15,293 INFO L146 ILogger]: Analyzing trace with hash 332059054, now seen corresponding path program 100 times [2019-05-23 10:11:15,294 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:11:15,334 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:11:15,341 INFO L146 ILogger]: Trace formula consists of 571 conjuncts, 207 conjunts are in the unsatisfiable core [2019-05-23 10:11:15,345 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:11:19,897 INFO L146 ILogger]: Checked inductivity of 10201 backedges. 50 proven. 10151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:11:19,898 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:11:19,898 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-05-23 10:11:19,898 INFO L146 ILogger]: Interpolant automaton has 105 states [2019-05-23 10:11:19,899 INFO L146 ILogger]: Constructing interpolant automaton starting with 105 interpolants. [2019-05-23 10:11:19,899 INFO L146 ILogger]: CoverageRelationStatistics Valid=258, Invalid=10662, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 10:11:19,899 INFO L146 ILogger]: Start difference. First operand 414 states and 416 transitions. Second operand 105 states. [2019-05-23 10:11:34,303 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:11:34,303 INFO L146 ILogger]: Finished difference Result 423 states and 425 transitions. [2019-05-23 10:11:34,304 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-05-23 10:11:34,304 INFO L146 ILogger]: Start accepts. Automaton has 105 states. Word has length 413 [2019-05-23 10:11:34,304 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:11:34,305 INFO L146 ILogger]: With dead ends: 423 [2019-05-23 10:11:34,305 INFO L146 ILogger]: Without dead ends: 423 [2019-05-23 10:11:34,306 INFO L146 ILogger]: 0 DeclaredPredicates, 413 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=262, Invalid=10868, Unknown=0, NotChecked=0, Total=11130 [2019-05-23 10:11:34,306 INFO L146 ILogger]: Start minimizeSevpa. Operand 423 states. [2019-05-23 10:11:34,309 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 423 to 419. [2019-05-23 10:11:34,309 INFO L146 ILogger]: Start removeUnreachable. Operand 419 states. [2019-05-23 10:11:34,309 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 419 states to 419 states and 421 transitions. [2019-05-23 10:11:34,310 INFO L146 ILogger]: Start accepts. Automaton has 419 states and 421 transitions. Word has length 413 [2019-05-23 10:11:34,310 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:11:34,310 INFO L146 ILogger]: Abstraction has 419 states and 421 transitions. [2019-05-23 10:11:34,310 INFO L146 ILogger]: Interpolant automaton has 105 states. [2019-05-23 10:11:34,310 INFO L146 ILogger]: Start isEmpty. Operand 419 states and 421 transitions. [2019-05-23 10:11:34,311 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 419 [2019-05-23 10:11:34,311 INFO L146 ILogger]: Found error trace [2019-05-23 10:11:34,311 INFO L146 ILogger]: trace histogram [52, 52, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:11:34,312 INFO L146 ILogger]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:11:34,312 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:11:34,312 INFO L146 ILogger]: Analyzing trace with hash -197007992, now seen corresponding path program 101 times [2019-05-23 10:11:34,312 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:11:34,346 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:11:34,352 INFO L146 ILogger]: Trace formula consists of 578 conjuncts, 106 conjunts are in the unsatisfiable core [2019-05-23 10:11:34,354 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:11:37,773 INFO L146 ILogger]: Checked inductivity of 10455 backedges. 6579 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:11:37,773 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:11:37,774 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-05-23 10:11:37,774 INFO L146 ILogger]: Interpolant automaton has 107 states [2019-05-23 10:11:37,774 INFO L146 ILogger]: Constructing interpolant automaton starting with 107 interpolants. [2019-05-23 10:11:37,775 INFO L146 ILogger]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 10:11:37,775 INFO L146 ILogger]: Start difference. First operand 419 states and 421 transitions. Second operand 107 states. [2019-05-23 10:11:41,933 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:11:41,933 INFO L146 ILogger]: Finished difference Result 681 states and 683 transitions. [2019-05-23 10:11:41,934 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-05-23 10:11:41,934 INFO L146 ILogger]: Start accepts. Automaton has 107 states. Word has length 418 [2019-05-23 10:11:41,934 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:11:41,935 INFO L146 ILogger]: With dead ends: 681 [2019-05-23 10:11:41,935 INFO L146 ILogger]: Without dead ends: 424 [2019-05-23 10:11:41,937 INFO L146 ILogger]: 0 DeclaredPredicates, 470 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4029 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5883, Invalid=19557, Unknown=0, NotChecked=0, Total=25440 [2019-05-23 10:11:41,937 INFO L146 ILogger]: Start minimizeSevpa. Operand 424 states. [2019-05-23 10:11:41,940 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 424 to 422. [2019-05-23 10:11:41,940 INFO L146 ILogger]: Start removeUnreachable. Operand 422 states. [2019-05-23 10:11:41,941 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 422 states to 422 states and 424 transitions. [2019-05-23 10:11:41,941 INFO L146 ILogger]: Start accepts. Automaton has 422 states and 424 transitions. Word has length 418 [2019-05-23 10:11:41,941 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:11:41,941 INFO L146 ILogger]: Abstraction has 422 states and 424 transitions. [2019-05-23 10:11:41,941 INFO L146 ILogger]: Interpolant automaton has 107 states. [2019-05-23 10:11:41,941 INFO L146 ILogger]: Start isEmpty. Operand 422 states and 424 transitions. [2019-05-23 10:11:41,943 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 422 [2019-05-23 10:11:41,943 INFO L146 ILogger]: Found error trace [2019-05-23 10:11:41,943 INFO L146 ILogger]: trace histogram [52, 52, 52, 52, 52, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:11:41,943 INFO L146 ILogger]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:11:41,944 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:11:41,944 INFO L146 ILogger]: Analyzing trace with hash 1030775659, now seen corresponding path program 102 times [2019-05-23 10:11:41,944 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:11:41,982 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:11:41,987 INFO L146 ILogger]: Trace formula consists of 582 conjuncts, 211 conjunts are in the unsatisfiable core [2019-05-23 10:11:41,989 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:11:46,701 INFO L146 ILogger]: Checked inductivity of 10609 backedges. 51 proven. 10558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:11:46,701 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:11:46,701 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-05-23 10:11:46,702 INFO L146 ILogger]: Interpolant automaton has 107 states [2019-05-23 10:11:46,702 INFO L146 ILogger]: Constructing interpolant automaton starting with 107 interpolants. [2019-05-23 10:11:46,702 INFO L146 ILogger]: CoverageRelationStatistics Valid=263, Invalid=11079, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 10:11:46,703 INFO L146 ILogger]: Start difference. First operand 422 states and 424 transitions. Second operand 107 states. [2019-05-23 10:12:04,143 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:12:04,144 INFO L146 ILogger]: Finished difference Result 431 states and 433 transitions. [2019-05-23 10:12:04,144 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-05-23 10:12:04,144 INFO L146 ILogger]: Start accepts. Automaton has 107 states. Word has length 421 [2019-05-23 10:12:04,145 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:12:04,145 INFO L146 ILogger]: With dead ends: 431 [2019-05-23 10:12:04,145 INFO L146 ILogger]: Without dead ends: 431 [2019-05-23 10:12:04,146 INFO L146 ILogger]: 0 DeclaredPredicates, 421 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=267, Invalid=11289, Unknown=0, NotChecked=0, Total=11556 [2019-05-23 10:12:04,146 INFO L146 ILogger]: Start minimizeSevpa. Operand 431 states. [2019-05-23 10:12:04,149 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 431 to 427. [2019-05-23 10:12:04,149 INFO L146 ILogger]: Start removeUnreachable. Operand 427 states. [2019-05-23 10:12:04,149 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 427 states to 427 states and 429 transitions. [2019-05-23 10:12:04,149 INFO L146 ILogger]: Start accepts. Automaton has 427 states and 429 transitions. Word has length 421 [2019-05-23 10:12:04,150 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:12:04,150 INFO L146 ILogger]: Abstraction has 427 states and 429 transitions. [2019-05-23 10:12:04,150 INFO L146 ILogger]: Interpolant automaton has 107 states. [2019-05-23 10:12:04,150 INFO L146 ILogger]: Start isEmpty. Operand 427 states and 429 transitions. [2019-05-23 10:12:04,152 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 427 [2019-05-23 10:12:04,152 INFO L146 ILogger]: Found error trace [2019-05-23 10:12:04,152 INFO L146 ILogger]: trace histogram [53, 53, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:12:04,152 INFO L146 ILogger]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:12:04,152 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:12:04,152 INFO L146 ILogger]: Analyzing trace with hash -1158487573, now seen corresponding path program 103 times [2019-05-23 10:12:04,153 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:12:04,190 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:12:04,195 INFO L146 ILogger]: Trace formula consists of 589 conjuncts, 108 conjunts are in the unsatisfiable core [2019-05-23 10:12:04,197 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:12:07,719 INFO L146 ILogger]: Checked inductivity of 10868 backedges. 6838 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:12:07,720 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:12:07,720 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-05-23 10:12:07,720 INFO L146 ILogger]: Interpolant automaton has 109 states [2019-05-23 10:12:07,721 INFO L146 ILogger]: Constructing interpolant automaton starting with 109 interpolants. [2019-05-23 10:12:07,722 INFO L146 ILogger]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2019-05-23 10:12:07,722 INFO L146 ILogger]: Start difference. First operand 427 states and 429 transitions. Second operand 109 states. [2019-05-23 10:12:11,392 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:12:11,392 INFO L146 ILogger]: Finished difference Result 694 states and 696 transitions. [2019-05-23 10:12:11,393 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-05-23 10:12:11,393 INFO L146 ILogger]: Start accepts. Automaton has 109 states. Word has length 426 [2019-05-23 10:12:11,393 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:12:11,394 INFO L146 ILogger]: With dead ends: 694 [2019-05-23 10:12:11,394 INFO L146 ILogger]: Without dead ends: 432 [2019-05-23 10:12:11,396 INFO L146 ILogger]: 0 DeclaredPredicates, 479 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6102, Invalid=20304, Unknown=0, NotChecked=0, Total=26406 [2019-05-23 10:12:11,396 INFO L146 ILogger]: Start minimizeSevpa. Operand 432 states. [2019-05-23 10:12:11,399 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 432 to 430. [2019-05-23 10:12:11,399 INFO L146 ILogger]: Start removeUnreachable. Operand 430 states. [2019-05-23 10:12:11,400 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 430 states to 430 states and 432 transitions. [2019-05-23 10:12:11,400 INFO L146 ILogger]: Start accepts. Automaton has 430 states and 432 transitions. Word has length 426 [2019-05-23 10:12:11,400 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:12:11,400 INFO L146 ILogger]: Abstraction has 430 states and 432 transitions. [2019-05-23 10:12:11,400 INFO L146 ILogger]: Interpolant automaton has 109 states. [2019-05-23 10:12:11,400 INFO L146 ILogger]: Start isEmpty. Operand 430 states and 432 transitions. [2019-05-23 10:12:11,402 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 430 [2019-05-23 10:12:11,402 INFO L146 ILogger]: Found error trace [2019-05-23 10:12:11,402 INFO L146 ILogger]: trace histogram [53, 53, 53, 53, 53, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:12:11,402 INFO L146 ILogger]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:12:11,402 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:12:11,403 INFO L146 ILogger]: Analyzing trace with hash -654127922, now seen corresponding path program 104 times [2019-05-23 10:12:11,403 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:12:11,444 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:12:11,450 INFO L146 ILogger]: Trace formula consists of 593 conjuncts, 215 conjunts are in the unsatisfiable core [2019-05-23 10:12:11,452 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:12:16,380 INFO L146 ILogger]: Checked inductivity of 11025 backedges. 52 proven. 10973 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:12:16,380 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:12:16,380 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-05-23 10:12:16,381 INFO L146 ILogger]: Interpolant automaton has 109 states [2019-05-23 10:12:16,381 INFO L146 ILogger]: Constructing interpolant automaton starting with 109 interpolants. [2019-05-23 10:12:16,381 INFO L146 ILogger]: CoverageRelationStatistics Valid=268, Invalid=11504, Unknown=0, NotChecked=0, Total=11772 [2019-05-23 10:12:16,381 INFO L146 ILogger]: Start difference. First operand 430 states and 432 transitions. Second operand 109 states. [2019-05-23 10:12:34,446 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:12:34,447 INFO L146 ILogger]: Finished difference Result 439 states and 441 transitions. [2019-05-23 10:12:34,447 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-05-23 10:12:34,447 INFO L146 ILogger]: Start accepts. Automaton has 109 states. Word has length 429 [2019-05-23 10:12:34,448 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:12:34,448 INFO L146 ILogger]: With dead ends: 439 [2019-05-23 10:12:34,448 INFO L146 ILogger]: Without dead ends: 439 [2019-05-23 10:12:34,449 INFO L146 ILogger]: 0 DeclaredPredicates, 429 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=272, Invalid=11718, Unknown=0, NotChecked=0, Total=11990 [2019-05-23 10:12:34,449 INFO L146 ILogger]: Start minimizeSevpa. Operand 439 states. [2019-05-23 10:12:34,451 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 439 to 435. [2019-05-23 10:12:34,452 INFO L146 ILogger]: Start removeUnreachable. Operand 435 states. [2019-05-23 10:12:34,452 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 435 states to 435 states and 437 transitions. [2019-05-23 10:12:34,452 INFO L146 ILogger]: Start accepts. Automaton has 435 states and 437 transitions. Word has length 429 [2019-05-23 10:12:34,453 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:12:34,453 INFO L146 ILogger]: Abstraction has 435 states and 437 transitions. [2019-05-23 10:12:34,453 INFO L146 ILogger]: Interpolant automaton has 109 states. [2019-05-23 10:12:34,453 INFO L146 ILogger]: Start isEmpty. Operand 435 states and 437 transitions. [2019-05-23 10:12:34,454 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 435 [2019-05-23 10:12:34,454 INFO L146 ILogger]: Found error trace [2019-05-23 10:12:34,454 INFO L146 ILogger]: trace histogram [54, 54, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:12:34,454 INFO L146 ILogger]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:12:34,454 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:12:34,455 INFO L146 ILogger]: Analyzing trace with hash 1617550952, now seen corresponding path program 105 times [2019-05-23 10:12:34,455 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:12:34,497 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:12:34,502 INFO L146 ILogger]: Trace formula consists of 600 conjuncts, 110 conjunts are in the unsatisfiable core [2019-05-23 10:12:34,504 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:12:38,107 INFO L146 ILogger]: Checked inductivity of 11289 backedges. 7102 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:12:38,107 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:12:38,107 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-05-23 10:12:38,108 INFO L146 ILogger]: Interpolant automaton has 111 states [2019-05-23 10:12:38,108 INFO L146 ILogger]: Constructing interpolant automaton starting with 111 interpolants. [2019-05-23 10:12:38,109 INFO L146 ILogger]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 10:12:38,109 INFO L146 ILogger]: Start difference. First operand 435 states and 437 transitions. Second operand 111 states. [2019-05-23 10:12:42,155 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:12:42,156 INFO L146 ILogger]: Finished difference Result 707 states and 709 transitions. [2019-05-23 10:12:42,156 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-05-23 10:12:42,156 INFO L146 ILogger]: Start accepts. Automaton has 111 states. Word has length 434 [2019-05-23 10:12:42,157 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:12:42,157 INFO L146 ILogger]: With dead ends: 707 [2019-05-23 10:12:42,158 INFO L146 ILogger]: Without dead ends: 440 [2019-05-23 10:12:42,159 INFO L146 ILogger]: 0 DeclaredPredicates, 488 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4346 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6325, Invalid=21065, Unknown=0, NotChecked=0, Total=27390 [2019-05-23 10:12:42,160 INFO L146 ILogger]: Start minimizeSevpa. Operand 440 states. [2019-05-23 10:12:42,162 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 440 to 438. [2019-05-23 10:12:42,162 INFO L146 ILogger]: Start removeUnreachable. Operand 438 states. [2019-05-23 10:12:42,162 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 438 states to 438 states and 440 transitions. [2019-05-23 10:12:42,163 INFO L146 ILogger]: Start accepts. Automaton has 438 states and 440 transitions. Word has length 434 [2019-05-23 10:12:42,163 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:12:42,163 INFO L146 ILogger]: Abstraction has 438 states and 440 transitions. [2019-05-23 10:12:42,163 INFO L146 ILogger]: Interpolant automaton has 111 states. [2019-05-23 10:12:42,163 INFO L146 ILogger]: Start isEmpty. Operand 438 states and 440 transitions. [2019-05-23 10:12:42,164 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 438 [2019-05-23 10:12:42,164 INFO L146 ILogger]: Found error trace [2019-05-23 10:12:42,164 INFO L146 ILogger]: trace histogram [54, 54, 54, 54, 54, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:12:42,165 INFO L146 ILogger]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:12:42,165 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:12:42,165 INFO L146 ILogger]: Analyzing trace with hash 94254667, now seen corresponding path program 106 times [2019-05-23 10:12:42,165 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:12:42,201 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:12:42,207 INFO L146 ILogger]: Trace formula consists of 604 conjuncts, 219 conjunts are in the unsatisfiable core [2019-05-23 10:12:42,209 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:12:47,286 INFO L146 ILogger]: Checked inductivity of 11449 backedges. 53 proven. 11396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:12:47,287 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:12:47,287 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-05-23 10:12:47,287 INFO L146 ILogger]: Interpolant automaton has 111 states [2019-05-23 10:12:47,287 INFO L146 ILogger]: Constructing interpolant automaton starting with 111 interpolants. [2019-05-23 10:12:47,288 INFO L146 ILogger]: CoverageRelationStatistics Valid=273, Invalid=11937, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 10:12:47,288 INFO L146 ILogger]: Start difference. First operand 438 states and 440 transitions. Second operand 111 states. [2019-05-23 10:13:07,853 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:13:07,854 INFO L146 ILogger]: Finished difference Result 447 states and 449 transitions. [2019-05-23 10:13:07,854 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-05-23 10:13:07,854 INFO L146 ILogger]: Start accepts. Automaton has 111 states. Word has length 437 [2019-05-23 10:13:07,855 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:13:07,855 INFO L146 ILogger]: With dead ends: 447 [2019-05-23 10:13:07,855 INFO L146 ILogger]: Without dead ends: 447 [2019-05-23 10:13:07,856 INFO L146 ILogger]: 0 DeclaredPredicates, 437 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=277, Invalid=12155, Unknown=0, NotChecked=0, Total=12432 [2019-05-23 10:13:07,856 INFO L146 ILogger]: Start minimizeSevpa. Operand 447 states. [2019-05-23 10:13:07,859 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 447 to 443. [2019-05-23 10:13:07,859 INFO L146 ILogger]: Start removeUnreachable. Operand 443 states. [2019-05-23 10:13:07,860 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 443 states to 443 states and 445 transitions. [2019-05-23 10:13:07,860 INFO L146 ILogger]: Start accepts. Automaton has 443 states and 445 transitions. Word has length 437 [2019-05-23 10:13:07,860 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:13:07,860 INFO L146 ILogger]: Abstraction has 443 states and 445 transitions. [2019-05-23 10:13:07,860 INFO L146 ILogger]: Interpolant automaton has 111 states. [2019-05-23 10:13:07,860 INFO L146 ILogger]: Start isEmpty. Operand 443 states and 445 transitions. [2019-05-23 10:13:07,861 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 443 [2019-05-23 10:13:07,861 INFO L146 ILogger]: Found error trace [2019-05-23 10:13:07,862 INFO L146 ILogger]: trace histogram [55, 55, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:13:07,862 INFO L146 ILogger]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:13:07,862 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:13:07,862 INFO L146 ILogger]: Analyzing trace with hash -556410101, now seen corresponding path program 107 times [2019-05-23 10:13:07,863 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:13:07,900 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:13:07,905 INFO L146 ILogger]: Trace formula consists of 611 conjuncts, 112 conjunts are in the unsatisfiable core [2019-05-23 10:13:07,907 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:13:11,629 INFO L146 ILogger]: Checked inductivity of 11718 backedges. 7371 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:13:11,630 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:13:11,630 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-05-23 10:13:11,630 INFO L146 ILogger]: Interpolant automaton has 113 states [2019-05-23 10:13:11,631 INFO L146 ILogger]: Constructing interpolant automaton starting with 113 interpolants. [2019-05-23 10:13:11,631 INFO L146 ILogger]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2019-05-23 10:13:11,631 INFO L146 ILogger]: Start difference. First operand 443 states and 445 transitions. Second operand 113 states. [2019-05-23 10:13:17,082 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:13:17,082 INFO L146 ILogger]: Finished difference Result 720 states and 722 transitions. [2019-05-23 10:13:17,083 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-05-23 10:13:17,083 INFO L146 ILogger]: Start accepts. Automaton has 113 states. Word has length 442 [2019-05-23 10:13:17,083 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:13:17,084 INFO L146 ILogger]: With dead ends: 720 [2019-05-23 10:13:17,084 INFO L146 ILogger]: Without dead ends: 448 [2019-05-23 10:13:17,085 INFO L146 ILogger]: 0 DeclaredPredicates, 497 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4509 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=6552, Invalid=21840, Unknown=0, NotChecked=0, Total=28392 [2019-05-23 10:13:17,086 INFO L146 ILogger]: Start minimizeSevpa. Operand 448 states. [2019-05-23 10:13:17,088 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 448 to 446. [2019-05-23 10:13:17,088 INFO L146 ILogger]: Start removeUnreachable. Operand 446 states. [2019-05-23 10:13:17,088 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 446 states to 446 states and 448 transitions. [2019-05-23 10:13:17,089 INFO L146 ILogger]: Start accepts. Automaton has 446 states and 448 transitions. Word has length 442 [2019-05-23 10:13:17,089 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:13:17,089 INFO L146 ILogger]: Abstraction has 446 states and 448 transitions. [2019-05-23 10:13:17,089 INFO L146 ILogger]: Interpolant automaton has 113 states. [2019-05-23 10:13:17,089 INFO L146 ILogger]: Start isEmpty. Operand 446 states and 448 transitions. [2019-05-23 10:13:17,090 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 446 [2019-05-23 10:13:17,090 INFO L146 ILogger]: Found error trace [2019-05-23 10:13:17,090 INFO L146 ILogger]: trace histogram [55, 55, 55, 55, 55, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:13:17,090 INFO L146 ILogger]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:13:17,091 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:13:17,091 INFO L146 ILogger]: Analyzing trace with hash -898523154, now seen corresponding path program 108 times [2019-05-23 10:13:17,091 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:13:17,128 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:13:17,136 INFO L146 ILogger]: Trace formula consists of 615 conjuncts, 223 conjunts are in the unsatisfiable core [2019-05-23 10:13:17,138 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:13:22,365 INFO L146 ILogger]: Checked inductivity of 11881 backedges. 54 proven. 11827 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:13:22,366 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:13:22,366 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-05-23 10:13:22,366 INFO L146 ILogger]: Interpolant automaton has 113 states [2019-05-23 10:13:22,366 INFO L146 ILogger]: Constructing interpolant automaton starting with 113 interpolants. [2019-05-23 10:13:22,367 INFO L146 ILogger]: CoverageRelationStatistics Valid=278, Invalid=12378, Unknown=0, NotChecked=0, Total=12656 [2019-05-23 10:13:22,367 INFO L146 ILogger]: Start difference. First operand 446 states and 448 transitions. Second operand 113 states. [2019-05-23 10:13:41,394 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:13:41,394 INFO L146 ILogger]: Finished difference Result 455 states and 457 transitions. [2019-05-23 10:13:41,394 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-05-23 10:13:41,394 INFO L146 ILogger]: Start accepts. Automaton has 113 states. Word has length 445 [2019-05-23 10:13:41,395 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:13:41,396 INFO L146 ILogger]: With dead ends: 455 [2019-05-23 10:13:41,396 INFO L146 ILogger]: Without dead ends: 455 [2019-05-23 10:13:41,396 INFO L146 ILogger]: 0 DeclaredPredicates, 445 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=282, Invalid=12600, Unknown=0, NotChecked=0, Total=12882 [2019-05-23 10:13:41,397 INFO L146 ILogger]: Start minimizeSevpa. Operand 455 states. [2019-05-23 10:13:41,399 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 455 to 451. [2019-05-23 10:13:41,399 INFO L146 ILogger]: Start removeUnreachable. Operand 451 states. [2019-05-23 10:13:41,400 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 451 states to 451 states and 453 transitions. [2019-05-23 10:13:41,400 INFO L146 ILogger]: Start accepts. Automaton has 451 states and 453 transitions. Word has length 445 [2019-05-23 10:13:41,400 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:13:41,400 INFO L146 ILogger]: Abstraction has 451 states and 453 transitions. [2019-05-23 10:13:41,400 INFO L146 ILogger]: Interpolant automaton has 113 states. [2019-05-23 10:13:41,400 INFO L146 ILogger]: Start isEmpty. Operand 451 states and 453 transitions. [2019-05-23 10:13:41,402 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 451 [2019-05-23 10:13:41,402 INFO L146 ILogger]: Found error trace [2019-05-23 10:13:41,402 INFO L146 ILogger]: trace histogram [56, 56, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:13:41,402 INFO L146 ILogger]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:13:41,402 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:13:41,402 INFO L146 ILogger]: Analyzing trace with hash 1759641416, now seen corresponding path program 109 times [2019-05-23 10:13:41,403 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:13:41,442 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:13:41,448 INFO L146 ILogger]: Trace formula consists of 622 conjuncts, 114 conjunts are in the unsatisfiable core [2019-05-23 10:13:41,451 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:13:45,331 INFO L146 ILogger]: Checked inductivity of 12155 backedges. 7645 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:13:45,331 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:13:45,332 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-05-23 10:13:45,332 INFO L146 ILogger]: Interpolant automaton has 115 states [2019-05-23 10:13:45,333 INFO L146 ILogger]: Constructing interpolant automaton starting with 115 interpolants. [2019-05-23 10:13:45,333 INFO L146 ILogger]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 10:13:45,333 INFO L146 ILogger]: Start difference. First operand 451 states and 453 transitions. Second operand 115 states. [2019-05-23 10:13:50,596 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:13:50,596 INFO L146 ILogger]: Finished difference Result 733 states and 735 transitions. [2019-05-23 10:13:50,596 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-05-23 10:13:50,596 INFO L146 ILogger]: Start accepts. Automaton has 115 states. Word has length 450 [2019-05-23 10:13:50,597 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:13:50,597 INFO L146 ILogger]: With dead ends: 733 [2019-05-23 10:13:50,597 INFO L146 ILogger]: Without dead ends: 456 [2019-05-23 10:13:50,599 INFO L146 ILogger]: 0 DeclaredPredicates, 506 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4675 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=6783, Invalid=22629, Unknown=0, NotChecked=0, Total=29412 [2019-05-23 10:13:50,599 INFO L146 ILogger]: Start minimizeSevpa. Operand 456 states. [2019-05-23 10:13:50,601 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 456 to 454. [2019-05-23 10:13:50,601 INFO L146 ILogger]: Start removeUnreachable. Operand 454 states. [2019-05-23 10:13:50,602 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 454 states to 454 states and 456 transitions. [2019-05-23 10:13:50,602 INFO L146 ILogger]: Start accepts. Automaton has 454 states and 456 transitions. Word has length 450 [2019-05-23 10:13:50,602 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:13:50,602 INFO L146 ILogger]: Abstraction has 454 states and 456 transitions. [2019-05-23 10:13:50,602 INFO L146 ILogger]: Interpolant automaton has 115 states. [2019-05-23 10:13:50,602 INFO L146 ILogger]: Start isEmpty. Operand 454 states and 456 transitions. [2019-05-23 10:13:50,603 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 454 [2019-05-23 10:13:50,604 INFO L146 ILogger]: Found error trace [2019-05-23 10:13:50,604 INFO L146 ILogger]: trace histogram [56, 56, 56, 56, 56, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:13:50,604 INFO L146 ILogger]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:13:50,604 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:13:50,604 INFO L146 ILogger]: Analyzing trace with hash 1730687275, now seen corresponding path program 110 times [2019-05-23 10:13:50,605 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:13:50,644 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:13:50,651 INFO L146 ILogger]: Trace formula consists of 626 conjuncts, 227 conjunts are in the unsatisfiable core [2019-05-23 10:13:50,653 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:13:56,146 INFO L146 ILogger]: Checked inductivity of 12321 backedges. 55 proven. 12266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:13:56,147 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:13:56,147 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-05-23 10:13:56,147 INFO L146 ILogger]: Interpolant automaton has 115 states [2019-05-23 10:13:56,147 INFO L146 ILogger]: Constructing interpolant automaton starting with 115 interpolants. [2019-05-23 10:13:56,148 INFO L146 ILogger]: CoverageRelationStatistics Valid=283, Invalid=12827, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 10:13:56,148 INFO L146 ILogger]: Start difference. First operand 454 states and 456 transitions. Second operand 115 states. [2019-05-23 10:14:16,294 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:14:16,294 INFO L146 ILogger]: Finished difference Result 463 states and 465 transitions. [2019-05-23 10:14:16,294 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-05-23 10:14:16,294 INFO L146 ILogger]: Start accepts. Automaton has 115 states. Word has length 453 [2019-05-23 10:14:16,295 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:14:16,296 INFO L146 ILogger]: With dead ends: 463 [2019-05-23 10:14:16,296 INFO L146 ILogger]: Without dead ends: 463 [2019-05-23 10:14:16,296 INFO L146 ILogger]: 0 DeclaredPredicates, 453 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=287, Invalid=13053, Unknown=0, NotChecked=0, Total=13340 [2019-05-23 10:14:16,297 INFO L146 ILogger]: Start minimizeSevpa. Operand 463 states. [2019-05-23 10:14:16,299 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 463 to 459. [2019-05-23 10:14:16,299 INFO L146 ILogger]: Start removeUnreachable. Operand 459 states. [2019-05-23 10:14:16,300 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 459 states to 459 states and 461 transitions. [2019-05-23 10:14:16,300 INFO L146 ILogger]: Start accepts. Automaton has 459 states and 461 transitions. Word has length 453 [2019-05-23 10:14:16,301 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:14:16,301 INFO L146 ILogger]: Abstraction has 459 states and 461 transitions. [2019-05-23 10:14:16,301 INFO L146 ILogger]: Interpolant automaton has 115 states. [2019-05-23 10:14:16,301 INFO L146 ILogger]: Start isEmpty. Operand 459 states and 461 transitions. [2019-05-23 10:14:16,303 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 459 [2019-05-23 10:14:16,303 INFO L146 ILogger]: Found error trace [2019-05-23 10:14:16,303 INFO L146 ILogger]: trace histogram [57, 57, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:14:16,303 INFO L146 ILogger]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:14:16,303 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:14:16,304 INFO L146 ILogger]: Analyzing trace with hash 615885867, now seen corresponding path program 111 times [2019-05-23 10:14:16,304 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:14:16,348 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:14:16,354 INFO L146 ILogger]: Trace formula consists of 633 conjuncts, 116 conjunts are in the unsatisfiable core [2019-05-23 10:14:16,356 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:14:20,361 INFO L146 ILogger]: Checked inductivity of 12600 backedges. 7924 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:14:20,361 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:14:20,361 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-05-23 10:14:20,361 INFO L146 ILogger]: Interpolant automaton has 117 states [2019-05-23 10:14:20,362 INFO L146 ILogger]: Constructing interpolant automaton starting with 117 interpolants. [2019-05-23 10:14:20,363 INFO L146 ILogger]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2019-05-23 10:14:20,363 INFO L146 ILogger]: Start difference. First operand 459 states and 461 transitions. Second operand 117 states. [2019-05-23 10:14:26,320 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:14:26,321 INFO L146 ILogger]: Finished difference Result 746 states and 748 transitions. [2019-05-23 10:14:26,321 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-05-23 10:14:26,321 INFO L146 ILogger]: Start accepts. Automaton has 117 states. Word has length 458 [2019-05-23 10:14:26,322 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:14:26,322 INFO L146 ILogger]: With dead ends: 746 [2019-05-23 10:14:26,322 INFO L146 ILogger]: Without dead ends: 464 [2019-05-23 10:14:26,324 INFO L146 ILogger]: 0 DeclaredPredicates, 515 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4844 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=7018, Invalid=23432, Unknown=0, NotChecked=0, Total=30450 [2019-05-23 10:14:26,325 INFO L146 ILogger]: Start minimizeSevpa. Operand 464 states. [2019-05-23 10:14:26,327 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 464 to 462. [2019-05-23 10:14:26,327 INFO L146 ILogger]: Start removeUnreachable. Operand 462 states. [2019-05-23 10:14:26,327 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 462 states to 462 states and 464 transitions. [2019-05-23 10:14:26,327 INFO L146 ILogger]: Start accepts. Automaton has 462 states and 464 transitions. Word has length 458 [2019-05-23 10:14:26,327 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:14:26,327 INFO L146 ILogger]: Abstraction has 462 states and 464 transitions. [2019-05-23 10:14:26,328 INFO L146 ILogger]: Interpolant automaton has 117 states. [2019-05-23 10:14:26,328 INFO L146 ILogger]: Start isEmpty. Operand 462 states and 464 transitions. [2019-05-23 10:14:26,329 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 462 [2019-05-23 10:14:26,329 INFO L146 ILogger]: Found error trace [2019-05-23 10:14:26,329 INFO L146 ILogger]: trace histogram [57, 57, 57, 57, 57, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:14:26,329 INFO L146 ILogger]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:14:26,329 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:14:26,330 INFO L146 ILogger]: Analyzing trace with hash 250170126, now seen corresponding path program 112 times [2019-05-23 10:14:26,330 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:14:26,370 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:14:26,381 INFO L146 ILogger]: Trace formula consists of 637 conjuncts, 231 conjunts are in the unsatisfiable core [2019-05-23 10:14:26,384 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:14:32,047 INFO L146 ILogger]: Checked inductivity of 12769 backedges. 56 proven. 12713 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:14:32,047 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:14:32,047 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-05-23 10:14:32,047 INFO L146 ILogger]: Interpolant automaton has 117 states [2019-05-23 10:14:32,048 INFO L146 ILogger]: Constructing interpolant automaton starting with 117 interpolants. [2019-05-23 10:14:32,048 INFO L146 ILogger]: CoverageRelationStatistics Valid=288, Invalid=13284, Unknown=0, NotChecked=0, Total=13572 [2019-05-23 10:14:32,048 INFO L146 ILogger]: Start difference. First operand 462 states and 464 transitions. Second operand 117 states. [2019-05-23 10:14:55,430 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:14:55,430 INFO L146 ILogger]: Finished difference Result 471 states and 473 transitions. [2019-05-23 10:14:55,430 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-05-23 10:14:55,430 INFO L146 ILogger]: Start accepts. Automaton has 117 states. Word has length 461 [2019-05-23 10:14:55,431 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:14:55,432 INFO L146 ILogger]: With dead ends: 471 [2019-05-23 10:14:55,432 INFO L146 ILogger]: Without dead ends: 471 [2019-05-23 10:14:55,433 INFO L146 ILogger]: 0 DeclaredPredicates, 461 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=292, Invalid=13514, Unknown=0, NotChecked=0, Total=13806 [2019-05-23 10:14:55,433 INFO L146 ILogger]: Start minimizeSevpa. Operand 471 states. [2019-05-23 10:14:55,435 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 471 to 467. [2019-05-23 10:14:55,435 INFO L146 ILogger]: Start removeUnreachable. Operand 467 states. [2019-05-23 10:14:55,435 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 467 states to 467 states and 469 transitions. [2019-05-23 10:14:55,435 INFO L146 ILogger]: Start accepts. Automaton has 467 states and 469 transitions. Word has length 461 [2019-05-23 10:14:55,436 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:14:55,436 INFO L146 ILogger]: Abstraction has 467 states and 469 transitions. [2019-05-23 10:14:55,436 INFO L146 ILogger]: Interpolant automaton has 117 states. [2019-05-23 10:14:55,436 INFO L146 ILogger]: Start isEmpty. Operand 467 states and 469 transitions. [2019-05-23 10:14:55,437 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 467 [2019-05-23 10:14:55,437 INFO L146 ILogger]: Found error trace [2019-05-23 10:14:55,437 INFO L146 ILogger]: trace histogram [58, 58, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:14:55,437 INFO L146 ILogger]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:14:55,438 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:14:55,438 INFO L146 ILogger]: Analyzing trace with hash 1511540776, now seen corresponding path program 113 times [2019-05-23 10:14:55,438 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:14:55,499 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:14:55,509 INFO L146 ILogger]: Trace formula consists of 644 conjuncts, 118 conjunts are in the unsatisfiable core [2019-05-23 10:14:55,512 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:14:59,678 INFO L146 ILogger]: Checked inductivity of 13053 backedges. 8208 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:14:59,678 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:14:59,678 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-05-23 10:14:59,678 INFO L146 ILogger]: Interpolant automaton has 119 states [2019-05-23 10:14:59,679 INFO L146 ILogger]: Constructing interpolant automaton starting with 119 interpolants. [2019-05-23 10:14:59,680 INFO L146 ILogger]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 10:14:59,680 INFO L146 ILogger]: Start difference. First operand 467 states and 469 transitions. Second operand 119 states. [2019-05-23 10:15:04,369 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:15:04,369 INFO L146 ILogger]: Finished difference Result 759 states and 761 transitions. [2019-05-23 10:15:04,370 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-05-23 10:15:04,370 INFO L146 ILogger]: Start accepts. Automaton has 119 states. Word has length 466 [2019-05-23 10:15:04,370 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:15:04,371 INFO L146 ILogger]: With dead ends: 759 [2019-05-23 10:15:04,371 INFO L146 ILogger]: Without dead ends: 472 [2019-05-23 10:15:04,373 INFO L146 ILogger]: 0 DeclaredPredicates, 524 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=7257, Invalid=24249, Unknown=0, NotChecked=0, Total=31506 [2019-05-23 10:15:04,373 INFO L146 ILogger]: Start minimizeSevpa. Operand 472 states. [2019-05-23 10:15:04,375 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 472 to 470. [2019-05-23 10:15:04,375 INFO L146 ILogger]: Start removeUnreachable. Operand 470 states. [2019-05-23 10:15:04,376 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 470 states to 470 states and 472 transitions. [2019-05-23 10:15:04,376 INFO L146 ILogger]: Start accepts. Automaton has 470 states and 472 transitions. Word has length 466 [2019-05-23 10:15:04,376 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:15:04,376 INFO L146 ILogger]: Abstraction has 470 states and 472 transitions. [2019-05-23 10:15:04,376 INFO L146 ILogger]: Interpolant automaton has 119 states. [2019-05-23 10:15:04,376 INFO L146 ILogger]: Start isEmpty. Operand 470 states and 472 transitions. [2019-05-23 10:15:04,378 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 470 [2019-05-23 10:15:04,378 INFO L146 ILogger]: Found error trace [2019-05-23 10:15:04,378 INFO L146 ILogger]: trace histogram [58, 58, 58, 58, 58, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:15:04,378 INFO L146 ILogger]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:15:04,378 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:15:04,378 INFO L146 ILogger]: Analyzing trace with hash 377246731, now seen corresponding path program 114 times [2019-05-23 10:15:04,379 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:15:04,421 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:15:04,428 INFO L146 ILogger]: Trace formula consists of 648 conjuncts, 235 conjunts are in the unsatisfiable core [2019-05-23 10:15:04,430 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:15:10,283 INFO L146 ILogger]: Checked inductivity of 13225 backedges. 57 proven. 13168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:15:10,283 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:15:10,283 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-05-23 10:15:10,284 INFO L146 ILogger]: Interpolant automaton has 119 states [2019-05-23 10:15:10,284 INFO L146 ILogger]: Constructing interpolant automaton starting with 119 interpolants. [2019-05-23 10:15:10,284 INFO L146 ILogger]: CoverageRelationStatistics Valid=293, Invalid=13749, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 10:15:10,284 INFO L146 ILogger]: Start difference. First operand 470 states and 472 transitions. Second operand 119 states. [2019-05-23 10:15:32,755 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:15:32,756 INFO L146 ILogger]: Finished difference Result 479 states and 481 transitions. [2019-05-23 10:15:32,756 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-05-23 10:15:32,756 INFO L146 ILogger]: Start accepts. Automaton has 119 states. Word has length 469 [2019-05-23 10:15:32,757 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:15:32,757 INFO L146 ILogger]: With dead ends: 479 [2019-05-23 10:15:32,757 INFO L146 ILogger]: Without dead ends: 479 [2019-05-23 10:15:32,758 INFO L146 ILogger]: 0 DeclaredPredicates, 469 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=297, Invalid=13983, Unknown=0, NotChecked=0, Total=14280 [2019-05-23 10:15:32,758 INFO L146 ILogger]: Start minimizeSevpa. Operand 479 states. [2019-05-23 10:15:32,761 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 479 to 475. [2019-05-23 10:15:32,761 INFO L146 ILogger]: Start removeUnreachable. Operand 475 states. [2019-05-23 10:15:32,761 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 475 states to 475 states and 477 transitions. [2019-05-23 10:15:32,761 INFO L146 ILogger]: Start accepts. Automaton has 475 states and 477 transitions. Word has length 469 [2019-05-23 10:15:32,762 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:15:32,762 INFO L146 ILogger]: Abstraction has 475 states and 477 transitions. [2019-05-23 10:15:32,762 INFO L146 ILogger]: Interpolant automaton has 119 states. [2019-05-23 10:15:32,762 INFO L146 ILogger]: Start isEmpty. Operand 475 states and 477 transitions. [2019-05-23 10:15:32,763 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 475 [2019-05-23 10:15:32,763 INFO L146 ILogger]: Found error trace [2019-05-23 10:15:32,763 INFO L146 ILogger]: trace histogram [59, 59, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:15:32,764 INFO L146 ILogger]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:15:32,764 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:15:32,764 INFO L146 ILogger]: Analyzing trace with hash 1826903371, now seen corresponding path program 115 times [2019-05-23 10:15:32,764 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:15:32,815 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:15:32,822 INFO L146 ILogger]: Trace formula consists of 655 conjuncts, 120 conjunts are in the unsatisfiable core [2019-05-23 10:15:32,824 INFO L146 ILogger]: Computing forward predicates...