java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --rcfgbuilder.command.for.external.solver 'z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000' -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --rcfgbuilder.size.of.a.code.block SingleStatement -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-7aa59a0 [2019-05-23 09:21:57,343 INFO L146 ILogger]: Resetting all preferences to default values... [2019-05-23 09:21:57,345 INFO L146 ILogger]: Resetting UltimateCore preferences to default values [2019-05-23 09:21:57,362 INFO L146 ILogger]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-23 09:21:57,362 INFO L146 ILogger]: Resetting Boogie Preprocessor preferences to default values [2019-05-23 09:21:57,363 INFO L146 ILogger]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-23 09:21:57,367 INFO L146 ILogger]: Resetting Abstract Interpretation preferences to default values [2019-05-23 09:21:57,370 INFO L146 ILogger]: Resetting LassoRanker preferences to default values [2019-05-23 09:21:57,372 INFO L146 ILogger]: Resetting Reaching Definitions preferences to default values [2019-05-23 09:21:57,373 INFO L146 ILogger]: Resetting SyntaxChecker preferences to default values [2019-05-23 09:21:57,383 INFO L146 ILogger]: Büchi Program Product provides no preferences, ignoring... [2019-05-23 09:21:57,383 INFO L146 ILogger]: Resetting LTL2Aut preferences to default values [2019-05-23 09:21:57,384 INFO L146 ILogger]: Resetting PEA to Boogie preferences to default values [2019-05-23 09:21:57,385 INFO L146 ILogger]: Resetting BlockEncodingV2 preferences to default values [2019-05-23 09:21:57,386 INFO L146 ILogger]: Resetting ChcToBoogie preferences to default values [2019-05-23 09:21:57,387 INFO L146 ILogger]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-23 09:21:57,388 INFO L146 ILogger]: Resetting BuchiAutomizer preferences to default values [2019-05-23 09:21:57,390 INFO L146 ILogger]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-23 09:21:57,392 INFO L146 ILogger]: Resetting CodeCheck preferences to default values [2019-05-23 09:21:57,394 INFO L146 ILogger]: Resetting InvariantSynthesis preferences to default values [2019-05-23 09:21:57,395 INFO L146 ILogger]: Resetting RCFGBuilder preferences to default values [2019-05-23 09:21:57,396 INFO L146 ILogger]: Resetting TraceAbstraction preferences to default values [2019-05-23 09:21:57,398 INFO L146 ILogger]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-23 09:21:57,398 INFO L146 ILogger]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-23 09:21:57,399 INFO L146 ILogger]: Resetting TreeAutomizer preferences to default values [2019-05-23 09:21:57,400 INFO L146 ILogger]: Resetting IcfgToChc preferences to default values [2019-05-23 09:21:57,400 INFO L146 ILogger]: Resetting IcfgTransformer preferences to default values [2019-05-23 09:21:57,401 INFO L146 ILogger]: ReqToTest provides no preferences, ignoring... [2019-05-23 09:21:57,401 INFO L146 ILogger]: Resetting Boogie Printer preferences to default values [2019-05-23 09:21:57,402 INFO L146 ILogger]: Resetting ChcSmtPrinter preferences to default values [2019-05-23 09:21:57,405 INFO L146 ILogger]: Resetting ReqPrinter preferences to default values [2019-05-23 09:21:57,406 INFO L146 ILogger]: Resetting Witness Printer preferences to default values [2019-05-23 09:21:57,407 INFO L146 ILogger]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-23 09:21:57,410 INFO L146 ILogger]: Resetting CDTParser preferences to default values [2019-05-23 09:21:57,411 INFO L146 ILogger]: AutomataScriptParser provides no preferences, ignoring... [2019-05-23 09:21:57,411 INFO L146 ILogger]: ReqParser provides no preferences, ignoring... [2019-05-23 09:21:57,411 INFO L146 ILogger]: Resetting SmtParser preferences to default values [2019-05-23 09:21:57,412 INFO L146 ILogger]: Resetting Witness Parser preferences to default values [2019-05-23 09:21:57,416 INFO L146 ILogger]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Command for external solver -> z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-23 09:21:57,476 INFO L146 ILogger]: Repository-Root is: /tmp [2019-05-23 09:21:57,493 INFO L146 ILogger]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-23 09:21:57,499 INFO L146 ILogger]: [Toolchain 1]: Toolchain selected. [2019-05-23 09:21:57,501 INFO L146 ILogger]: Initializing Boogie PL CUP Parser... [2019-05-23 09:21:57,502 INFO L146 ILogger]: Boogie PL CUP Parser initialized [2019-05-23 09:21:57,503 INFO L146 ILogger]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl [2019-05-23 09:21:57,503 INFO L146 ILogger]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2019-05-23 09:21:57,547 INFO L146 ILogger]: ####################### [Toolchain 1] ####################### [2019-05-23 09:21:57,549 INFO L146 ILogger]: Walking toolchain with 4 elements. [2019-05-23 09:21:57,550 INFO L146 ILogger]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-23 09:21:57,550 INFO L146 ILogger]: Initializing Boogie Procedure Inliner... [2019-05-23 09:21:57,550 INFO L146 ILogger]: Boogie Procedure Inliner initialized [2019-05-23 09:21:57,568 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,584 INFO L146 ILogger]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,594 INFO L146 ILogger]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-23 09:21:57,595 INFO L146 ILogger]: ------------------------Boogie Preprocessor---------------------------- [2019-05-23 09:21:57,595 INFO L146 ILogger]: Initializing Boogie Preprocessor... [2019-05-23 09:21:57,595 INFO L146 ILogger]: Boogie Preprocessor initialized [2019-05-23 09:21:57,607 INFO L146 ILogger]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,607 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,608 INFO L146 ILogger]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,609 INFO L146 ILogger]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,612 INFO L146 ILogger]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,615 INFO L146 ILogger]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,615 INFO L146 ILogger]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,618 INFO L146 ILogger]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-23 09:21:57,618 INFO L146 ILogger]: ------------------------RCFGBuilder---------------------------- [2019-05-23 09:21:57,618 INFO L146 ILogger]: Initializing RCFGBuilder... [2019-05-23 09:21:57,620 INFO L146 ILogger]: RCFGBuilder initialized [2019-05-23 09:21:57,621 INFO L146 ILogger]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 [2019-05-23 09:21:57,695 INFO L146 ILogger]: Found specification of procedure ULTIMATE.start [2019-05-23 09:21:57,695 INFO L146 ILogger]: Found implementation of procedure ULTIMATE.start [2019-05-23 09:21:57,920 INFO L146 ILogger]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-23 09:21:57,921 INFO L146 ILogger]: Removed 1 assume(true) statements. [2019-05-23 09:21:57,923 INFO L146 ILogger]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:21:57 BoogieIcfgContainer [2019-05-23 09:21:57,923 INFO L146 ILogger]: ------------------------ END RCFGBuilder---------------------------- [2019-05-23 09:21:57,926 INFO L146 ILogger]: ------------------------TraceAbstraction---------------------------- [2019-05-23 09:21:57,926 INFO L146 ILogger]: Initializing TraceAbstraction... [2019-05-23 09:21:57,930 INFO L146 ILogger]: TraceAbstraction initialized [2019-05-23 09:21:57,930 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/2) ... [2019-05-23 09:21:57,931 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47967bd4 and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.05 09:21:57, skipping insertion in model container [2019-05-23 09:21:57,932 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:21:57" (2/2) ... [2019-05-23 09:21:57,935 INFO L146 ILogger]: Analyzing ICFG array2.i_3.bpl [2019-05-23 09:21:57,948 INFO L146 ILogger]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-23 09:21:57,962 INFO L146 ILogger]: Appying trace abstraction to program that has 1 error locations. [2019-05-23 09:21:58,001 INFO L146 ILogger]: Starting to check reachability of 1 error locations. [2019-05-23 09:21:58,036 INFO L146 ILogger]: Using default assertion order modulation [2019-05-23 09:21:58,037 INFO L146 ILogger]: Interprodecural is true [2019-05-23 09:21:58,038 INFO L146 ILogger]: Hoare is false [2019-05-23 09:21:58,038 INFO L146 ILogger]: Compute interpolants for ForwardPredicates [2019-05-23 09:21:58,038 INFO L146 ILogger]: Backedges is STRAIGHT_LINE [2019-05-23 09:21:58,038 INFO L146 ILogger]: Determinization is PREDICATE_ABSTRACTION [2019-05-23 09:21:58,038 INFO L146 ILogger]: Difference is false [2019-05-23 09:21:58,039 INFO L146 ILogger]: Minimize is MINIMIZE_SEVPA [2019-05-23 09:21:58,039 INFO L146 ILogger]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-23 09:21:58,055 INFO L146 ILogger]: Start isEmpty. Operand 22 states. [2019-05-23 09:21:58,064 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 15 [2019-05-23 09:21:58,065 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:58,066 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:58,068 INFO L146 ILogger]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:58,074 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:58,075 INFO L146 ILogger]: Analyzing trace with hash -1756410668, now seen corresponding path program 1 times [2019-05-23 09:21:58,127 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:58,168 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:58,171 INFO L146 ILogger]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,176 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,237 INFO L146 ILogger]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:21:58,240 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:21:58,241 INFO L146 ILogger]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-23 09:21:58,245 INFO L146 ILogger]: Interpolant automaton has 3 states [2019-05-23 09:21:58,259 INFO L146 ILogger]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-23 09:21:58,260 INFO L146 ILogger]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 09:21:58,263 INFO L146 ILogger]: Start difference. First operand 22 states. Second operand 3 states. [2019-05-23 09:21:58,352 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:58,353 INFO L146 ILogger]: Finished difference Result 25 states and 25 transitions. [2019-05-23 09:21:58,353 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-23 09:21:58,355 INFO L146 ILogger]: Start accepts. Automaton has 3 states. Word has length 14 [2019-05-23 09:21:58,355 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:58,366 INFO L146 ILogger]: With dead ends: 25 [2019-05-23 09:21:58,367 INFO L146 ILogger]: Without dead ends: 25 [2019-05-23 09:21:58,369 INFO L146 ILogger]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 09:21:58,383 INFO L146 ILogger]: Start minimizeSevpa. Operand 25 states. [2019-05-23 09:21:58,396 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-05-23 09:21:58,398 INFO L146 ILogger]: Start removeUnreachable. Operand 21 states. [2019-05-23 09:21:58,399 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-05-23 09:21:58,400 INFO L146 ILogger]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2019-05-23 09:21:58,400 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:58,401 INFO L146 ILogger]: Abstraction has 21 states and 21 transitions. [2019-05-23 09:21:58,401 INFO L146 ILogger]: Interpolant automaton has 3 states. [2019-05-23 09:21:58,401 INFO L146 ILogger]: Start isEmpty. Operand 21 states and 21 transitions. [2019-05-23 09:21:58,402 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 21 [2019-05-23 09:21:58,402 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:58,402 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:58,403 INFO L146 ILogger]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:58,403 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:58,403 INFO L146 ILogger]: Analyzing trace with hash 1504379441, now seen corresponding path program 1 times [2019-05-23 09:21:58,405 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:58,421 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:58,423 INFO L146 ILogger]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,425 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,492 INFO L146 ILogger]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:21:58,492 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:58,492 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-23 09:21:58,494 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 09:21:58,495 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 09:21:58,495 INFO L146 ILogger]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:21:58,495 INFO L146 ILogger]: Start difference. First operand 21 states and 21 transitions. Second operand 5 states. [2019-05-23 09:21:58,651 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:58,652 INFO L146 ILogger]: Finished difference Result 31 states and 31 transitions. [2019-05-23 09:21:58,652 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 09:21:58,652 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 20 [2019-05-23 09:21:58,653 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:58,654 INFO L146 ILogger]: With dead ends: 31 [2019-05-23 09:21:58,654 INFO L146 ILogger]: Without dead ends: 31 [2019-05-23 09:21:58,656 INFO L146 ILogger]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:21:58,657 INFO L146 ILogger]: Start minimizeSevpa. Operand 31 states. [2019-05-23 09:21:58,660 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-05-23 09:21:58,660 INFO L146 ILogger]: Start removeUnreachable. Operand 27 states. [2019-05-23 09:21:58,661 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-05-23 09:21:58,661 INFO L146 ILogger]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2019-05-23 09:21:58,662 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:58,662 INFO L146 ILogger]: Abstraction has 27 states and 27 transitions. [2019-05-23 09:21:58,662 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 09:21:58,662 INFO L146 ILogger]: Start isEmpty. Operand 27 states and 27 transitions. [2019-05-23 09:21:58,663 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 27 [2019-05-23 09:21:58,663 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:58,664 INFO L146 ILogger]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:58,664 INFO L146 ILogger]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:58,664 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:58,665 INFO L146 ILogger]: Analyzing trace with hash -1420919346, now seen corresponding path program 2 times [2019-05-23 09:21:58,666 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:58,685 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:58,688 INFO L146 ILogger]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,692 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,984 INFO L146 ILogger]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:21:58,985 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:58,985 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 09:21:58,985 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 09:21:58,986 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 09:21:58,986 INFO L146 ILogger]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:21:58,986 INFO L146 ILogger]: Start difference. First operand 27 states and 27 transitions. Second operand 7 states. [2019-05-23 09:21:59,199 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:59,200 INFO L146 ILogger]: Finished difference Result 37 states and 37 transitions. [2019-05-23 09:21:59,200 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 09:21:59,201 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 26 [2019-05-23 09:21:59,201 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:59,202 INFO L146 ILogger]: With dead ends: 37 [2019-05-23 09:21:59,203 INFO L146 ILogger]: Without dead ends: 37 [2019-05-23 09:21:59,204 INFO L146 ILogger]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:21:59,204 INFO L146 ILogger]: Start minimizeSevpa. Operand 37 states. [2019-05-23 09:21:59,207 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-05-23 09:21:59,208 INFO L146 ILogger]: Start removeUnreachable. Operand 33 states. [2019-05-23 09:21:59,209 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-05-23 09:21:59,209 INFO L146 ILogger]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 26 [2019-05-23 09:21:59,209 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:59,210 INFO L146 ILogger]: Abstraction has 33 states and 33 transitions. [2019-05-23 09:21:59,210 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 09:21:59,210 INFO L146 ILogger]: Start isEmpty. Operand 33 states and 33 transitions. [2019-05-23 09:21:59,211 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 33 [2019-05-23 09:21:59,211 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:59,211 INFO L146 ILogger]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:59,212 INFO L146 ILogger]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:59,212 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:59,212 INFO L146 ILogger]: Analyzing trace with hash 106696619, now seen corresponding path program 3 times [2019-05-23 09:21:59,213 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:59,239 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:59,242 INFO L146 ILogger]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-23 09:21:59,245 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:59,439 INFO L146 ILogger]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:21:59,439 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:59,439 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 09:21:59,440 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 09:21:59,440 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 09:21:59,441 INFO L146 ILogger]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:21:59,441 INFO L146 ILogger]: Start difference. First operand 33 states and 33 transitions. Second operand 9 states. [2019-05-23 09:21:59,663 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:59,664 INFO L146 ILogger]: Finished difference Result 43 states and 43 transitions. [2019-05-23 09:21:59,664 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 09:21:59,664 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 32 [2019-05-23 09:21:59,665 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:59,666 INFO L146 ILogger]: With dead ends: 43 [2019-05-23 09:21:59,667 INFO L146 ILogger]: Without dead ends: 43 [2019-05-23 09:21:59,668 INFO L146 ILogger]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:21:59,668 INFO L146 ILogger]: Start minimizeSevpa. Operand 43 states. [2019-05-23 09:21:59,672 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-05-23 09:21:59,672 INFO L146 ILogger]: Start removeUnreachable. Operand 39 states. [2019-05-23 09:21:59,673 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-05-23 09:21:59,673 INFO L146 ILogger]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 32 [2019-05-23 09:21:59,674 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:59,674 INFO L146 ILogger]: Abstraction has 39 states and 39 transitions. [2019-05-23 09:21:59,674 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 09:21:59,674 INFO L146 ILogger]: Start isEmpty. Operand 39 states and 39 transitions. [2019-05-23 09:21:59,675 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 39 [2019-05-23 09:21:59,675 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:59,675 INFO L146 ILogger]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:59,676 INFO L146 ILogger]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:59,676 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:59,676 INFO L146 ILogger]: Analyzing trace with hash 905578440, now seen corresponding path program 4 times [2019-05-23 09:21:59,677 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:59,697 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:59,700 INFO L146 ILogger]: Trace formula consists of 56 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-23 09:21:59,702 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:00,106 INFO L146 ILogger]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:00,107 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:00,107 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 09:22:00,107 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 09:22:00,107 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 09:22:00,108 INFO L146 ILogger]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:00,108 INFO L146 ILogger]: Start difference. First operand 39 states and 39 transitions. Second operand 11 states. [2019-05-23 09:22:00,381 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:00,382 INFO L146 ILogger]: Finished difference Result 49 states and 49 transitions. [2019-05-23 09:22:00,384 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-23 09:22:00,384 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 38 [2019-05-23 09:22:00,385 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:00,385 INFO L146 ILogger]: With dead ends: 49 [2019-05-23 09:22:00,385 INFO L146 ILogger]: Without dead ends: 49 [2019-05-23 09:22:00,386 INFO L146 ILogger]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:00,387 INFO L146 ILogger]: Start minimizeSevpa. Operand 49 states. [2019-05-23 09:22:00,390 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 49 to 45. [2019-05-23 09:22:00,390 INFO L146 ILogger]: Start removeUnreachable. Operand 45 states. [2019-05-23 09:22:00,391 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-05-23 09:22:00,392 INFO L146 ILogger]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 38 [2019-05-23 09:22:00,392 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:00,392 INFO L146 ILogger]: Abstraction has 45 states and 45 transitions. [2019-05-23 09:22:00,392 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 09:22:00,393 INFO L146 ILogger]: Start isEmpty. Operand 45 states and 45 transitions. [2019-05-23 09:22:00,394 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 45 [2019-05-23 09:22:00,394 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:00,394 INFO L146 ILogger]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:00,394 INFO L146 ILogger]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:00,395 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:00,395 INFO L146 ILogger]: Analyzing trace with hash -2091731419, now seen corresponding path program 5 times [2019-05-23 09:22:00,396 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:00,418 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:00,420 INFO L146 ILogger]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-23 09:22:00,422 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:00,726 INFO L146 ILogger]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:00,726 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:00,727 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-23 09:22:00,727 INFO L146 ILogger]: Interpolant automaton has 13 states [2019-05-23 09:22:00,727 INFO L146 ILogger]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-23 09:22:00,728 INFO L146 ILogger]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:22:00,728 INFO L146 ILogger]: Start difference. First operand 45 states and 45 transitions. Second operand 13 states. [2019-05-23 09:22:01,368 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:01,368 INFO L146 ILogger]: Finished difference Result 55 states and 55 transitions. [2019-05-23 09:22:01,368 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-23 09:22:01,369 INFO L146 ILogger]: Start accepts. Automaton has 13 states. Word has length 44 [2019-05-23 09:22:01,369 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:01,371 INFO L146 ILogger]: With dead ends: 55 [2019-05-23 09:22:01,371 INFO L146 ILogger]: Without dead ends: 55 [2019-05-23 09:22:01,372 INFO L146 ILogger]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:01,372 INFO L146 ILogger]: Start minimizeSevpa. Operand 55 states. [2019-05-23 09:22:01,375 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 55 to 51. [2019-05-23 09:22:01,376 INFO L146 ILogger]: Start removeUnreachable. Operand 51 states. [2019-05-23 09:22:01,376 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-05-23 09:22:01,377 INFO L146 ILogger]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 44 [2019-05-23 09:22:01,377 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:01,377 INFO L146 ILogger]: Abstraction has 51 states and 51 transitions. [2019-05-23 09:22:01,377 INFO L146 ILogger]: Interpolant automaton has 13 states. [2019-05-23 09:22:01,378 INFO L146 ILogger]: Start isEmpty. Operand 51 states and 51 transitions. [2019-05-23 09:22:01,379 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 51 [2019-05-23 09:22:01,379 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:01,379 INFO L146 ILogger]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:01,379 INFO L146 ILogger]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:01,380 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:01,380 INFO L146 ILogger]: Analyzing trace with hash 580152002, now seen corresponding path program 6 times [2019-05-23 09:22:01,381 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:01,403 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:01,406 INFO L146 ILogger]: Trace formula consists of 74 conjuncts, 14 conjunts are in the unsatisfiable core [2019-05-23 09:22:01,408 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:01,591 INFO L146 ILogger]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:01,591 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:01,591 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-23 09:22:01,592 INFO L146 ILogger]: Interpolant automaton has 15 states [2019-05-23 09:22:01,592 INFO L146 ILogger]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-23 09:22:01,593 INFO L146 ILogger]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:01,593 INFO L146 ILogger]: Start difference. First operand 51 states and 51 transitions. Second operand 15 states. [2019-05-23 09:22:01,998 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:01,999 INFO L146 ILogger]: Finished difference Result 61 states and 61 transitions. [2019-05-23 09:22:01,999 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-23 09:22:01,999 INFO L146 ILogger]: Start accepts. Automaton has 15 states. Word has length 50 [2019-05-23 09:22:02,000 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:02,001 INFO L146 ILogger]: With dead ends: 61 [2019-05-23 09:22:02,001 INFO L146 ILogger]: Without dead ends: 61 [2019-05-23 09:22:02,002 INFO L146 ILogger]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:02,003 INFO L146 ILogger]: Start minimizeSevpa. Operand 61 states. [2019-05-23 09:22:02,008 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 61 to 57. [2019-05-23 09:22:02,008 INFO L146 ILogger]: Start removeUnreachable. Operand 57 states. [2019-05-23 09:22:02,009 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-05-23 09:22:02,009 INFO L146 ILogger]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 50 [2019-05-23 09:22:02,010 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:02,010 INFO L146 ILogger]: Abstraction has 57 states and 57 transitions. [2019-05-23 09:22:02,010 INFO L146 ILogger]: Interpolant automaton has 15 states. [2019-05-23 09:22:02,010 INFO L146 ILogger]: Start isEmpty. Operand 57 states and 57 transitions. [2019-05-23 09:22:02,011 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 57 [2019-05-23 09:22:02,011 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:02,011 INFO L146 ILogger]: trace histogram [7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:02,012 INFO L146 ILogger]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:02,012 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:02,012 INFO L146 ILogger]: Analyzing trace with hash -537823841, now seen corresponding path program 7 times [2019-05-23 09:22:02,013 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:02,043 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:02,048 INFO L146 ILogger]: Trace formula consists of 83 conjuncts, 16 conjunts are in the unsatisfiable core [2019-05-23 09:22:02,054 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:02,265 INFO L146 ILogger]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:02,266 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:02,266 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-23 09:22:02,267 INFO L146 ILogger]: Interpolant automaton has 17 states [2019-05-23 09:22:02,267 INFO L146 ILogger]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-23 09:22:02,267 INFO L146 ILogger]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:22:02,268 INFO L146 ILogger]: Start difference. First operand 57 states and 57 transitions. Second operand 17 states. [2019-05-23 09:22:02,644 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:02,645 INFO L146 ILogger]: Finished difference Result 67 states and 67 transitions. [2019-05-23 09:22:02,645 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-23 09:22:02,645 INFO L146 ILogger]: Start accepts. Automaton has 17 states. Word has length 56 [2019-05-23 09:22:02,646 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:02,647 INFO L146 ILogger]: With dead ends: 67 [2019-05-23 09:22:02,647 INFO L146 ILogger]: Without dead ends: 67 [2019-05-23 09:22:02,648 INFO L146 ILogger]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:02,649 INFO L146 ILogger]: Start minimizeSevpa. Operand 67 states. [2019-05-23 09:22:02,652 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-05-23 09:22:02,652 INFO L146 ILogger]: Start removeUnreachable. Operand 63 states. [2019-05-23 09:22:02,653 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-05-23 09:22:02,654 INFO L146 ILogger]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 56 [2019-05-23 09:22:02,654 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:02,654 INFO L146 ILogger]: Abstraction has 63 states and 63 transitions. [2019-05-23 09:22:02,654 INFO L146 ILogger]: Interpolant automaton has 17 states. [2019-05-23 09:22:02,654 INFO L146 ILogger]: Start isEmpty. Operand 63 states and 63 transitions. [2019-05-23 09:22:02,655 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 63 [2019-05-23 09:22:02,655 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:02,655 INFO L146 ILogger]: trace histogram [8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:02,656 INFO L146 ILogger]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:02,656 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:02,656 INFO L146 ILogger]: Analyzing trace with hash 211822268, now seen corresponding path program 8 times [2019-05-23 09:22:02,657 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:02,677 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:02,679 INFO L146 ILogger]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2019-05-23 09:22:02,682 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:02,854 INFO L146 ILogger]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:02,855 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:02,855 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-23 09:22:02,855 INFO L146 ILogger]: Interpolant automaton has 19 states [2019-05-23 09:22:02,856 INFO L146 ILogger]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-23 09:22:02,856 INFO L146 ILogger]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:02,856 INFO L146 ILogger]: Start difference. First operand 63 states and 63 transitions. Second operand 19 states. [2019-05-23 09:22:03,613 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:03,613 INFO L146 ILogger]: Finished difference Result 73 states and 73 transitions. [2019-05-23 09:22:03,615 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-05-23 09:22:03,616 INFO L146 ILogger]: Start accepts. Automaton has 19 states. Word has length 62 [2019-05-23 09:22:03,616 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:03,617 INFO L146 ILogger]: With dead ends: 73 [2019-05-23 09:22:03,617 INFO L146 ILogger]: Without dead ends: 73 [2019-05-23 09:22:03,618 INFO L146 ILogger]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:03,618 INFO L146 ILogger]: Start minimizeSevpa. Operand 73 states. [2019-05-23 09:22:03,622 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-05-23 09:22:03,622 INFO L146 ILogger]: Start removeUnreachable. Operand 69 states. [2019-05-23 09:22:03,623 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-05-23 09:22:03,623 INFO L146 ILogger]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 62 [2019-05-23 09:22:03,623 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:03,624 INFO L146 ILogger]: Abstraction has 69 states and 69 transitions. [2019-05-23 09:22:03,624 INFO L146 ILogger]: Interpolant automaton has 19 states. [2019-05-23 09:22:03,624 INFO L146 ILogger]: Start isEmpty. Operand 69 states and 69 transitions. [2019-05-23 09:22:03,625 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 69 [2019-05-23 09:22:03,625 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:03,625 INFO L146 ILogger]: trace histogram [9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:03,625 INFO L146 ILogger]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:03,626 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:03,626 INFO L146 ILogger]: Analyzing trace with hash -1411723751, now seen corresponding path program 9 times [2019-05-23 09:22:03,627 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:03,648 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:03,651 INFO L146 ILogger]: Trace formula consists of 101 conjuncts, 20 conjunts are in the unsatisfiable core [2019-05-23 09:22:03,654 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:03,887 INFO L146 ILogger]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:03,887 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:03,887 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-23 09:22:03,888 INFO L146 ILogger]: Interpolant automaton has 21 states [2019-05-23 09:22:03,888 INFO L146 ILogger]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-23 09:22:03,889 INFO L146 ILogger]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:22:03,889 INFO L146 ILogger]: Start difference. First operand 69 states and 69 transitions. Second operand 21 states. [2019-05-23 09:22:04,497 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:04,497 INFO L146 ILogger]: Finished difference Result 79 states and 79 transitions. [2019-05-23 09:22:04,497 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-23 09:22:04,498 INFO L146 ILogger]: Start accepts. Automaton has 21 states. Word has length 68 [2019-05-23 09:22:04,498 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:04,498 INFO L146 ILogger]: With dead ends: 79 [2019-05-23 09:22:04,499 INFO L146 ILogger]: Without dead ends: 79 [2019-05-23 09:22:04,500 INFO L146 ILogger]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:04,501 INFO L146 ILogger]: Start minimizeSevpa. Operand 79 states. [2019-05-23 09:22:04,505 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 79 to 75. [2019-05-23 09:22:04,505 INFO L146 ILogger]: Start removeUnreachable. Operand 75 states. [2019-05-23 09:22:04,506 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-05-23 09:22:04,506 INFO L146 ILogger]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 68 [2019-05-23 09:22:04,506 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:04,506 INFO L146 ILogger]: Abstraction has 75 states and 75 transitions. [2019-05-23 09:22:04,506 INFO L146 ILogger]: Interpolant automaton has 21 states. [2019-05-23 09:22:04,507 INFO L146 ILogger]: Start isEmpty. Operand 75 states and 75 transitions. [2019-05-23 09:22:04,508 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 75 [2019-05-23 09:22:04,508 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:04,508 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:04,508 INFO L146 ILogger]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:04,508 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:04,509 INFO L146 ILogger]: Analyzing trace with hash -538985546, now seen corresponding path program 10 times [2019-05-23 09:22:04,509 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:04,531 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:04,534 INFO L146 ILogger]: Trace formula consists of 110 conjuncts, 22 conjunts are in the unsatisfiable core [2019-05-23 09:22:04,537 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:04,833 INFO L146 ILogger]: Checked inductivity of 280 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:04,833 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:04,834 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-05-23 09:22:04,834 INFO L146 ILogger]: Interpolant automaton has 23 states [2019-05-23 09:22:04,834 INFO L146 ILogger]: Constructing interpolant automaton starting with 23 interpolants. [2019-05-23 09:22:04,835 INFO L146 ILogger]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:04,835 INFO L146 ILogger]: Start difference. First operand 75 states and 75 transitions. Second operand 23 states. [2019-05-23 09:22:05,268 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:05,268 INFO L146 ILogger]: Finished difference Result 85 states and 85 transitions. [2019-05-23 09:22:05,269 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-05-23 09:22:05,269 INFO L146 ILogger]: Start accepts. Automaton has 23 states. Word has length 74 [2019-05-23 09:22:05,269 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:05,270 INFO L146 ILogger]: With dead ends: 85 [2019-05-23 09:22:05,270 INFO L146 ILogger]: Without dead ends: 85 [2019-05-23 09:22:05,271 INFO L146 ILogger]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:22:05,272 INFO L146 ILogger]: Start minimizeSevpa. Operand 85 states. [2019-05-23 09:22:05,277 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 85 to 81. [2019-05-23 09:22:05,277 INFO L146 ILogger]: Start removeUnreachable. Operand 81 states. [2019-05-23 09:22:05,278 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-05-23 09:22:05,278 INFO L146 ILogger]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 74 [2019-05-23 09:22:05,278 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:05,278 INFO L146 ILogger]: Abstraction has 81 states and 81 transitions. [2019-05-23 09:22:05,278 INFO L146 ILogger]: Interpolant automaton has 23 states. [2019-05-23 09:22:05,279 INFO L146 ILogger]: Start isEmpty. Operand 81 states and 81 transitions. [2019-05-23 09:22:05,280 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 81 [2019-05-23 09:22:05,280 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:05,280 INFO L146 ILogger]: trace histogram [11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:05,280 INFO L146 ILogger]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:05,280 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:05,281 INFO L146 ILogger]: Analyzing trace with hash -1762574445, now seen corresponding path program 11 times [2019-05-23 09:22:05,281 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:05,305 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:05,307 INFO L146 ILogger]: Trace formula consists of 119 conjuncts, 24 conjunts are in the unsatisfiable core [2019-05-23 09:22:05,311 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:06,055 INFO L146 ILogger]: Checked inductivity of 341 backedges. 0 proven. 341 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:06,055 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:06,056 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-05-23 09:22:06,056 INFO L146 ILogger]: Interpolant automaton has 25 states [2019-05-23 09:22:06,056 INFO L146 ILogger]: Constructing interpolant automaton starting with 25 interpolants. [2019-05-23 09:22:06,057 INFO L146 ILogger]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:22:06,057 INFO L146 ILogger]: Start difference. First operand 81 states and 81 transitions. Second operand 25 states. [2019-05-23 09:22:06,704 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:06,704 INFO L146 ILogger]: Finished difference Result 91 states and 91 transitions. [2019-05-23 09:22:06,705 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-23 09:22:06,705 INFO L146 ILogger]: Start accepts. Automaton has 25 states. Word has length 80 [2019-05-23 09:22:06,705 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:06,706 INFO L146 ILogger]: With dead ends: 91 [2019-05-23 09:22:06,706 INFO L146 ILogger]: Without dead ends: 91 [2019-05-23 09:22:06,708 INFO L146 ILogger]: 0 DeclaredPredicates, 101 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:22:06,708 INFO L146 ILogger]: Start minimizeSevpa. Operand 91 states. [2019-05-23 09:22:06,712 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-05-23 09:22:06,712 INFO L146 ILogger]: Start removeUnreachable. Operand 87 states. [2019-05-23 09:22:06,713 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-05-23 09:22:06,713 INFO L146 ILogger]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 80 [2019-05-23 09:22:06,713 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:06,714 INFO L146 ILogger]: Abstraction has 87 states and 87 transitions. [2019-05-23 09:22:06,714 INFO L146 ILogger]: Interpolant automaton has 25 states. [2019-05-23 09:22:06,714 INFO L146 ILogger]: Start isEmpty. Operand 87 states and 87 transitions. [2019-05-23 09:22:06,715 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 87 [2019-05-23 09:22:06,715 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:06,715 INFO L146 ILogger]: trace histogram [12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:06,716 INFO L146 ILogger]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:06,716 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:06,716 INFO L146 ILogger]: Analyzing trace with hash 2018879920, now seen corresponding path program 12 times [2019-05-23 09:22:06,717 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:06,741 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:06,744 INFO L146 ILogger]: Trace formula consists of 128 conjuncts, 26 conjunts are in the unsatisfiable core [2019-05-23 09:22:06,748 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:07,050 INFO L146 ILogger]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:07,051 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:07,051 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-05-23 09:22:07,051 INFO L146 ILogger]: Interpolant automaton has 27 states [2019-05-23 09:22:07,052 INFO L146 ILogger]: Constructing interpolant automaton starting with 27 interpolants. [2019-05-23 09:22:07,052 INFO L146 ILogger]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:07,052 INFO L146 ILogger]: Start difference. First operand 87 states and 87 transitions. Second operand 27 states. [2019-05-23 09:22:07,511 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:07,511 INFO L146 ILogger]: Finished difference Result 97 states and 97 transitions. [2019-05-23 09:22:07,512 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-05-23 09:22:07,512 INFO L146 ILogger]: Start accepts. Automaton has 27 states. Word has length 86 [2019-05-23 09:22:07,512 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:07,512 INFO L146 ILogger]: With dead ends: 97 [2019-05-23 09:22:07,512 INFO L146 ILogger]: Without dead ends: 97 [2019-05-23 09:22:07,513 INFO L146 ILogger]: 0 DeclaredPredicates, 109 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:22:07,514 INFO L146 ILogger]: Start minimizeSevpa. Operand 97 states. [2019-05-23 09:22:07,516 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-05-23 09:22:07,517 INFO L146 ILogger]: Start removeUnreachable. Operand 93 states. [2019-05-23 09:22:07,518 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-05-23 09:22:07,518 INFO L146 ILogger]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 86 [2019-05-23 09:22:07,518 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:07,518 INFO L146 ILogger]: Abstraction has 93 states and 93 transitions. [2019-05-23 09:22:07,518 INFO L146 ILogger]: Interpolant automaton has 27 states. [2019-05-23 09:22:07,518 INFO L146 ILogger]: Start isEmpty. Operand 93 states and 93 transitions. [2019-05-23 09:22:07,519 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 93 [2019-05-23 09:22:07,519 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:07,520 INFO L146 ILogger]: trace histogram [13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:07,520 INFO L146 ILogger]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:07,520 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:07,520 INFO L146 ILogger]: Analyzing trace with hash 290933261, now seen corresponding path program 13 times [2019-05-23 09:22:07,521 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:07,543 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:07,546 INFO L146 ILogger]: Trace formula consists of 137 conjuncts, 28 conjunts are in the unsatisfiable core [2019-05-23 09:22:07,550 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:08,277 INFO L146 ILogger]: Checked inductivity of 481 backedges. 0 proven. 481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:08,277 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:08,278 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-05-23 09:22:08,278 INFO L146 ILogger]: Interpolant automaton has 29 states [2019-05-23 09:22:08,278 INFO L146 ILogger]: Constructing interpolant automaton starting with 29 interpolants. [2019-05-23 09:22:08,279 INFO L146 ILogger]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:22:08,279 INFO L146 ILogger]: Start difference. First operand 93 states and 93 transitions. Second operand 29 states. [2019-05-23 09:22:09,357 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,357 INFO L146 ILogger]: Finished difference Result 103 states and 103 transitions. [2019-05-23 09:22:09,359 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-23 09:22:09,359 INFO L146 ILogger]: Start accepts. Automaton has 29 states. Word has length 92 [2019-05-23 09:22:09,359 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,360 INFO L146 ILogger]: With dead ends: 103 [2019-05-23 09:22:09,360 INFO L146 ILogger]: Without dead ends: 103 [2019-05-23 09:22:09,361 INFO L146 ILogger]: 0 DeclaredPredicates, 117 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:22:09,362 INFO L146 ILogger]: Start minimizeSevpa. Operand 103 states. [2019-05-23 09:22:09,364 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-05-23 09:22:09,364 INFO L146 ILogger]: Start removeUnreachable. Operand 99 states. [2019-05-23 09:22:09,365 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-05-23 09:22:09,365 INFO L146 ILogger]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 92 [2019-05-23 09:22:09,365 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,366 INFO L146 ILogger]: Abstraction has 99 states and 99 transitions. [2019-05-23 09:22:09,366 INFO L146 ILogger]: Interpolant automaton has 29 states. [2019-05-23 09:22:09,366 INFO L146 ILogger]: Start isEmpty. Operand 99 states and 99 transitions. [2019-05-23 09:22:09,367 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 99 [2019-05-23 09:22:09,367 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,367 INFO L146 ILogger]: trace histogram [14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:09,367 INFO L146 ILogger]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,367 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,367 INFO L146 ILogger]: Analyzing trace with hash 1111781546, now seen corresponding path program 14 times [2019-05-23 09:22:09,368 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,410 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,418 INFO L146 ILogger]: Trace formula consists of 146 conjuncts, 30 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,425 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,896 INFO L146 ILogger]: Checked inductivity of 560 backedges. 0 proven. 560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:09,897 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:09,897 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-05-23 09:22:09,897 INFO L146 ILogger]: Interpolant automaton has 31 states [2019-05-23 09:22:09,898 INFO L146 ILogger]: Constructing interpolant automaton starting with 31 interpolants. [2019-05-23 09:22:09,898 INFO L146 ILogger]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:09,899 INFO L146 ILogger]: Start difference. First operand 99 states and 99 transitions. Second operand 31 states. [2019-05-23 09:22:10,549 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:10,550 INFO L146 ILogger]: Finished difference Result 109 states and 109 transitions. [2019-05-23 09:22:10,550 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-05-23 09:22:10,550 INFO L146 ILogger]: Start accepts. Automaton has 31 states. Word has length 98 [2019-05-23 09:22:10,551 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:10,552 INFO L146 ILogger]: With dead ends: 109 [2019-05-23 09:22:10,552 INFO L146 ILogger]: Without dead ends: 109 [2019-05-23 09:22:10,554 INFO L146 ILogger]: 0 DeclaredPredicates, 125 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:22:10,554 INFO L146 ILogger]: Start minimizeSevpa. Operand 109 states. [2019-05-23 09:22:10,556 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 109 to 105. [2019-05-23 09:22:10,556 INFO L146 ILogger]: Start removeUnreachable. Operand 105 states. [2019-05-23 09:22:10,557 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-05-23 09:22:10,557 INFO L146 ILogger]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 98 [2019-05-23 09:22:10,557 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:10,558 INFO L146 ILogger]: Abstraction has 105 states and 105 transitions. [2019-05-23 09:22:10,558 INFO L146 ILogger]: Interpolant automaton has 31 states. [2019-05-23 09:22:10,558 INFO L146 ILogger]: Start isEmpty. Operand 105 states and 105 transitions. [2019-05-23 09:22:10,559 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 105 [2019-05-23 09:22:10,559 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:10,559 INFO L146 ILogger]: trace histogram [15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:10,559 INFO L146 ILogger]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:10,559 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:10,560 INFO L146 ILogger]: Analyzing trace with hash -345019001, now seen corresponding path program 15 times [2019-05-23 09:22:10,560 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:10,581 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:10,584 INFO L146 ILogger]: Trace formula consists of 155 conjuncts, 32 conjunts are in the unsatisfiable core [2019-05-23 09:22:10,588 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:11,286 INFO L146 ILogger]: Checked inductivity of 645 backedges. 0 proven. 645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:11,287 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:11,287 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-05-23 09:22:11,287 INFO L146 ILogger]: Interpolant automaton has 33 states [2019-05-23 09:22:11,288 INFO L146 ILogger]: Constructing interpolant automaton starting with 33 interpolants. [2019-05-23 09:22:11,288 INFO L146 ILogger]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:22:11,289 INFO L146 ILogger]: Start difference. First operand 105 states and 105 transitions. Second operand 33 states. [2019-05-23 09:22:11,967 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:11,968 INFO L146 ILogger]: Finished difference Result 115 states and 115 transitions. [2019-05-23 09:22:11,969 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-23 09:22:11,969 INFO L146 ILogger]: Start accepts. Automaton has 33 states. Word has length 104 [2019-05-23 09:22:11,970 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:11,970 INFO L146 ILogger]: With dead ends: 115 [2019-05-23 09:22:11,971 INFO L146 ILogger]: Without dead ends: 115 [2019-05-23 09:22:11,972 INFO L146 ILogger]: 0 DeclaredPredicates, 133 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:22:11,973 INFO L146 ILogger]: Start minimizeSevpa. Operand 115 states. [2019-05-23 09:22:11,974 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-05-23 09:22:11,975 INFO L146 ILogger]: Start removeUnreachable. Operand 111 states. [2019-05-23 09:22:11,975 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-05-23 09:22:11,975 INFO L146 ILogger]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 104 [2019-05-23 09:22:11,976 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:11,976 INFO L146 ILogger]: Abstraction has 111 states and 111 transitions. [2019-05-23 09:22:11,976 INFO L146 ILogger]: Interpolant automaton has 33 states. [2019-05-23 09:22:11,976 INFO L146 ILogger]: Start isEmpty. Operand 111 states and 111 transitions. [2019-05-23 09:22:11,977 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 111 [2019-05-23 09:22:11,977 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:11,977 INFO L146 ILogger]: trace histogram [16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:11,977 INFO L146 ILogger]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:11,978 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:11,978 INFO L146 ILogger]: Analyzing trace with hash -634482524, now seen corresponding path program 16 times [2019-05-23 09:22:11,979 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:11,995 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:11,998 INFO L146 ILogger]: Trace formula consists of 164 conjuncts, 34 conjunts are in the unsatisfiable core [2019-05-23 09:22:12,002 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:12,531 INFO L146 ILogger]: Checked inductivity of 736 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:12,531 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:12,531 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-05-23 09:22:12,532 INFO L146 ILogger]: Interpolant automaton has 35 states [2019-05-23 09:22:12,532 INFO L146 ILogger]: Constructing interpolant automaton starting with 35 interpolants. [2019-05-23 09:22:12,533 INFO L146 ILogger]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:12,533 INFO L146 ILogger]: Start difference. First operand 111 states and 111 transitions. Second operand 35 states. [2019-05-23 09:22:13,337 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:13,337 INFO L146 ILogger]: Finished difference Result 121 states and 121 transitions. [2019-05-23 09:22:13,338 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-05-23 09:22:13,338 INFO L146 ILogger]: Start accepts. Automaton has 35 states. Word has length 110 [2019-05-23 09:22:13,338 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:13,339 INFO L146 ILogger]: With dead ends: 121 [2019-05-23 09:22:13,339 INFO L146 ILogger]: Without dead ends: 121 [2019-05-23 09:22:13,341 INFO L146 ILogger]: 0 DeclaredPredicates, 141 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:22:13,341 INFO L146 ILogger]: Start minimizeSevpa. Operand 121 states. [2019-05-23 09:22:13,342 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-05-23 09:22:13,342 INFO L146 ILogger]: Start removeUnreachable. Operand 117 states. [2019-05-23 09:22:13,343 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-05-23 09:22:13,343 INFO L146 ILogger]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 110 [2019-05-23 09:22:13,343 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:13,343 INFO L146 ILogger]: Abstraction has 117 states and 117 transitions. [2019-05-23 09:22:13,343 INFO L146 ILogger]: Interpolant automaton has 35 states. [2019-05-23 09:22:13,344 INFO L146 ILogger]: Start isEmpty. Operand 117 states and 117 transitions. [2019-05-23 09:22:13,344 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 117 [2019-05-23 09:22:13,344 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:13,345 INFO L146 ILogger]: trace histogram [17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:13,345 INFO L146 ILogger]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:13,345 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:13,345 INFO L146 ILogger]: Analyzing trace with hash -170120703, now seen corresponding path program 17 times [2019-05-23 09:22:13,346 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:13,362 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:13,365 INFO L146 ILogger]: Trace formula consists of 173 conjuncts, 36 conjunts are in the unsatisfiable core [2019-05-23 09:22:13,367 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:13,893 INFO L146 ILogger]: Checked inductivity of 833 backedges. 0 proven. 833 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:13,894 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:13,894 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-05-23 09:22:13,894 INFO L146 ILogger]: Interpolant automaton has 37 states [2019-05-23 09:22:13,895 INFO L146 ILogger]: Constructing interpolant automaton starting with 37 interpolants. [2019-05-23 09:22:13,895 INFO L146 ILogger]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:22:13,895 INFO L146 ILogger]: Start difference. First operand 117 states and 117 transitions. Second operand 37 states. [2019-05-23 09:22:14,772 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:14,772 INFO L146 ILogger]: Finished difference Result 127 states and 127 transitions. [2019-05-23 09:22:14,772 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-23 09:22:14,773 INFO L146 ILogger]: Start accepts. Automaton has 37 states. Word has length 116 [2019-05-23 09:22:14,773 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:14,774 INFO L146 ILogger]: With dead ends: 127 [2019-05-23 09:22:14,774 INFO L146 ILogger]: Without dead ends: 127 [2019-05-23 09:22:14,777 INFO L146 ILogger]: 0 DeclaredPredicates, 149 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:22:14,777 INFO L146 ILogger]: Start minimizeSevpa. Operand 127 states. [2019-05-23 09:22:14,779 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 127 to 123. [2019-05-23 09:22:14,779 INFO L146 ILogger]: Start removeUnreachable. Operand 123 states. [2019-05-23 09:22:14,780 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-05-23 09:22:14,780 INFO L146 ILogger]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 116 [2019-05-23 09:22:14,780 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:14,780 INFO L146 ILogger]: Abstraction has 123 states and 123 transitions. [2019-05-23 09:22:14,780 INFO L146 ILogger]: Interpolant automaton has 37 states. [2019-05-23 09:22:14,781 INFO L146 ILogger]: Start isEmpty. Operand 123 states and 123 transitions. [2019-05-23 09:22:14,781 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 123 [2019-05-23 09:22:14,782 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:14,782 INFO L146 ILogger]: trace histogram [18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:14,782 INFO L146 ILogger]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:14,782 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:14,782 INFO L146 ILogger]: Analyzing trace with hash -1395226210, now seen corresponding path program 18 times [2019-05-23 09:22:14,783 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:14,800 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:14,802 INFO L146 ILogger]: Trace formula consists of 182 conjuncts, 38 conjunts are in the unsatisfiable core [2019-05-23 09:22:14,804 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:15,256 INFO L146 ILogger]: Checked inductivity of 936 backedges. 0 proven. 936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:15,257 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:15,257 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-05-23 09:22:15,257 INFO L146 ILogger]: Interpolant automaton has 39 states [2019-05-23 09:22:15,258 INFO L146 ILogger]: Constructing interpolant automaton starting with 39 interpolants. [2019-05-23 09:22:15,258 INFO L146 ILogger]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:15,258 INFO L146 ILogger]: Start difference. First operand 123 states and 123 transitions. Second operand 39 states. [2019-05-23 09:22:16,482 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:16,482 INFO L146 ILogger]: Finished difference Result 133 states and 133 transitions. [2019-05-23 09:22:16,483 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-05-23 09:22:16,483 INFO L146 ILogger]: Start accepts. Automaton has 39 states. Word has length 122 [2019-05-23 09:22:16,483 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:16,484 INFO L146 ILogger]: With dead ends: 133 [2019-05-23 09:22:16,485 INFO L146 ILogger]: Without dead ends: 133 [2019-05-23 09:22:16,487 INFO L146 ILogger]: 0 DeclaredPredicates, 157 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:22:16,488 INFO L146 ILogger]: Start minimizeSevpa. Operand 133 states. [2019-05-23 09:22:16,489 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-05-23 09:22:16,489 INFO L146 ILogger]: Start removeUnreachable. Operand 129 states. [2019-05-23 09:22:16,490 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-05-23 09:22:16,490 INFO L146 ILogger]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 122 [2019-05-23 09:22:16,491 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:16,491 INFO L146 ILogger]: Abstraction has 129 states and 129 transitions. [2019-05-23 09:22:16,491 INFO L146 ILogger]: Interpolant automaton has 39 states. [2019-05-23 09:22:16,491 INFO L146 ILogger]: Start isEmpty. Operand 129 states and 129 transitions. [2019-05-23 09:22:16,492 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 129 [2019-05-23 09:22:16,492 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:16,492 INFO L146 ILogger]: trace histogram [19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:16,492 INFO L146 ILogger]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:16,492 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:16,492 INFO L146 ILogger]: Analyzing trace with hash -1585447045, now seen corresponding path program 19 times [2019-05-23 09:22:16,493 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:16,510 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:16,512 INFO L146 ILogger]: Trace formula consists of 191 conjuncts, 40 conjunts are in the unsatisfiable core [2019-05-23 09:22:16,514 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:17,054 INFO L146 ILogger]: Checked inductivity of 1045 backedges. 0 proven. 1045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:17,054 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:17,054 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-05-23 09:22:17,055 INFO L146 ILogger]: Interpolant automaton has 41 states [2019-05-23 09:22:17,055 INFO L146 ILogger]: Constructing interpolant automaton starting with 41 interpolants. [2019-05-23 09:22:17,056 INFO L146 ILogger]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:22:17,056 INFO L146 ILogger]: Start difference. First operand 129 states and 129 transitions. Second operand 41 states. [2019-05-23 09:22:18,096 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:18,096 INFO L146 ILogger]: Finished difference Result 139 states and 139 transitions. [2019-05-23 09:22:18,096 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-23 09:22:18,096 INFO L146 ILogger]: Start accepts. Automaton has 41 states. Word has length 128 [2019-05-23 09:22:18,097 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:18,098 INFO L146 ILogger]: With dead ends: 139 [2019-05-23 09:22:18,098 INFO L146 ILogger]: Without dead ends: 139 [2019-05-23 09:22:18,101 INFO L146 ILogger]: 0 DeclaredPredicates, 165 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:22:18,101 INFO L146 ILogger]: Start minimizeSevpa. Operand 139 states. [2019-05-23 09:22:18,102 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 139 to 135. [2019-05-23 09:22:18,103 INFO L146 ILogger]: Start removeUnreachable. Operand 135 states. [2019-05-23 09:22:18,103 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-05-23 09:22:18,103 INFO L146 ILogger]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 128 [2019-05-23 09:22:18,103 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:18,103 INFO L146 ILogger]: Abstraction has 135 states and 135 transitions. [2019-05-23 09:22:18,103 INFO L146 ILogger]: Interpolant automaton has 41 states. [2019-05-23 09:22:18,104 INFO L146 ILogger]: Start isEmpty. Operand 135 states and 135 transitions. [2019-05-23 09:22:18,104 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 135 [2019-05-23 09:22:18,104 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:18,104 INFO L146 ILogger]: trace histogram [20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:18,104 INFO L146 ILogger]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:18,105 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:18,105 INFO L146 ILogger]: Analyzing trace with hash -1757488232, now seen corresponding path program 20 times [2019-05-23 09:22:18,105 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:18,121 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:18,123 INFO L146 ILogger]: Trace formula consists of 200 conjuncts, 42 conjunts are in the unsatisfiable core [2019-05-23 09:22:18,125 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:18,705 INFO L146 ILogger]: Checked inductivity of 1160 backedges. 0 proven. 1160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:18,706 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:18,706 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-05-23 09:22:18,706 INFO L146 ILogger]: Interpolant automaton has 43 states [2019-05-23 09:22:18,707 INFO L146 ILogger]: Constructing interpolant automaton starting with 43 interpolants. [2019-05-23 09:22:18,707 INFO L146 ILogger]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:22:18,707 INFO L146 ILogger]: Start difference. First operand 135 states and 135 transitions. Second operand 43 states. [2019-05-23 09:22:19,768 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:19,768 INFO L146 ILogger]: Finished difference Result 145 states and 145 transitions. [2019-05-23 09:22:19,769 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-05-23 09:22:19,769 INFO L146 ILogger]: Start accepts. Automaton has 43 states. Word has length 134 [2019-05-23 09:22:19,769 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:19,770 INFO L146 ILogger]: With dead ends: 145 [2019-05-23 09:22:19,771 INFO L146 ILogger]: Without dead ends: 145 [2019-05-23 09:22:19,774 INFO L146 ILogger]: 0 DeclaredPredicates, 173 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:22:19,774 INFO L146 ILogger]: Start minimizeSevpa. Operand 145 states. [2019-05-23 09:22:19,776 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 145 to 141. [2019-05-23 09:22:19,776 INFO L146 ILogger]: Start removeUnreachable. Operand 141 states. [2019-05-23 09:22:19,777 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-05-23 09:22:19,777 INFO L146 ILogger]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 134 [2019-05-23 09:22:19,777 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:19,777 INFO L146 ILogger]: Abstraction has 141 states and 141 transitions. [2019-05-23 09:22:19,777 INFO L146 ILogger]: Interpolant automaton has 43 states. [2019-05-23 09:22:19,777 INFO L146 ILogger]: Start isEmpty. Operand 141 states and 141 transitions. [2019-05-23 09:22:19,778 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 141 [2019-05-23 09:22:19,778 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:19,778 INFO L146 ILogger]: trace histogram [21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:19,779 INFO L146 ILogger]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:19,779 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:19,779 INFO L146 ILogger]: Analyzing trace with hash -1619169803, now seen corresponding path program 21 times [2019-05-23 09:22:19,780 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:19,796 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:19,798 INFO L146 ILogger]: Trace formula consists of 209 conjuncts, 44 conjunts are in the unsatisfiable core [2019-05-23 09:22:19,800 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:20,528 INFO L146 ILogger]: Checked inductivity of 1281 backedges. 0 proven. 1281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:20,528 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:20,528 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-05-23 09:22:20,528 INFO L146 ILogger]: Interpolant automaton has 45 states [2019-05-23 09:22:20,529 INFO L146 ILogger]: Constructing interpolant automaton starting with 45 interpolants. [2019-05-23 09:22:20,529 INFO L146 ILogger]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:22:20,529 INFO L146 ILogger]: Start difference. First operand 141 states and 141 transitions. Second operand 45 states. [2019-05-23 09:22:21,974 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:21,975 INFO L146 ILogger]: Finished difference Result 151 states and 151 transitions. [2019-05-23 09:22:21,977 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-23 09:22:21,977 INFO L146 ILogger]: Start accepts. Automaton has 45 states. Word has length 140 [2019-05-23 09:22:21,978 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:21,979 INFO L146 ILogger]: With dead ends: 151 [2019-05-23 09:22:21,979 INFO L146 ILogger]: Without dead ends: 151 [2019-05-23 09:22:21,981 INFO L146 ILogger]: 0 DeclaredPredicates, 181 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:22:21,981 INFO L146 ILogger]: Start minimizeSevpa. Operand 151 states. [2019-05-23 09:22:21,984 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 151 to 147. [2019-05-23 09:22:21,984 INFO L146 ILogger]: Start removeUnreachable. Operand 147 states. [2019-05-23 09:22:21,985 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-05-23 09:22:21,985 INFO L146 ILogger]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 140 [2019-05-23 09:22:21,986 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:21,986 INFO L146 ILogger]: Abstraction has 147 states and 147 transitions. [2019-05-23 09:22:21,986 INFO L146 ILogger]: Interpolant automaton has 45 states. [2019-05-23 09:22:21,986 INFO L146 ILogger]: Start isEmpty. Operand 147 states and 147 transitions. [2019-05-23 09:22:21,987 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 147 [2019-05-23 09:22:21,987 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:21,987 INFO L146 ILogger]: trace histogram [22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:21,988 INFO L146 ILogger]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:21,988 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:21,988 INFO L146 ILogger]: Analyzing trace with hash -2035677550, now seen corresponding path program 22 times [2019-05-23 09:22:21,989 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:22,021 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:22,023 INFO L146 ILogger]: Trace formula consists of 218 conjuncts, 46 conjunts are in the unsatisfiable core [2019-05-23 09:22:22,026 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:22,792 INFO L146 ILogger]: Checked inductivity of 1408 backedges. 0 proven. 1408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:22,792 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:22,793 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-05-23 09:22:22,793 INFO L146 ILogger]: Interpolant automaton has 47 states [2019-05-23 09:22:22,793 INFO L146 ILogger]: Constructing interpolant automaton starting with 47 interpolants. [2019-05-23 09:22:22,794 INFO L146 ILogger]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:22:22,794 INFO L146 ILogger]: Start difference. First operand 147 states and 147 transitions. Second operand 47 states. [2019-05-23 09:22:24,087 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:24,088 INFO L146 ILogger]: Finished difference Result 157 states and 157 transitions. [2019-05-23 09:22:24,088 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-05-23 09:22:24,088 INFO L146 ILogger]: Start accepts. Automaton has 47 states. Word has length 146 [2019-05-23 09:22:24,089 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:24,089 INFO L146 ILogger]: With dead ends: 157 [2019-05-23 09:22:24,090 INFO L146 ILogger]: Without dead ends: 157 [2019-05-23 09:22:24,091 INFO L146 ILogger]: 0 DeclaredPredicates, 189 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:22:24,091 INFO L146 ILogger]: Start minimizeSevpa. Operand 157 states. [2019-05-23 09:22:24,093 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 157 to 153. [2019-05-23 09:22:24,093 INFO L146 ILogger]: Start removeUnreachable. Operand 153 states. [2019-05-23 09:22:24,094 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-05-23 09:22:24,094 INFO L146 ILogger]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 146 [2019-05-23 09:22:24,094 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:24,094 INFO L146 ILogger]: Abstraction has 153 states and 153 transitions. [2019-05-23 09:22:24,094 INFO L146 ILogger]: Interpolant automaton has 47 states. [2019-05-23 09:22:24,094 INFO L146 ILogger]: Start isEmpty. Operand 153 states and 153 transitions. [2019-05-23 09:22:24,095 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 153 [2019-05-23 09:22:24,095 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:24,095 INFO L146 ILogger]: trace histogram [23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:24,095 INFO L146 ILogger]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:24,095 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:24,096 INFO L146 ILogger]: Analyzing trace with hash -2127104657, now seen corresponding path program 23 times [2019-05-23 09:22:24,096 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:24,114 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:24,117 INFO L146 ILogger]: Trace formula consists of 227 conjuncts, 48 conjunts are in the unsatisfiable core [2019-05-23 09:22:24,119 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:25,674 INFO L146 ILogger]: Checked inductivity of 1541 backedges. 0 proven. 1541 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:25,675 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:25,675 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-05-23 09:22:25,675 INFO L146 ILogger]: Interpolant automaton has 49 states [2019-05-23 09:22:25,676 INFO L146 ILogger]: Constructing interpolant automaton starting with 49 interpolants. [2019-05-23 09:22:25,676 INFO L146 ILogger]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:22:25,676 INFO L146 ILogger]: Start difference. First operand 153 states and 153 transitions. Second operand 49 states. [2019-05-23 09:22:27,129 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:27,129 INFO L146 ILogger]: Finished difference Result 163 states and 163 transitions. [2019-05-23 09:22:27,129 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-23 09:22:27,130 INFO L146 ILogger]: Start accepts. Automaton has 49 states. Word has length 152 [2019-05-23 09:22:27,130 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:27,131 INFO L146 ILogger]: With dead ends: 163 [2019-05-23 09:22:27,131 INFO L146 ILogger]: Without dead ends: 163 [2019-05-23 09:22:27,133 INFO L146 ILogger]: 0 DeclaredPredicates, 197 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:22:27,133 INFO L146 ILogger]: Start minimizeSevpa. Operand 163 states. [2019-05-23 09:22:27,136 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 163 to 159. [2019-05-23 09:22:27,136 INFO L146 ILogger]: Start removeUnreachable. Operand 159 states. [2019-05-23 09:22:27,136 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2019-05-23 09:22:27,136 INFO L146 ILogger]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 152 [2019-05-23 09:22:27,137 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:27,137 INFO L146 ILogger]: Abstraction has 159 states and 159 transitions. [2019-05-23 09:22:27,137 INFO L146 ILogger]: Interpolant automaton has 49 states. [2019-05-23 09:22:27,137 INFO L146 ILogger]: Start isEmpty. Operand 159 states and 159 transitions. [2019-05-23 09:22:27,138 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 159 [2019-05-23 09:22:27,138 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:27,138 INFO L146 ILogger]: trace histogram [24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:27,138 INFO L146 ILogger]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:27,139 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:27,139 INFO L146 ILogger]: Analyzing trace with hash 412781196, now seen corresponding path program 24 times [2019-05-23 09:22:27,139 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:27,157 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:27,160 INFO L146 ILogger]: Trace formula consists of 236 conjuncts, 50 conjunts are in the unsatisfiable core [2019-05-23 09:22:27,162 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:27,995 INFO L146 ILogger]: Checked inductivity of 1680 backedges. 0 proven. 1680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:27,995 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:27,996 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-05-23 09:22:27,996 INFO L146 ILogger]: Interpolant automaton has 51 states [2019-05-23 09:22:27,996 INFO L146 ILogger]: Constructing interpolant automaton starting with 51 interpolants. [2019-05-23 09:22:27,997 INFO L146 ILogger]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:22:27,997 INFO L146 ILogger]: Start difference. First operand 159 states and 159 transitions. Second operand 51 states. [2019-05-23 09:22:29,558 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:29,558 INFO L146 ILogger]: Finished difference Result 169 states and 169 transitions. [2019-05-23 09:22:29,558 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-05-23 09:22:29,558 INFO L146 ILogger]: Start accepts. Automaton has 51 states. Word has length 158 [2019-05-23 09:22:29,559 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:29,559 INFO L146 ILogger]: With dead ends: 169 [2019-05-23 09:22:29,560 INFO L146 ILogger]: Without dead ends: 169 [2019-05-23 09:22:29,561 INFO L146 ILogger]: 0 DeclaredPredicates, 205 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:22:29,562 INFO L146 ILogger]: Start minimizeSevpa. Operand 169 states. [2019-05-23 09:22:29,564 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 169 to 165. [2019-05-23 09:22:29,564 INFO L146 ILogger]: Start removeUnreachable. Operand 165 states. [2019-05-23 09:22:29,565 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-05-23 09:22:29,565 INFO L146 ILogger]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 158 [2019-05-23 09:22:29,565 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:29,566 INFO L146 ILogger]: Abstraction has 165 states and 165 transitions. [2019-05-23 09:22:29,566 INFO L146 ILogger]: Interpolant automaton has 51 states. [2019-05-23 09:22:29,566 INFO L146 ILogger]: Start isEmpty. Operand 165 states and 165 transitions. [2019-05-23 09:22:29,566 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 165 [2019-05-23 09:22:29,567 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:29,567 INFO L146 ILogger]: trace histogram [25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:29,567 INFO L146 ILogger]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:29,567 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:29,567 INFO L146 ILogger]: Analyzing trace with hash 1481577961, now seen corresponding path program 25 times [2019-05-23 09:22:29,568 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:29,586 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:29,588 INFO L146 ILogger]: Trace formula consists of 245 conjuncts, 52 conjunts are in the unsatisfiable core [2019-05-23 09:22:29,591 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:30,496 INFO L146 ILogger]: Checked inductivity of 1825 backedges. 0 proven. 1825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:30,496 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:30,496 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-05-23 09:22:30,497 INFO L146 ILogger]: Interpolant automaton has 53 states [2019-05-23 09:22:30,497 INFO L146 ILogger]: Constructing interpolant automaton starting with 53 interpolants. [2019-05-23 09:22:30,497 INFO L146 ILogger]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:22:30,497 INFO L146 ILogger]: Start difference. First operand 165 states and 165 transitions. Second operand 53 states. [2019-05-23 09:22:32,181 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:32,182 INFO L146 ILogger]: Finished difference Result 175 states and 175 transitions. [2019-05-23 09:22:32,182 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-23 09:22:32,182 INFO L146 ILogger]: Start accepts. Automaton has 53 states. Word has length 164 [2019-05-23 09:22:32,183 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:32,184 INFO L146 ILogger]: With dead ends: 175 [2019-05-23 09:22:32,184 INFO L146 ILogger]: Without dead ends: 175 [2019-05-23 09:22:32,186 INFO L146 ILogger]: 0 DeclaredPredicates, 213 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:22:32,186 INFO L146 ILogger]: Start minimizeSevpa. Operand 175 states. [2019-05-23 09:22:32,189 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 175 to 171. [2019-05-23 09:22:32,189 INFO L146 ILogger]: Start removeUnreachable. Operand 171 states. [2019-05-23 09:22:32,189 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-05-23 09:22:32,190 INFO L146 ILogger]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 164 [2019-05-23 09:22:32,190 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:32,190 INFO L146 ILogger]: Abstraction has 171 states and 171 transitions. [2019-05-23 09:22:32,190 INFO L146 ILogger]: Interpolant automaton has 53 states. [2019-05-23 09:22:32,190 INFO L146 ILogger]: Start isEmpty. Operand 171 states and 171 transitions. [2019-05-23 09:22:32,191 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 171 [2019-05-23 09:22:32,191 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:32,191 INFO L146 ILogger]: trace histogram [26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:32,192 INFO L146 ILogger]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:32,192 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:32,192 INFO L146 ILogger]: Analyzing trace with hash 986900358, now seen corresponding path program 26 times [2019-05-23 09:22:32,193 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:32,210 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:32,213 INFO L146 ILogger]: Trace formula consists of 254 conjuncts, 54 conjunts are in the unsatisfiable core [2019-05-23 09:22:32,216 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:33,352 INFO L146 ILogger]: Checked inductivity of 1976 backedges. 0 proven. 1976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:33,353 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:33,353 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-05-23 09:22:33,353 INFO L146 ILogger]: Interpolant automaton has 55 states [2019-05-23 09:22:33,354 INFO L146 ILogger]: Constructing interpolant automaton starting with 55 interpolants. [2019-05-23 09:22:33,354 INFO L146 ILogger]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:22:33,354 INFO L146 ILogger]: Start difference. First operand 171 states and 171 transitions. Second operand 55 states. [2019-05-23 09:22:34,915 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:34,916 INFO L146 ILogger]: Finished difference Result 181 states and 181 transitions. [2019-05-23 09:22:34,916 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-05-23 09:22:34,916 INFO L146 ILogger]: Start accepts. Automaton has 55 states. Word has length 170 [2019-05-23 09:22:34,917 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:34,917 INFO L146 ILogger]: With dead ends: 181 [2019-05-23 09:22:34,917 INFO L146 ILogger]: Without dead ends: 181 [2019-05-23 09:22:34,918 INFO L146 ILogger]: 0 DeclaredPredicates, 221 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 09:22:34,918 INFO L146 ILogger]: Start minimizeSevpa. Operand 181 states. [2019-05-23 09:22:34,920 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 181 to 177. [2019-05-23 09:22:34,920 INFO L146 ILogger]: Start removeUnreachable. Operand 177 states. [2019-05-23 09:22:34,921 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-05-23 09:22:34,921 INFO L146 ILogger]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 170 [2019-05-23 09:22:34,921 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:34,921 INFO L146 ILogger]: Abstraction has 177 states and 177 transitions. [2019-05-23 09:22:34,922 INFO L146 ILogger]: Interpolant automaton has 55 states. [2019-05-23 09:22:34,922 INFO L146 ILogger]: Start isEmpty. Operand 177 states and 177 transitions. [2019-05-23 09:22:34,922 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 177 [2019-05-23 09:22:34,923 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:34,923 INFO L146 ILogger]: trace histogram [27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:34,923 INFO L146 ILogger]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:34,923 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:34,923 INFO L146 ILogger]: Analyzing trace with hash 1453870947, now seen corresponding path program 27 times [2019-05-23 09:22:34,924 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:34,942 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:34,945 INFO L146 ILogger]: Trace formula consists of 263 conjuncts, 56 conjunts are in the unsatisfiable core [2019-05-23 09:22:34,948 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:35,964 INFO L146 ILogger]: Checked inductivity of 2133 backedges. 0 proven. 2133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:35,965 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:35,965 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-05-23 09:22:35,965 INFO L146 ILogger]: Interpolant automaton has 57 states [2019-05-23 09:22:35,966 INFO L146 ILogger]: Constructing interpolant automaton starting with 57 interpolants. [2019-05-23 09:22:35,966 INFO L146 ILogger]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:22:35,966 INFO L146 ILogger]: Start difference. First operand 177 states and 177 transitions. Second operand 57 states. [2019-05-23 09:22:37,835 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:37,836 INFO L146 ILogger]: Finished difference Result 187 states and 187 transitions. [2019-05-23 09:22:37,836 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-23 09:22:37,836 INFO L146 ILogger]: Start accepts. Automaton has 57 states. Word has length 176 [2019-05-23 09:22:37,837 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:37,838 INFO L146 ILogger]: With dead ends: 187 [2019-05-23 09:22:37,838 INFO L146 ILogger]: Without dead ends: 187 [2019-05-23 09:22:37,839 INFO L146 ILogger]: 0 DeclaredPredicates, 229 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 09:22:37,840 INFO L146 ILogger]: Start minimizeSevpa. Operand 187 states. [2019-05-23 09:22:37,842 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 187 to 183. [2019-05-23 09:22:37,842 INFO L146 ILogger]: Start removeUnreachable. Operand 183 states. [2019-05-23 09:22:37,843 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2019-05-23 09:22:37,843 INFO L146 ILogger]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 176 [2019-05-23 09:22:37,843 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:37,843 INFO L146 ILogger]: Abstraction has 183 states and 183 transitions. [2019-05-23 09:22:37,843 INFO L146 ILogger]: Interpolant automaton has 57 states. [2019-05-23 09:22:37,843 INFO L146 ILogger]: Start isEmpty. Operand 183 states and 183 transitions. [2019-05-23 09:22:37,844 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 183 [2019-05-23 09:22:37,844 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:37,844 INFO L146 ILogger]: trace histogram [28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:37,845 INFO L146 ILogger]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:37,845 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:37,845 INFO L146 ILogger]: Analyzing trace with hash -883581568, now seen corresponding path program 28 times [2019-05-23 09:22:37,846 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:37,863 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:37,866 INFO L146 ILogger]: Trace formula consists of 272 conjuncts, 58 conjunts are in the unsatisfiable core [2019-05-23 09:22:37,869 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:38,964 INFO L146 ILogger]: Checked inductivity of 2296 backedges. 0 proven. 2296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:38,964 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:38,965 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-05-23 09:22:38,965 INFO L146 ILogger]: Interpolant automaton has 59 states [2019-05-23 09:22:38,965 INFO L146 ILogger]: Constructing interpolant automaton starting with 59 interpolants. [2019-05-23 09:22:38,966 INFO L146 ILogger]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:22:38,966 INFO L146 ILogger]: Start difference. First operand 183 states and 183 transitions. Second operand 59 states. [2019-05-23 09:22:40,758 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:40,759 INFO L146 ILogger]: Finished difference Result 193 states and 193 transitions. [2019-05-23 09:22:40,759 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-05-23 09:22:40,759 INFO L146 ILogger]: Start accepts. Automaton has 59 states. Word has length 182 [2019-05-23 09:22:40,760 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:40,761 INFO L146 ILogger]: With dead ends: 193 [2019-05-23 09:22:40,761 INFO L146 ILogger]: Without dead ends: 193 [2019-05-23 09:22:40,762 INFO L146 ILogger]: 0 DeclaredPredicates, 237 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 09:22:40,763 INFO L146 ILogger]: Start minimizeSevpa. Operand 193 states. [2019-05-23 09:22:40,765 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 193 to 189. [2019-05-23 09:22:40,765 INFO L146 ILogger]: Start removeUnreachable. Operand 189 states. [2019-05-23 09:22:40,766 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-05-23 09:22:40,766 INFO L146 ILogger]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 182 [2019-05-23 09:22:40,766 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:40,766 INFO L146 ILogger]: Abstraction has 189 states and 189 transitions. [2019-05-23 09:22:40,767 INFO L146 ILogger]: Interpolant automaton has 59 states. [2019-05-23 09:22:40,767 INFO L146 ILogger]: Start isEmpty. Operand 189 states and 189 transitions. [2019-05-23 09:22:40,768 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 189 [2019-05-23 09:22:40,768 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:40,768 INFO L146 ILogger]: trace histogram [29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:40,768 INFO L146 ILogger]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:40,768 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:40,768 INFO L146 ILogger]: Analyzing trace with hash 1852121565, now seen corresponding path program 29 times [2019-05-23 09:22:40,769 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:40,788 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:40,791 INFO L146 ILogger]: Trace formula consists of 281 conjuncts, 60 conjunts are in the unsatisfiable core [2019-05-23 09:22:40,794 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:42,606 INFO L146 ILogger]: Checked inductivity of 2465 backedges. 0 proven. 2465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:42,606 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:42,606 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-05-23 09:22:42,607 INFO L146 ILogger]: Interpolant automaton has 61 states [2019-05-23 09:22:42,607 INFO L146 ILogger]: Constructing interpolant automaton starting with 61 interpolants. [2019-05-23 09:22:42,607 INFO L146 ILogger]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:22:42,607 INFO L146 ILogger]: Start difference. First operand 189 states and 189 transitions. Second operand 61 states. [2019-05-23 09:22:44,637 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:44,638 INFO L146 ILogger]: Finished difference Result 199 states and 199 transitions. [2019-05-23 09:22:44,638 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-23 09:22:44,638 INFO L146 ILogger]: Start accepts. Automaton has 61 states. Word has length 188 [2019-05-23 09:22:44,639 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:44,639 INFO L146 ILogger]: With dead ends: 199 [2019-05-23 09:22:44,640 INFO L146 ILogger]: Without dead ends: 199 [2019-05-23 09:22:44,641 INFO L146 ILogger]: 0 DeclaredPredicates, 245 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 09:22:44,643 INFO L146 ILogger]: Start minimizeSevpa. Operand 199 states. [2019-05-23 09:22:44,645 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 199 to 195. [2019-05-23 09:22:44,645 INFO L146 ILogger]: Start removeUnreachable. Operand 195 states. [2019-05-23 09:22:44,646 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2019-05-23 09:22:44,646 INFO L146 ILogger]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 188 [2019-05-23 09:22:44,646 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:44,647 INFO L146 ILogger]: Abstraction has 195 states and 195 transitions. [2019-05-23 09:22:44,647 INFO L146 ILogger]: Interpolant automaton has 61 states. [2019-05-23 09:22:44,647 INFO L146 ILogger]: Start isEmpty. Operand 195 states and 195 transitions. [2019-05-23 09:22:44,648 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 195 [2019-05-23 09:22:44,648 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:44,648 INFO L146 ILogger]: trace histogram [30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:44,648 INFO L146 ILogger]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:44,648 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:44,648 INFO L146 ILogger]: Analyzing trace with hash 946154618, now seen corresponding path program 30 times [2019-05-23 09:22:44,649 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:44,670 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:44,672 INFO L146 ILogger]: Trace formula consists of 290 conjuncts, 62 conjunts are in the unsatisfiable core [2019-05-23 09:22:44,676 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:45,813 INFO L146 ILogger]: Checked inductivity of 2640 backedges. 0 proven. 2640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:45,814 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:45,814 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-05-23 09:22:45,814 INFO L146 ILogger]: Interpolant automaton has 63 states [2019-05-23 09:22:45,815 INFO L146 ILogger]: Constructing interpolant automaton starting with 63 interpolants. [2019-05-23 09:22:45,815 INFO L146 ILogger]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:22:45,815 INFO L146 ILogger]: Start difference. First operand 195 states and 195 transitions. Second operand 63 states. [2019-05-23 09:22:49,087 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:49,088 INFO L146 ILogger]: Finished difference Result 205 states and 205 transitions. [2019-05-23 09:22:49,088 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-05-23 09:22:49,088 INFO L146 ILogger]: Start accepts. Automaton has 63 states. Word has length 194 [2019-05-23 09:22:49,089 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:49,090 INFO L146 ILogger]: With dead ends: 205 [2019-05-23 09:22:49,090 INFO L146 ILogger]: Without dead ends: 205 [2019-05-23 09:22:49,091 INFO L146 ILogger]: 0 DeclaredPredicates, 253 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2019-05-23 09:22:49,091 INFO L146 ILogger]: Start minimizeSevpa. Operand 205 states. [2019-05-23 09:22:49,093 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 205 to 201. [2019-05-23 09:22:49,093 INFO L146 ILogger]: Start removeUnreachable. Operand 201 states. [2019-05-23 09:22:49,094 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-05-23 09:22:49,094 INFO L146 ILogger]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 194 [2019-05-23 09:22:49,095 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:49,095 INFO L146 ILogger]: Abstraction has 201 states and 201 transitions. [2019-05-23 09:22:49,095 INFO L146 ILogger]: Interpolant automaton has 63 states. [2019-05-23 09:22:49,095 INFO L146 ILogger]: Start isEmpty. Operand 201 states and 201 transitions. [2019-05-23 09:22:49,096 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 201 [2019-05-23 09:22:49,096 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:49,096 INFO L146 ILogger]: trace histogram [31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:49,096 INFO L146 ILogger]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:49,097 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:49,097 INFO L146 ILogger]: Analyzing trace with hash -236450473, now seen corresponding path program 31 times [2019-05-23 09:22:49,097 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:49,117 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:49,120 INFO L146 ILogger]: Trace formula consists of 299 conjuncts, 64 conjunts are in the unsatisfiable core [2019-05-23 09:22:49,123 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:50,748 INFO L146 ILogger]: Checked inductivity of 2821 backedges. 0 proven. 2821 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:50,748 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:50,748 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-05-23 09:22:50,749 INFO L146 ILogger]: Interpolant automaton has 65 states [2019-05-23 09:22:50,749 INFO L146 ILogger]: Constructing interpolant automaton starting with 65 interpolants. [2019-05-23 09:22:50,749 INFO L146 ILogger]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:22:50,749 INFO L146 ILogger]: Start difference. First operand 201 states and 201 transitions. Second operand 65 states. [2019-05-23 09:22:53,054 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:53,054 INFO L146 ILogger]: Finished difference Result 211 states and 211 transitions. [2019-05-23 09:22:53,054 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-05-23 09:22:53,054 INFO L146 ILogger]: Start accepts. Automaton has 65 states. Word has length 200 [2019-05-23 09:22:53,055 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:53,056 INFO L146 ILogger]: With dead ends: 211 [2019-05-23 09:22:53,057 INFO L146 ILogger]: Without dead ends: 211 [2019-05-23 09:22:53,058 INFO L146 ILogger]: 0 DeclaredPredicates, 261 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 09:22:53,059 INFO L146 ILogger]: Start minimizeSevpa. Operand 211 states. [2019-05-23 09:22:53,061 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 211 to 207. [2019-05-23 09:22:53,061 INFO L146 ILogger]: Start removeUnreachable. Operand 207 states. [2019-05-23 09:22:53,062 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2019-05-23 09:22:53,062 INFO L146 ILogger]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 200 [2019-05-23 09:22:53,063 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:53,063 INFO L146 ILogger]: Abstraction has 207 states and 207 transitions. [2019-05-23 09:22:53,063 INFO L146 ILogger]: Interpolant automaton has 65 states. [2019-05-23 09:22:53,063 INFO L146 ILogger]: Start isEmpty. Operand 207 states and 207 transitions. [2019-05-23 09:22:53,064 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 207 [2019-05-23 09:22:53,064 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:53,064 INFO L146 ILogger]: trace histogram [32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:53,064 INFO L146 ILogger]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:53,065 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:53,065 INFO L146 ILogger]: Analyzing trace with hash 545526900, now seen corresponding path program 32 times [2019-05-23 09:22:53,065 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:53,083 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:53,086 INFO L146 ILogger]: Trace formula consists of 308 conjuncts, 66 conjunts are in the unsatisfiable core [2019-05-23 09:22:53,090 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:54,398 INFO L146 ILogger]: Checked inductivity of 3008 backedges. 0 proven. 3008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:54,399 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:54,399 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-05-23 09:22:54,399 INFO L146 ILogger]: Interpolant automaton has 67 states [2019-05-23 09:22:54,400 INFO L146 ILogger]: Constructing interpolant automaton starting with 67 interpolants. [2019-05-23 09:22:54,400 INFO L146 ILogger]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:22:54,400 INFO L146 ILogger]: Start difference. First operand 207 states and 207 transitions. Second operand 67 states. [2019-05-23 09:22:57,001 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:57,001 INFO L146 ILogger]: Finished difference Result 217 states and 217 transitions. [2019-05-23 09:22:57,001 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-05-23 09:22:57,002 INFO L146 ILogger]: Start accepts. Automaton has 67 states. Word has length 206 [2019-05-23 09:22:57,002 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:57,003 INFO L146 ILogger]: With dead ends: 217 [2019-05-23 09:22:57,003 INFO L146 ILogger]: Without dead ends: 217 [2019-05-23 09:22:57,005 INFO L146 ILogger]: 0 DeclaredPredicates, 269 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 09:22:57,005 INFO L146 ILogger]: Start minimizeSevpa. Operand 217 states. [2019-05-23 09:22:57,007 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 217 to 213. [2019-05-23 09:22:57,008 INFO L146 ILogger]: Start removeUnreachable. Operand 213 states. [2019-05-23 09:22:57,008 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-05-23 09:22:57,008 INFO L146 ILogger]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 206 [2019-05-23 09:22:57,009 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:57,009 INFO L146 ILogger]: Abstraction has 213 states and 213 transitions. [2019-05-23 09:22:57,009 INFO L146 ILogger]: Interpolant automaton has 67 states. [2019-05-23 09:22:57,009 INFO L146 ILogger]: Start isEmpty. Operand 213 states and 213 transitions. [2019-05-23 09:22:57,010 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 213 [2019-05-23 09:22:57,010 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:57,010 INFO L146 ILogger]: trace histogram [33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:57,010 INFO L146 ILogger]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:57,010 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:57,011 INFO L146 ILogger]: Analyzing trace with hash 869503441, now seen corresponding path program 33 times [2019-05-23 09:22:57,011 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:57,030 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:57,033 INFO L146 ILogger]: Trace formula consists of 317 conjuncts, 68 conjunts are in the unsatisfiable core [2019-05-23 09:22:57,036 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:58,383 INFO L146 ILogger]: Checked inductivity of 3201 backedges. 0 proven. 3201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:58,383 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:58,384 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-05-23 09:22:58,384 INFO L146 ILogger]: Interpolant automaton has 69 states [2019-05-23 09:22:58,385 INFO L146 ILogger]: Constructing interpolant automaton starting with 69 interpolants. [2019-05-23 09:22:58,385 INFO L146 ILogger]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:22:58,385 INFO L146 ILogger]: Start difference. First operand 213 states and 213 transitions. Second operand 69 states. [2019-05-23 09:23:00,931 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:00,932 INFO L146 ILogger]: Finished difference Result 223 states and 223 transitions. [2019-05-23 09:23:00,932 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-05-23 09:23:00,932 INFO L146 ILogger]: Start accepts. Automaton has 69 states. Word has length 212 [2019-05-23 09:23:00,933 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:00,934 INFO L146 ILogger]: With dead ends: 223 [2019-05-23 09:23:00,934 INFO L146 ILogger]: Without dead ends: 223 [2019-05-23 09:23:00,935 INFO L146 ILogger]: 0 DeclaredPredicates, 277 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2019-05-23 09:23:00,935 INFO L146 ILogger]: Start minimizeSevpa. Operand 223 states. [2019-05-23 09:23:00,938 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 223 to 219. [2019-05-23 09:23:00,938 INFO L146 ILogger]: Start removeUnreachable. Operand 219 states. [2019-05-23 09:23:00,939 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2019-05-23 09:23:00,939 INFO L146 ILogger]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 212 [2019-05-23 09:23:00,939 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:00,939 INFO L146 ILogger]: Abstraction has 219 states and 219 transitions. [2019-05-23 09:23:00,939 INFO L146 ILogger]: Interpolant automaton has 69 states. [2019-05-23 09:23:00,939 INFO L146 ILogger]: Start isEmpty. Operand 219 states and 219 transitions. [2019-05-23 09:23:00,940 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 219 [2019-05-23 09:23:00,940 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:00,941 INFO L146 ILogger]: trace histogram [34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:00,941 INFO L146 ILogger]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:00,941 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:00,941 INFO L146 ILogger]: Analyzing trace with hash -227224210, now seen corresponding path program 34 times [2019-05-23 09:23:00,942 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:00,962 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:00,965 INFO L146 ILogger]: Trace formula consists of 326 conjuncts, 70 conjunts are in the unsatisfiable core [2019-05-23 09:23:00,968 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:02,606 INFO L146 ILogger]: Checked inductivity of 3400 backedges. 0 proven. 3400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:02,606 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:02,606 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-05-23 09:23:02,607 INFO L146 ILogger]: Interpolant automaton has 71 states [2019-05-23 09:23:02,607 INFO L146 ILogger]: Constructing interpolant automaton starting with 71 interpolants. [2019-05-23 09:23:02,607 INFO L146 ILogger]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:23:02,607 INFO L146 ILogger]: Start difference. First operand 219 states and 219 transitions. Second operand 71 states. [2019-05-23 09:23:05,068 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:05,068 INFO L146 ILogger]: Finished difference Result 229 states and 229 transitions. [2019-05-23 09:23:05,069 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-05-23 09:23:05,069 INFO L146 ILogger]: Start accepts. Automaton has 71 states. Word has length 218 [2019-05-23 09:23:05,069 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:05,071 INFO L146 ILogger]: With dead ends: 229 [2019-05-23 09:23:05,071 INFO L146 ILogger]: Without dead ends: 229 [2019-05-23 09:23:05,072 INFO L146 ILogger]: 0 DeclaredPredicates, 285 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2019-05-23 09:23:05,072 INFO L146 ILogger]: Start minimizeSevpa. Operand 229 states. [2019-05-23 09:23:05,074 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 229 to 225. [2019-05-23 09:23:05,074 INFO L146 ILogger]: Start removeUnreachable. Operand 225 states. [2019-05-23 09:23:05,074 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-05-23 09:23:05,074 INFO L146 ILogger]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 218 [2019-05-23 09:23:05,075 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:05,075 INFO L146 ILogger]: Abstraction has 225 states and 225 transitions. [2019-05-23 09:23:05,075 INFO L146 ILogger]: Interpolant automaton has 71 states. [2019-05-23 09:23:05,075 INFO L146 ILogger]: Start isEmpty. Operand 225 states and 225 transitions. [2019-05-23 09:23:05,076 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 225 [2019-05-23 09:23:05,076 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:05,076 INFO L146 ILogger]: trace histogram [35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:05,076 INFO L146 ILogger]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:05,076 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:05,076 INFO L146 ILogger]: Analyzing trace with hash 654978891, now seen corresponding path program 35 times [2019-05-23 09:23:05,077 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:05,097 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:05,100 INFO L146 ILogger]: Trace formula consists of 335 conjuncts, 72 conjunts are in the unsatisfiable core [2019-05-23 09:23:05,104 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:06,787 INFO L146 ILogger]: Checked inductivity of 3605 backedges. 0 proven. 3605 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:06,787 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:06,787 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-05-23 09:23:06,787 INFO L146 ILogger]: Interpolant automaton has 73 states [2019-05-23 09:23:06,788 INFO L146 ILogger]: Constructing interpolant automaton starting with 73 interpolants. [2019-05-23 09:23:06,788 INFO L146 ILogger]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:23:06,788 INFO L146 ILogger]: Start difference. First operand 225 states and 225 transitions. Second operand 73 states. [2019-05-23 09:23:09,626 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:09,626 INFO L146 ILogger]: Finished difference Result 235 states and 235 transitions. [2019-05-23 09:23:09,627 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-05-23 09:23:09,627 INFO L146 ILogger]: Start accepts. Automaton has 73 states. Word has length 224 [2019-05-23 09:23:09,627 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:09,629 INFO L146 ILogger]: With dead ends: 235 [2019-05-23 09:23:09,629 INFO L146 ILogger]: Without dead ends: 235 [2019-05-23 09:23:09,630 INFO L146 ILogger]: 0 DeclaredPredicates, 293 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2019-05-23 09:23:09,630 INFO L146 ILogger]: Start minimizeSevpa. Operand 235 states. [2019-05-23 09:23:09,632 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 235 to 231. [2019-05-23 09:23:09,632 INFO L146 ILogger]: Start removeUnreachable. Operand 231 states. [2019-05-23 09:23:09,633 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-05-23 09:23:09,633 INFO L146 ILogger]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 224 [2019-05-23 09:23:09,633 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:09,633 INFO L146 ILogger]: Abstraction has 231 states and 231 transitions. [2019-05-23 09:23:09,633 INFO L146 ILogger]: Interpolant automaton has 73 states. [2019-05-23 09:23:09,634 INFO L146 ILogger]: Start isEmpty. Operand 231 states and 231 transitions. [2019-05-23 09:23:09,635 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 231 [2019-05-23 09:23:09,635 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:09,635 INFO L146 ILogger]: trace histogram [36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:09,635 INFO L146 ILogger]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:09,635 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:09,636 INFO L146 ILogger]: Analyzing trace with hash -1925583000, now seen corresponding path program 36 times [2019-05-23 09:23:09,636 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:09,657 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:09,660 INFO L146 ILogger]: Trace formula consists of 344 conjuncts, 74 conjunts are in the unsatisfiable core [2019-05-23 09:23:09,664 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:11,726 INFO L146 ILogger]: Checked inductivity of 3816 backedges. 0 proven. 3816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:11,726 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:11,726 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-05-23 09:23:11,727 INFO L146 ILogger]: Interpolant automaton has 75 states [2019-05-23 09:23:11,727 INFO L146 ILogger]: Constructing interpolant automaton starting with 75 interpolants. [2019-05-23 09:23:11,728 INFO L146 ILogger]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:23:11,728 INFO L146 ILogger]: Start difference. First operand 231 states and 231 transitions. Second operand 75 states. [2019-05-23 09:23:14,752 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:14,753 INFO L146 ILogger]: Finished difference Result 241 states and 241 transitions. [2019-05-23 09:23:14,753 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-05-23 09:23:14,753 INFO L146 ILogger]: Start accepts. Automaton has 75 states. Word has length 230 [2019-05-23 09:23:14,754 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:14,755 INFO L146 ILogger]: With dead ends: 241 [2019-05-23 09:23:14,755 INFO L146 ILogger]: Without dead ends: 241 [2019-05-23 09:23:14,756 INFO L146 ILogger]: 0 DeclaredPredicates, 301 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2019-05-23 09:23:14,756 INFO L146 ILogger]: Start minimizeSevpa. Operand 241 states. [2019-05-23 09:23:14,758 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 241 to 237. [2019-05-23 09:23:14,758 INFO L146 ILogger]: Start removeUnreachable. Operand 237 states. [2019-05-23 09:23:14,759 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-05-23 09:23:14,759 INFO L146 ILogger]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 230 [2019-05-23 09:23:14,759 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:14,759 INFO L146 ILogger]: Abstraction has 237 states and 237 transitions. [2019-05-23 09:23:14,760 INFO L146 ILogger]: Interpolant automaton has 75 states. [2019-05-23 09:23:14,760 INFO L146 ILogger]: Start isEmpty. Operand 237 states and 237 transitions. [2019-05-23 09:23:14,761 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 237 [2019-05-23 09:23:14,761 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:14,761 INFO L146 ILogger]: trace histogram [37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:14,761 INFO L146 ILogger]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:14,761 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:14,762 INFO L146 ILogger]: Analyzing trace with hash -22125115, now seen corresponding path program 37 times [2019-05-23 09:23:14,762 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:14,783 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:14,786 INFO L146 ILogger]: Trace formula consists of 353 conjuncts, 76 conjunts are in the unsatisfiable core [2019-05-23 09:23:14,790 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:16,609 INFO L146 ILogger]: Checked inductivity of 4033 backedges. 0 proven. 4033 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:16,610 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:16,610 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-05-23 09:23:16,610 INFO L146 ILogger]: Interpolant automaton has 77 states [2019-05-23 09:23:16,611 INFO L146 ILogger]: Constructing interpolant automaton starting with 77 interpolants. [2019-05-23 09:23:16,611 INFO L146 ILogger]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:23:16,611 INFO L146 ILogger]: Start difference. First operand 237 states and 237 transitions. Second operand 77 states. [2019-05-23 09:23:19,749 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:19,749 INFO L146 ILogger]: Finished difference Result 247 states and 247 transitions. [2019-05-23 09:23:19,749 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-05-23 09:23:19,749 INFO L146 ILogger]: Start accepts. Automaton has 77 states. Word has length 236 [2019-05-23 09:23:19,750 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:19,751 INFO L146 ILogger]: With dead ends: 247 [2019-05-23 09:23:19,751 INFO L146 ILogger]: Without dead ends: 247 [2019-05-23 09:23:19,753 INFO L146 ILogger]: 0 DeclaredPredicates, 309 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2019-05-23 09:23:19,753 INFO L146 ILogger]: Start minimizeSevpa. Operand 247 states. [2019-05-23 09:23:19,755 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 247 to 243. [2019-05-23 09:23:19,755 INFO L146 ILogger]: Start removeUnreachable. Operand 243 states. [2019-05-23 09:23:19,755 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2019-05-23 09:23:19,755 INFO L146 ILogger]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 236 [2019-05-23 09:23:19,756 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:19,756 INFO L146 ILogger]: Abstraction has 243 states and 243 transitions. [2019-05-23 09:23:19,756 INFO L146 ILogger]: Interpolant automaton has 77 states. [2019-05-23 09:23:19,756 INFO L146 ILogger]: Start isEmpty. Operand 243 states and 243 transitions. [2019-05-23 09:23:19,757 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 243 [2019-05-23 09:23:19,757 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:19,757 INFO L146 ILogger]: trace histogram [38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:19,757 INFO L146 ILogger]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:19,757 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:19,757 INFO L146 ILogger]: Analyzing trace with hash -535436702, now seen corresponding path program 38 times [2019-05-23 09:23:19,758 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:19,779 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:19,783 INFO L146 ILogger]: Trace formula consists of 362 conjuncts, 78 conjunts are in the unsatisfiable core [2019-05-23 09:23:19,787 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:21,656 INFO L146 ILogger]: Checked inductivity of 4256 backedges. 0 proven. 4256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:21,657 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:21,657 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-05-23 09:23:21,658 INFO L146 ILogger]: Interpolant automaton has 79 states [2019-05-23 09:23:21,658 INFO L146 ILogger]: Constructing interpolant automaton starting with 79 interpolants. [2019-05-23 09:23:21,659 INFO L146 ILogger]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:23:21,659 INFO L146 ILogger]: Start difference. First operand 243 states and 243 transitions. Second operand 79 states. [2019-05-23 09:23:24,964 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:24,965 INFO L146 ILogger]: Finished difference Result 253 states and 253 transitions. [2019-05-23 09:23:24,965 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-05-23 09:23:24,965 INFO L146 ILogger]: Start accepts. Automaton has 79 states. Word has length 242 [2019-05-23 09:23:24,966 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:24,967 INFO L146 ILogger]: With dead ends: 253 [2019-05-23 09:23:24,967 INFO L146 ILogger]: Without dead ends: 253 [2019-05-23 09:23:24,969 INFO L146 ILogger]: 0 DeclaredPredicates, 317 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2019-05-23 09:23:24,969 INFO L146 ILogger]: Start minimizeSevpa. Operand 253 states. [2019-05-23 09:23:24,972 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 253 to 249. [2019-05-23 09:23:24,972 INFO L146 ILogger]: Start removeUnreachable. Operand 249 states. [2019-05-23 09:23:24,972 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-05-23 09:23:24,972 INFO L146 ILogger]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 242 [2019-05-23 09:23:24,973 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:24,973 INFO L146 ILogger]: Abstraction has 249 states and 249 transitions. [2019-05-23 09:23:24,973 INFO L146 ILogger]: Interpolant automaton has 79 states. [2019-05-23 09:23:24,973 INFO L146 ILogger]: Start isEmpty. Operand 249 states and 249 transitions. [2019-05-23 09:23:24,974 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 249 [2019-05-23 09:23:24,974 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:24,974 INFO L146 ILogger]: trace histogram [39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:24,975 INFO L146 ILogger]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:24,975 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:24,975 INFO L146 ILogger]: Analyzing trace with hash -836586177, now seen corresponding path program 39 times [2019-05-23 09:23:24,976 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:24,999 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:25,002 INFO L146 ILogger]: Trace formula consists of 371 conjuncts, 80 conjunts are in the unsatisfiable core [2019-05-23 09:23:25,006 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:26,892 INFO L146 ILogger]: Checked inductivity of 4485 backedges. 0 proven. 4485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:26,892 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:26,892 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-05-23 09:23:26,893 INFO L146 ILogger]: Interpolant automaton has 81 states [2019-05-23 09:23:26,893 INFO L146 ILogger]: Constructing interpolant automaton starting with 81 interpolants. [2019-05-23 09:23:26,894 INFO L146 ILogger]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:23:26,894 INFO L146 ILogger]: Start difference. First operand 249 states and 249 transitions. Second operand 81 states. [2019-05-23 09:23:30,379 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:30,380 INFO L146 ILogger]: Finished difference Result 259 states and 259 transitions. [2019-05-23 09:23:30,380 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-05-23 09:23:30,380 INFO L146 ILogger]: Start accepts. Automaton has 81 states. Word has length 248 [2019-05-23 09:23:30,380 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:30,381 INFO L146 ILogger]: With dead ends: 259 [2019-05-23 09:23:30,381 INFO L146 ILogger]: Without dead ends: 259 [2019-05-23 09:23:30,383 INFO L146 ILogger]: 0 DeclaredPredicates, 325 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2019-05-23 09:23:30,383 INFO L146 ILogger]: Start minimizeSevpa. Operand 259 states. [2019-05-23 09:23:30,386 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 259 to 255. [2019-05-23 09:23:30,386 INFO L146 ILogger]: Start removeUnreachable. Operand 255 states. [2019-05-23 09:23:30,386 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2019-05-23 09:23:30,386 INFO L146 ILogger]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 248 [2019-05-23 09:23:30,387 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:30,387 INFO L146 ILogger]: Abstraction has 255 states and 255 transitions. [2019-05-23 09:23:30,387 INFO L146 ILogger]: Interpolant automaton has 81 states. [2019-05-23 09:23:30,387 INFO L146 ILogger]: Start isEmpty. Operand 255 states and 255 transitions. [2019-05-23 09:23:30,388 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 255 [2019-05-23 09:23:30,388 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:30,388 INFO L146 ILogger]: trace histogram [40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:30,389 INFO L146 ILogger]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:30,389 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:30,389 INFO L146 ILogger]: Analyzing trace with hash -1970590116, now seen corresponding path program 40 times [2019-05-23 09:23:30,390 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:30,412 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:30,416 INFO L146 ILogger]: Trace formula consists of 380 conjuncts, 82 conjunts are in the unsatisfiable core [2019-05-23 09:23:30,420 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:32,389 INFO L146 ILogger]: Checked inductivity of 4720 backedges. 0 proven. 4720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:32,390 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:32,390 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-05-23 09:23:32,390 INFO L146 ILogger]: Interpolant automaton has 83 states [2019-05-23 09:23:32,391 INFO L146 ILogger]: Constructing interpolant automaton starting with 83 interpolants. [2019-05-23 09:23:32,391 INFO L146 ILogger]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:23:32,392 INFO L146 ILogger]: Start difference. First operand 255 states and 255 transitions. Second operand 83 states. [2019-05-23 09:23:36,063 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:36,064 INFO L146 ILogger]: Finished difference Result 265 states and 265 transitions. [2019-05-23 09:23:36,064 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-05-23 09:23:36,064 INFO L146 ILogger]: Start accepts. Automaton has 83 states. Word has length 254 [2019-05-23 09:23:36,064 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:36,065 INFO L146 ILogger]: With dead ends: 265 [2019-05-23 09:23:36,065 INFO L146 ILogger]: Without dead ends: 265 [2019-05-23 09:23:36,066 INFO L146 ILogger]: 0 DeclaredPredicates, 333 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2019-05-23 09:23:36,066 INFO L146 ILogger]: Start minimizeSevpa. Operand 265 states. [2019-05-23 09:23:36,069 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 265 to 261. [2019-05-23 09:23:36,069 INFO L146 ILogger]: Start removeUnreachable. Operand 261 states. [2019-05-23 09:23:36,069 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-05-23 09:23:36,069 INFO L146 ILogger]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 254 [2019-05-23 09:23:36,070 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:36,070 INFO L146 ILogger]: Abstraction has 261 states and 261 transitions. [2019-05-23 09:23:36,070 INFO L146 ILogger]: Interpolant automaton has 83 states. [2019-05-23 09:23:36,070 INFO L146 ILogger]: Start isEmpty. Operand 261 states and 261 transitions. [2019-05-23 09:23:36,071 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 261 [2019-05-23 09:23:36,071 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:36,072 INFO L146 ILogger]: trace histogram [41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:36,072 INFO L146 ILogger]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:36,072 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:36,072 INFO L146 ILogger]: Analyzing trace with hash 688496057, now seen corresponding path program 41 times [2019-05-23 09:23:36,073 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:36,096 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:36,101 INFO L146 ILogger]: Trace formula consists of 389 conjuncts, 84 conjunts are in the unsatisfiable core [2019-05-23 09:23:36,105 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:39,119 INFO L146 ILogger]: Checked inductivity of 4961 backedges. 0 proven. 4961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:39,119 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:39,120 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-05-23 09:23:39,120 INFO L146 ILogger]: Interpolant automaton has 85 states [2019-05-23 09:23:39,120 INFO L146 ILogger]: Constructing interpolant automaton starting with 85 interpolants. [2019-05-23 09:23:39,121 INFO L146 ILogger]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:23:39,121 INFO L146 ILogger]: Start difference. First operand 261 states and 261 transitions. Second operand 85 states. [2019-05-23 09:23:42,552 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:42,552 INFO L146 ILogger]: Finished difference Result 271 states and 271 transitions. [2019-05-23 09:23:42,552 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-05-23 09:23:42,552 INFO L146 ILogger]: Start accepts. Automaton has 85 states. Word has length 260 [2019-05-23 09:23:42,553 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:42,555 INFO L146 ILogger]: With dead ends: 271 [2019-05-23 09:23:42,555 INFO L146 ILogger]: Without dead ends: 271 [2019-05-23 09:23:42,556 INFO L146 ILogger]: 0 DeclaredPredicates, 341 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2019-05-23 09:23:42,556 INFO L146 ILogger]: Start minimizeSevpa. Operand 271 states. [2019-05-23 09:23:42,558 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 271 to 267. [2019-05-23 09:23:42,559 INFO L146 ILogger]: Start removeUnreachable. Operand 267 states. [2019-05-23 09:23:42,559 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2019-05-23 09:23:42,559 INFO L146 ILogger]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 260 [2019-05-23 09:23:42,559 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:42,560 INFO L146 ILogger]: Abstraction has 267 states and 267 transitions. [2019-05-23 09:23:42,560 INFO L146 ILogger]: Interpolant automaton has 85 states. [2019-05-23 09:23:42,560 INFO L146 ILogger]: Start isEmpty. Operand 267 states and 267 transitions. [2019-05-23 09:23:42,561 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 267 [2019-05-23 09:23:42,561 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:42,561 INFO L146 ILogger]: trace histogram [42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:42,561 INFO L146 ILogger]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:42,562 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:42,562 INFO L146 ILogger]: Analyzing trace with hash 2086425430, now seen corresponding path program 42 times [2019-05-23 09:23:42,562 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:42,586 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:42,590 INFO L146 ILogger]: Trace formula consists of 398 conjuncts, 86 conjunts are in the unsatisfiable core [2019-05-23 09:23:42,593 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:44,788 INFO L146 ILogger]: Checked inductivity of 5208 backedges. 0 proven. 5208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:44,788 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:44,788 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-05-23 09:23:44,788 INFO L146 ILogger]: Interpolant automaton has 87 states [2019-05-23 09:23:44,789 INFO L146 ILogger]: Constructing interpolant automaton starting with 87 interpolants. [2019-05-23 09:23:44,789 INFO L146 ILogger]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:23:44,789 INFO L146 ILogger]: Start difference. First operand 267 states and 267 transitions. Second operand 87 states. [2019-05-23 09:23:48,845 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:48,845 INFO L146 ILogger]: Finished difference Result 277 states and 277 transitions. [2019-05-23 09:23:48,845 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-05-23 09:23:48,846 INFO L146 ILogger]: Start accepts. Automaton has 87 states. Word has length 266 [2019-05-23 09:23:48,846 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:48,847 INFO L146 ILogger]: With dead ends: 277 [2019-05-23 09:23:48,848 INFO L146 ILogger]: Without dead ends: 277 [2019-05-23 09:23:48,849 INFO L146 ILogger]: 0 DeclaredPredicates, 349 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2019-05-23 09:23:48,849 INFO L146 ILogger]: Start minimizeSevpa. Operand 277 states. [2019-05-23 09:23:48,852 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 277 to 273. [2019-05-23 09:23:48,852 INFO L146 ILogger]: Start removeUnreachable. Operand 273 states. [2019-05-23 09:23:48,852 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-05-23 09:23:48,852 INFO L146 ILogger]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 266 [2019-05-23 09:23:48,853 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:48,853 INFO L146 ILogger]: Abstraction has 273 states and 273 transitions. [2019-05-23 09:23:48,853 INFO L146 ILogger]: Interpolant automaton has 87 states. [2019-05-23 09:23:48,853 INFO L146 ILogger]: Start isEmpty. Operand 273 states and 273 transitions. [2019-05-23 09:23:48,854 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 273 [2019-05-23 09:23:48,854 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:48,855 INFO L146 ILogger]: trace histogram [43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:48,855 INFO L146 ILogger]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:48,855 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:48,855 INFO L146 ILogger]: Analyzing trace with hash -1018847437, now seen corresponding path program 43 times [2019-05-23 09:23:48,856 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:48,879 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:48,883 INFO L146 ILogger]: Trace formula consists of 407 conjuncts, 88 conjunts are in the unsatisfiable core [2019-05-23 09:23:48,887 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:51,269 INFO L146 ILogger]: Checked inductivity of 5461 backedges. 0 proven. 5461 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:51,270 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:51,270 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-05-23 09:23:51,270 INFO L146 ILogger]: Interpolant automaton has 89 states [2019-05-23 09:23:51,271 INFO L146 ILogger]: Constructing interpolant automaton starting with 89 interpolants. [2019-05-23 09:23:51,271 INFO L146 ILogger]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:23:51,271 INFO L146 ILogger]: Start difference. First operand 273 states and 273 transitions. Second operand 89 states. [2019-05-23 09:23:55,443 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:55,443 INFO L146 ILogger]: Finished difference Result 283 states and 283 transitions. [2019-05-23 09:23:55,444 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-05-23 09:23:55,444 INFO L146 ILogger]: Start accepts. Automaton has 89 states. Word has length 272 [2019-05-23 09:23:55,444 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:55,446 INFO L146 ILogger]: With dead ends: 283 [2019-05-23 09:23:55,446 INFO L146 ILogger]: Without dead ends: 283 [2019-05-23 09:23:55,448 INFO L146 ILogger]: 0 DeclaredPredicates, 357 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2019-05-23 09:23:55,448 INFO L146 ILogger]: Start minimizeSevpa. Operand 283 states. [2019-05-23 09:23:55,451 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 283 to 279. [2019-05-23 09:23:55,451 INFO L146 ILogger]: Start removeUnreachable. Operand 279 states. [2019-05-23 09:23:55,451 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2019-05-23 09:23:55,452 INFO L146 ILogger]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 272 [2019-05-23 09:23:55,452 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:55,452 INFO L146 ILogger]: Abstraction has 279 states and 279 transitions. [2019-05-23 09:23:55,452 INFO L146 ILogger]: Interpolant automaton has 89 states. [2019-05-23 09:23:55,452 INFO L146 ILogger]: Start isEmpty. Operand 279 states and 279 transitions. [2019-05-23 09:23:55,453 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 279 [2019-05-23 09:23:55,454 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:55,454 INFO L146 ILogger]: trace histogram [44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:55,454 INFO L146 ILogger]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:55,454 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:55,454 INFO L146 ILogger]: Analyzing trace with hash -1785999024, now seen corresponding path program 44 times [2019-05-23 09:23:55,455 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:55,480 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:55,484 INFO L146 ILogger]: Trace formula consists of 416 conjuncts, 90 conjunts are in the unsatisfiable core [2019-05-23 09:23:55,488 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:57,935 INFO L146 ILogger]: Checked inductivity of 5720 backedges. 0 proven. 5720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:57,935 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:57,935 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-05-23 09:23:57,936 INFO L146 ILogger]: Interpolant automaton has 91 states [2019-05-23 09:23:57,936 INFO L146 ILogger]: Constructing interpolant automaton starting with 91 interpolants. [2019-05-23 09:23:57,936 INFO L146 ILogger]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:23:57,936 INFO L146 ILogger]: Start difference. First operand 279 states and 279 transitions. Second operand 91 states. [2019-05-23 09:24:02,090 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:02,090 INFO L146 ILogger]: Finished difference Result 289 states and 289 transitions. [2019-05-23 09:24:02,090 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-05-23 09:24:02,090 INFO L146 ILogger]: Start accepts. Automaton has 91 states. Word has length 278 [2019-05-23 09:24:02,091 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:02,092 INFO L146 ILogger]: With dead ends: 289 [2019-05-23 09:24:02,092 INFO L146 ILogger]: Without dead ends: 289 [2019-05-23 09:24:02,094 INFO L146 ILogger]: 0 DeclaredPredicates, 365 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2019-05-23 09:24:02,095 INFO L146 ILogger]: Start minimizeSevpa. Operand 289 states. [2019-05-23 09:24:02,097 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 289 to 285. [2019-05-23 09:24:02,097 INFO L146 ILogger]: Start removeUnreachable. Operand 285 states. [2019-05-23 09:24:02,098 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-05-23 09:24:02,098 INFO L146 ILogger]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 278 [2019-05-23 09:24:02,098 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:02,098 INFO L146 ILogger]: Abstraction has 285 states and 285 transitions. [2019-05-23 09:24:02,098 INFO L146 ILogger]: Interpolant automaton has 91 states. [2019-05-23 09:24:02,098 INFO L146 ILogger]: Start isEmpty. Operand 285 states and 285 transitions. [2019-05-23 09:24:02,100 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 285 [2019-05-23 09:24:02,100 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:02,100 INFO L146 ILogger]: trace histogram [45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:02,100 INFO L146 ILogger]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:02,101 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:02,101 INFO L146 ILogger]: Analyzing trace with hash 284768685, now seen corresponding path program 45 times [2019-05-23 09:24:02,102 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:02,125 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:02,130 INFO L146 ILogger]: Trace formula consists of 425 conjuncts, 92 conjunts are in the unsatisfiable core [2019-05-23 09:24:02,134 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:05,264 INFO L146 ILogger]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:05,265 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:05,265 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-05-23 09:24:05,265 INFO L146 ILogger]: Interpolant automaton has 93 states [2019-05-23 09:24:05,266 INFO L146 ILogger]: Constructing interpolant automaton starting with 93 interpolants. [2019-05-23 09:24:05,266 INFO L146 ILogger]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:24:05,266 INFO L146 ILogger]: Start difference. First operand 285 states and 285 transitions. Second operand 93 states. [2019-05-23 09:24:09,578 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:09,578 INFO L146 ILogger]: Finished difference Result 295 states and 295 transitions. [2019-05-23 09:24:09,579 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-05-23 09:24:09,579 INFO L146 ILogger]: Start accepts. Automaton has 93 states. Word has length 284 [2019-05-23 09:24:09,579 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:09,581 INFO L146 ILogger]: With dead ends: 295 [2019-05-23 09:24:09,581 INFO L146 ILogger]: Without dead ends: 295 [2019-05-23 09:24:09,582 INFO L146 ILogger]: 0 DeclaredPredicates, 373 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2019-05-23 09:24:09,582 INFO L146 ILogger]: Start minimizeSevpa. Operand 295 states. [2019-05-23 09:24:09,584 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 295 to 291. [2019-05-23 09:24:09,584 INFO L146 ILogger]: Start removeUnreachable. Operand 291 states. [2019-05-23 09:24:09,585 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-05-23 09:24:09,585 INFO L146 ILogger]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 284 [2019-05-23 09:24:09,585 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:09,585 INFO L146 ILogger]: Abstraction has 291 states and 291 transitions. [2019-05-23 09:24:09,585 INFO L146 ILogger]: Interpolant automaton has 93 states. [2019-05-23 09:24:09,585 INFO L146 ILogger]: Start isEmpty. Operand 291 states and 291 transitions. [2019-05-23 09:24:09,586 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 291 [2019-05-23 09:24:09,586 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:09,586 INFO L146 ILogger]: trace histogram [46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:09,586 INFO L146 ILogger]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:09,587 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:09,587 INFO L146 ILogger]: Analyzing trace with hash 1180444746, now seen corresponding path program 46 times [2019-05-23 09:24:09,587 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:09,612 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:09,617 INFO L146 ILogger]: Trace formula consists of 434 conjuncts, 94 conjunts are in the unsatisfiable core [2019-05-23 09:24:09,620 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:12,330 INFO L146 ILogger]: Checked inductivity of 6256 backedges. 0 proven. 6256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:12,331 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:12,331 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-05-23 09:24:12,331 INFO L146 ILogger]: Interpolant automaton has 95 states [2019-05-23 09:24:12,332 INFO L146 ILogger]: Constructing interpolant automaton starting with 95 interpolants. [2019-05-23 09:24:12,333 INFO L146 ILogger]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:24:12,333 INFO L146 ILogger]: Start difference. First operand 291 states and 291 transitions. Second operand 95 states. [2019-05-23 09:24:17,349 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:17,350 INFO L146 ILogger]: Finished difference Result 301 states and 301 transitions. [2019-05-23 09:24:17,350 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-05-23 09:24:17,350 INFO L146 ILogger]: Start accepts. Automaton has 95 states. Word has length 290 [2019-05-23 09:24:17,351 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:17,351 INFO L146 ILogger]: With dead ends: 301 [2019-05-23 09:24:17,351 INFO L146 ILogger]: Without dead ends: 301 [2019-05-23 09:24:17,353 INFO L146 ILogger]: 0 DeclaredPredicates, 381 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2019-05-23 09:24:17,354 INFO L146 ILogger]: Start minimizeSevpa. Operand 301 states. [2019-05-23 09:24:17,355 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 301 to 297. [2019-05-23 09:24:17,355 INFO L146 ILogger]: Start removeUnreachable. Operand 297 states. [2019-05-23 09:24:17,356 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-05-23 09:24:17,356 INFO L146 ILogger]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 290 [2019-05-23 09:24:17,356 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:17,356 INFO L146 ILogger]: Abstraction has 297 states and 297 transitions. [2019-05-23 09:24:17,356 INFO L146 ILogger]: Interpolant automaton has 95 states. [2019-05-23 09:24:17,356 INFO L146 ILogger]: Start isEmpty. Operand 297 states and 297 transitions. [2019-05-23 09:24:17,358 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 297 [2019-05-23 09:24:17,358 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:17,358 INFO L146 ILogger]: trace histogram [47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:17,358 INFO L146 ILogger]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:17,358 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:17,359 INFO L146 ILogger]: Analyzing trace with hash -427365081, now seen corresponding path program 47 times [2019-05-23 09:24:17,359 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:17,385 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:17,389 INFO L146 ILogger]: Trace formula consists of 443 conjuncts, 96 conjunts are in the unsatisfiable core [2019-05-23 09:24:17,393 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:20,345 INFO L146 ILogger]: Checked inductivity of 6533 backedges. 0 proven. 6533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:20,345 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:20,346 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-05-23 09:24:20,346 INFO L146 ILogger]: Interpolant automaton has 97 states [2019-05-23 09:24:20,347 INFO L146 ILogger]: Constructing interpolant automaton starting with 97 interpolants. [2019-05-23 09:24:20,347 INFO L146 ILogger]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:24:20,347 INFO L146 ILogger]: Start difference. First operand 297 states and 297 transitions. Second operand 97 states. [2019-05-23 09:24:25,172 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:25,172 INFO L146 ILogger]: Finished difference Result 307 states and 307 transitions. [2019-05-23 09:24:25,172 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-05-23 09:24:25,173 INFO L146 ILogger]: Start accepts. Automaton has 97 states. Word has length 296 [2019-05-23 09:24:25,173 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:25,174 INFO L146 ILogger]: With dead ends: 307 [2019-05-23 09:24:25,174 INFO L146 ILogger]: Without dead ends: 307 [2019-05-23 09:24:25,175 INFO L146 ILogger]: 0 DeclaredPredicates, 389 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2019-05-23 09:24:25,176 INFO L146 ILogger]: Start minimizeSevpa. Operand 307 states. [2019-05-23 09:24:25,178 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 307 to 303. [2019-05-23 09:24:25,178 INFO L146 ILogger]: Start removeUnreachable. Operand 303 states. [2019-05-23 09:24:25,179 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2019-05-23 09:24:25,179 INFO L146 ILogger]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 296 [2019-05-23 09:24:25,179 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:25,179 INFO L146 ILogger]: Abstraction has 303 states and 303 transitions. [2019-05-23 09:24:25,180 INFO L146 ILogger]: Interpolant automaton has 97 states. [2019-05-23 09:24:25,180 INFO L146 ILogger]: Start isEmpty. Operand 303 states and 303 transitions. [2019-05-23 09:24:25,181 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 303 [2019-05-23 09:24:25,181 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:25,181 INFO L146 ILogger]: trace histogram [48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:25,182 INFO L146 ILogger]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:25,182 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:25,182 INFO L146 ILogger]: Analyzing trace with hash 793761860, now seen corresponding path program 48 times [2019-05-23 09:24:25,183 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:25,208 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:25,212 INFO L146 ILogger]: Trace formula consists of 452 conjuncts, 98 conjunts are in the unsatisfiable core [2019-05-23 09:24:25,216 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:28,171 INFO L146 ILogger]: Checked inductivity of 6816 backedges. 0 proven. 6816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:28,172 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:28,172 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-05-23 09:24:28,172 INFO L146 ILogger]: Interpolant automaton has 99 states [2019-05-23 09:24:28,173 INFO L146 ILogger]: Constructing interpolant automaton starting with 99 interpolants. [2019-05-23 09:24:28,173 INFO L146 ILogger]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:24:28,174 INFO L146 ILogger]: Start difference. First operand 303 states and 303 transitions. Second operand 99 states. [2019-05-23 09:24:33,017 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:33,017 INFO L146 ILogger]: Finished difference Result 313 states and 313 transitions. [2019-05-23 09:24:33,017 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-05-23 09:24:33,018 INFO L146 ILogger]: Start accepts. Automaton has 99 states. Word has length 302 [2019-05-23 09:24:33,018 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:33,019 INFO L146 ILogger]: With dead ends: 313 [2019-05-23 09:24:33,019 INFO L146 ILogger]: Without dead ends: 313 [2019-05-23 09:24:33,020 INFO L146 ILogger]: 0 DeclaredPredicates, 397 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2019-05-23 09:24:33,021 INFO L146 ILogger]: Start minimizeSevpa. Operand 313 states. [2019-05-23 09:24:33,023 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 313 to 309. [2019-05-23 09:24:33,023 INFO L146 ILogger]: Start removeUnreachable. Operand 309 states. [2019-05-23 09:24:33,023 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-05-23 09:24:33,024 INFO L146 ILogger]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 302 [2019-05-23 09:24:33,024 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:33,024 INFO L146 ILogger]: Abstraction has 309 states and 309 transitions. [2019-05-23 09:24:33,024 INFO L146 ILogger]: Interpolant automaton has 99 states. [2019-05-23 09:24:33,024 INFO L146 ILogger]: Start isEmpty. Operand 309 states and 309 transitions. [2019-05-23 09:24:33,025 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 309 [2019-05-23 09:24:33,026 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:33,026 INFO L146 ILogger]: trace histogram [49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:33,026 INFO L146 ILogger]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:33,026 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:33,026 INFO L146 ILogger]: Analyzing trace with hash 412170657, now seen corresponding path program 49 times [2019-05-23 09:24:33,027 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:33,055 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:33,061 INFO L146 ILogger]: Trace formula consists of 461 conjuncts, 100 conjunts are in the unsatisfiable core [2019-05-23 09:24:33,066 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:36,328 INFO L146 ILogger]: Checked inductivity of 7105 backedges. 0 proven. 7105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:36,328 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:36,329 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-05-23 09:24:36,329 INFO L146 ILogger]: Interpolant automaton has 101 states [2019-05-23 09:24:36,330 INFO L146 ILogger]: Constructing interpolant automaton starting with 101 interpolants. [2019-05-23 09:24:36,330 INFO L146 ILogger]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:24:36,330 INFO L146 ILogger]: Start difference. First operand 309 states and 309 transitions. Second operand 101 states. [2019-05-23 09:24:41,334 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:41,335 INFO L146 ILogger]: Finished difference Result 319 states and 319 transitions. [2019-05-23 09:24:41,335 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-05-23 09:24:41,335 INFO L146 ILogger]: Start accepts. Automaton has 101 states. Word has length 308 [2019-05-23 09:24:41,336 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:41,337 INFO L146 ILogger]: With dead ends: 319 [2019-05-23 09:24:41,337 INFO L146 ILogger]: Without dead ends: 319 [2019-05-23 09:24:41,339 INFO L146 ILogger]: 0 DeclaredPredicates, 405 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2019-05-23 09:24:41,340 INFO L146 ILogger]: Start minimizeSevpa. Operand 319 states. [2019-05-23 09:24:41,342 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 319 to 315. [2019-05-23 09:24:41,342 INFO L146 ILogger]: Start removeUnreachable. Operand 315 states. [2019-05-23 09:24:41,342 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2019-05-23 09:24:41,342 INFO L146 ILogger]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 308 [2019-05-23 09:24:41,342 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:41,343 INFO L146 ILogger]: Abstraction has 315 states and 315 transitions. [2019-05-23 09:24:41,343 INFO L146 ILogger]: Interpolant automaton has 101 states. [2019-05-23 09:24:41,343 INFO L146 ILogger]: Start isEmpty. Operand 315 states and 315 transitions. [2019-05-23 09:24:41,344 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 315 [2019-05-23 09:24:41,344 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:41,344 INFO L146 ILogger]: trace histogram [50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:41,344 INFO L146 ILogger]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:41,344 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:41,345 INFO L146 ILogger]: Analyzing trace with hash -1054252738, now seen corresponding path program 50 times [2019-05-23 09:24:41,345 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:41,371 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:41,376 INFO L146 ILogger]: Trace formula consists of 470 conjuncts, 102 conjunts are in the unsatisfiable core [2019-05-23 09:24:41,380 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:44,586 INFO L146 ILogger]: Checked inductivity of 7400 backedges. 0 proven. 7400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:44,586 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:44,586 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-05-23 09:24:44,587 INFO L146 ILogger]: Interpolant automaton has 103 states [2019-05-23 09:24:44,587 INFO L146 ILogger]: Constructing interpolant automaton starting with 103 interpolants. [2019-05-23 09:24:44,588 INFO L146 ILogger]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:24:44,588 INFO L146 ILogger]: Start difference. First operand 315 states and 315 transitions. Second operand 103 states. [2019-05-23 09:24:49,796 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:49,796 INFO L146 ILogger]: Finished difference Result 325 states and 325 transitions. [2019-05-23 09:24:49,797 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-05-23 09:24:49,797 INFO L146 ILogger]: Start accepts. Automaton has 103 states. Word has length 314 [2019-05-23 09:24:49,798 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:49,799 INFO L146 ILogger]: With dead ends: 325 [2019-05-23 09:24:49,799 INFO L146 ILogger]: Without dead ends: 325 [2019-05-23 09:24:49,801 INFO L146 ILogger]: 0 DeclaredPredicates, 413 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2019-05-23 09:24:49,802 INFO L146 ILogger]: Start minimizeSevpa. Operand 325 states. [2019-05-23 09:24:49,804 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 325 to 321. [2019-05-23 09:24:49,804 INFO L146 ILogger]: Start removeUnreachable. Operand 321 states. [2019-05-23 09:24:49,805 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-05-23 09:24:49,805 INFO L146 ILogger]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 314 [2019-05-23 09:24:49,805 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:49,805 INFO L146 ILogger]: Abstraction has 321 states and 321 transitions. [2019-05-23 09:24:49,805 INFO L146 ILogger]: Interpolant automaton has 103 states. [2019-05-23 09:24:49,805 INFO L146 ILogger]: Start isEmpty. Operand 321 states and 321 transitions. [2019-05-23 09:24:49,807 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 321 [2019-05-23 09:24:49,807 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:49,807 INFO L146 ILogger]: trace histogram [51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:49,807 INFO L146 ILogger]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:49,808 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:49,808 INFO L146 ILogger]: Analyzing trace with hash 469409563, now seen corresponding path program 51 times [2019-05-23 09:24:49,808 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:49,836 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:49,841 INFO L146 ILogger]: Trace formula consists of 479 conjuncts, 104 conjunts are in the unsatisfiable core [2019-05-23 09:24:49,845 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:53,395 INFO L146 ILogger]: Checked inductivity of 7701 backedges. 0 proven. 7701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:53,396 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:53,396 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-05-23 09:24:53,396 INFO L146 ILogger]: Interpolant automaton has 105 states [2019-05-23 09:24:53,397 INFO L146 ILogger]: Constructing interpolant automaton starting with 105 interpolants. [2019-05-23 09:24:53,397 INFO L146 ILogger]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 09:24:53,397 INFO L146 ILogger]: Start difference. First operand 321 states and 321 transitions. Second operand 105 states. [2019-05-23 09:24:58,686 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:58,686 INFO L146 ILogger]: Finished difference Result 331 states and 331 transitions. [2019-05-23 09:24:58,687 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-05-23 09:24:58,687 INFO L146 ILogger]: Start accepts. Automaton has 105 states. Word has length 320 [2019-05-23 09:24:58,688 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:58,688 INFO L146 ILogger]: With dead ends: 331 [2019-05-23 09:24:58,689 INFO L146 ILogger]: Without dead ends: 331 [2019-05-23 09:24:58,690 INFO L146 ILogger]: 0 DeclaredPredicates, 421 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2019-05-23 09:24:58,690 INFO L146 ILogger]: Start minimizeSevpa. Operand 331 states. [2019-05-23 09:24:58,693 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-05-23 09:24:58,693 INFO L146 ILogger]: Start removeUnreachable. Operand 327 states. [2019-05-23 09:24:58,693 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2019-05-23 09:24:58,694 INFO L146 ILogger]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 320 [2019-05-23 09:24:58,694 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:58,694 INFO L146 ILogger]: Abstraction has 327 states and 327 transitions. [2019-05-23 09:24:58,694 INFO L146 ILogger]: Interpolant automaton has 105 states. [2019-05-23 09:24:58,694 INFO L146 ILogger]: Start isEmpty. Operand 327 states and 327 transitions. [2019-05-23 09:24:58,696 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 327 [2019-05-23 09:24:58,696 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:58,696 INFO L146 ILogger]: trace histogram [52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:58,696 INFO L146 ILogger]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:58,696 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:58,697 INFO L146 ILogger]: Analyzing trace with hash -588561608, now seen corresponding path program 52 times [2019-05-23 09:24:58,697 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:58,724 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:58,729 INFO L146 ILogger]: Trace formula consists of 488 conjuncts, 106 conjunts are in the unsatisfiable core [2019-05-23 09:24:58,733 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:02,388 INFO L146 ILogger]: Checked inductivity of 8008 backedges. 0 proven. 8008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:02,389 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:02,389 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-05-23 09:25:02,389 INFO L146 ILogger]: Interpolant automaton has 107 states [2019-05-23 09:25:02,390 INFO L146 ILogger]: Constructing interpolant automaton starting with 107 interpolants. [2019-05-23 09:25:02,390 INFO L146 ILogger]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 09:25:02,390 INFO L146 ILogger]: Start difference. First operand 327 states and 327 transitions. Second operand 107 states. [2019-05-23 09:25:08,051 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:08,051 INFO L146 ILogger]: Finished difference Result 337 states and 337 transitions. [2019-05-23 09:25:08,052 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-05-23 09:25:08,052 INFO L146 ILogger]: Start accepts. Automaton has 107 states. Word has length 326 [2019-05-23 09:25:08,052 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:08,054 INFO L146 ILogger]: With dead ends: 337 [2019-05-23 09:25:08,054 INFO L146 ILogger]: Without dead ends: 337 [2019-05-23 09:25:08,056 INFO L146 ILogger]: 0 DeclaredPredicates, 429 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2019-05-23 09:25:08,056 INFO L146 ILogger]: Start minimizeSevpa. Operand 337 states. [2019-05-23 09:25:08,058 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 337 to 333. [2019-05-23 09:25:08,058 INFO L146 ILogger]: Start removeUnreachable. Operand 333 states. [2019-05-23 09:25:08,059 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-05-23 09:25:08,059 INFO L146 ILogger]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 326 [2019-05-23 09:25:08,059 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:08,059 INFO L146 ILogger]: Abstraction has 333 states and 333 transitions. [2019-05-23 09:25:08,059 INFO L146 ILogger]: Interpolant automaton has 107 states. [2019-05-23 09:25:08,060 INFO L146 ILogger]: Start isEmpty. Operand 333 states and 333 transitions. [2019-05-23 09:25:08,061 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 333 [2019-05-23 09:25:08,061 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:08,061 INFO L146 ILogger]: trace histogram [53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:08,061 INFO L146 ILogger]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:08,061 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:08,061 INFO L146 ILogger]: Analyzing trace with hash -1511678571, now seen corresponding path program 53 times [2019-05-23 09:25:08,062 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:08,087 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:08,092 INFO L146 ILogger]: Trace formula consists of 497 conjuncts, 108 conjunts are in the unsatisfiable core [2019-05-23 09:25:08,096 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:11,679 INFO L146 ILogger]: Checked inductivity of 8321 backedges. 0 proven. 8321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:11,679 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:11,679 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-05-23 09:25:11,680 INFO L146 ILogger]: Interpolant automaton has 109 states [2019-05-23 09:25:11,680 INFO L146 ILogger]: Constructing interpolant automaton starting with 109 interpolants. [2019-05-23 09:25:11,681 INFO L146 ILogger]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2019-05-23 09:25:11,681 INFO L146 ILogger]: Start difference. First operand 333 states and 333 transitions. Second operand 109 states. [2019-05-23 09:25:17,435 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:17,436 INFO L146 ILogger]: Finished difference Result 343 states and 343 transitions. [2019-05-23 09:25:17,436 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2019-05-23 09:25:17,436 INFO L146 ILogger]: Start accepts. Automaton has 109 states. Word has length 332 [2019-05-23 09:25:17,437 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:17,438 INFO L146 ILogger]: With dead ends: 343 [2019-05-23 09:25:17,439 INFO L146 ILogger]: Without dead ends: 343 [2019-05-23 09:25:17,440 INFO L146 ILogger]: 0 DeclaredPredicates, 437 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2019-05-23 09:25:17,440 INFO L146 ILogger]: Start minimizeSevpa. Operand 343 states. [2019-05-23 09:25:17,443 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 343 to 339. [2019-05-23 09:25:17,443 INFO L146 ILogger]: Start removeUnreachable. Operand 339 states. [2019-05-23 09:25:17,443 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2019-05-23 09:25:17,444 INFO L146 ILogger]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 332 [2019-05-23 09:25:17,444 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:17,444 INFO L146 ILogger]: Abstraction has 339 states and 339 transitions. [2019-05-23 09:25:17,444 INFO L146 ILogger]: Interpolant automaton has 109 states. [2019-05-23 09:25:17,444 INFO L146 ILogger]: Start isEmpty. Operand 339 states and 339 transitions. [2019-05-23 09:25:17,446 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 339 [2019-05-23 09:25:17,446 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:17,446 INFO L146 ILogger]: trace histogram [54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:17,446 INFO L146 ILogger]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:17,447 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:17,447 INFO L146 ILogger]: Analyzing trace with hash 1943535154, now seen corresponding path program 54 times [2019-05-23 09:25:17,447 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:17,473 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:17,478 INFO L146 ILogger]: Trace formula consists of 506 conjuncts, 110 conjunts are in the unsatisfiable core [2019-05-23 09:25:17,482 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:21,093 INFO L146 ILogger]: Checked inductivity of 8640 backedges. 0 proven. 8640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:21,094 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:21,094 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-05-23 09:25:21,094 INFO L146 ILogger]: Interpolant automaton has 111 states [2019-05-23 09:25:21,095 INFO L146 ILogger]: Constructing interpolant automaton starting with 111 interpolants. [2019-05-23 09:25:21,095 INFO L146 ILogger]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 09:25:21,095 INFO L146 ILogger]: Start difference. First operand 339 states and 339 transitions. Second operand 111 states. [2019-05-23 09:25:27,069 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:27,069 INFO L146 ILogger]: Finished difference Result 349 states and 349 transitions. [2019-05-23 09:25:27,070 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-05-23 09:25:27,070 INFO L146 ILogger]: Start accepts. Automaton has 111 states. Word has length 338 [2019-05-23 09:25:27,070 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:27,072 INFO L146 ILogger]: With dead ends: 349 [2019-05-23 09:25:27,072 INFO L146 ILogger]: Without dead ends: 349 [2019-05-23 09:25:27,073 INFO L146 ILogger]: 0 DeclaredPredicates, 445 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2019-05-23 09:25:27,073 INFO L146 ILogger]: Start minimizeSevpa. Operand 349 states. [2019-05-23 09:25:27,075 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 349 to 345. [2019-05-23 09:25:27,075 INFO L146 ILogger]: Start removeUnreachable. Operand 345 states. [2019-05-23 09:25:27,076 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-05-23 09:25:27,076 INFO L146 ILogger]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 338 [2019-05-23 09:25:27,076 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:27,076 INFO L146 ILogger]: Abstraction has 345 states and 345 transitions. [2019-05-23 09:25:27,076 INFO L146 ILogger]: Interpolant automaton has 111 states. [2019-05-23 09:25:27,076 INFO L146 ILogger]: Start isEmpty. Operand 345 states and 345 transitions. [2019-05-23 09:25:27,078 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 345 [2019-05-23 09:25:27,078 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:27,078 INFO L146 ILogger]: trace histogram [55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:27,078 INFO L146 ILogger]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:27,079 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:27,079 INFO L146 ILogger]: Analyzing trace with hash 1270134031, now seen corresponding path program 55 times [2019-05-23 09:25:27,079 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:27,107 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:27,113 INFO L146 ILogger]: Trace formula consists of 515 conjuncts, 112 conjunts are in the unsatisfiable core [2019-05-23 09:25:27,117 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:31,053 INFO L146 ILogger]: Checked inductivity of 8965 backedges. 0 proven. 8965 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:31,054 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:31,054 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-05-23 09:25:31,054 INFO L146 ILogger]: Interpolant automaton has 113 states [2019-05-23 09:25:31,055 INFO L146 ILogger]: Constructing interpolant automaton starting with 113 interpolants. [2019-05-23 09:25:31,055 INFO L146 ILogger]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2019-05-23 09:25:31,055 INFO L146 ILogger]: Start difference. First operand 345 states and 345 transitions. Second operand 113 states. [2019-05-23 09:25:37,357 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:37,357 INFO L146 ILogger]: Finished difference Result 355 states and 355 transitions. [2019-05-23 09:25:37,358 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-05-23 09:25:37,358 INFO L146 ILogger]: Start accepts. Automaton has 113 states. Word has length 344 [2019-05-23 09:25:37,359 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:37,360 INFO L146 ILogger]: With dead ends: 355 [2019-05-23 09:25:37,360 INFO L146 ILogger]: Without dead ends: 355 [2019-05-23 09:25:37,362 INFO L146 ILogger]: 0 DeclaredPredicates, 453 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2019-05-23 09:25:37,362 INFO L146 ILogger]: Start minimizeSevpa. Operand 355 states. [2019-05-23 09:25:37,364 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 355 to 351. [2019-05-23 09:25:37,365 INFO L146 ILogger]: Start removeUnreachable. Operand 351 states. [2019-05-23 09:25:37,365 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-05-23 09:25:37,365 INFO L146 ILogger]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 344 [2019-05-23 09:25:37,365 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:37,365 INFO L146 ILogger]: Abstraction has 351 states and 351 transitions. [2019-05-23 09:25:37,365 INFO L146 ILogger]: Interpolant automaton has 113 states. [2019-05-23 09:25:37,365 INFO L146 ILogger]: Start isEmpty. Operand 351 states and 351 transitions. [2019-05-23 09:25:37,367 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 351 [2019-05-23 09:25:37,367 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:37,367 INFO L146 ILogger]: trace histogram [56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:37,367 INFO L146 ILogger]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:37,367 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:37,367 INFO L146 ILogger]: Analyzing trace with hash 661787180, now seen corresponding path program 56 times [2019-05-23 09:25:37,368 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:37,392 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:37,397 INFO L146 ILogger]: Trace formula consists of 524 conjuncts, 114 conjunts are in the unsatisfiable core [2019-05-23 09:25:37,401 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:41,191 INFO L146 ILogger]: Checked inductivity of 9296 backedges. 0 proven. 9296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:41,191 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:41,192 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-05-23 09:25:41,192 INFO L146 ILogger]: Interpolant automaton has 115 states [2019-05-23 09:25:41,192 INFO L146 ILogger]: Constructing interpolant automaton starting with 115 interpolants. [2019-05-23 09:25:41,193 INFO L146 ILogger]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 09:25:41,193 INFO L146 ILogger]: Start difference. First operand 351 states and 351 transitions. Second operand 115 states. [2019-05-23 09:25:47,551 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:47,551 INFO L146 ILogger]: Finished difference Result 361 states and 361 transitions. [2019-05-23 09:25:47,551 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-05-23 09:25:47,551 INFO L146 ILogger]: Start accepts. Automaton has 115 states. Word has length 350 [2019-05-23 09:25:47,551 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:47,553 INFO L146 ILogger]: With dead ends: 361 [2019-05-23 09:25:47,553 INFO L146 ILogger]: Without dead ends: 361 [2019-05-23 09:25:47,554 INFO L146 ILogger]: 0 DeclaredPredicates, 461 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2019-05-23 09:25:47,555 INFO L146 ILogger]: Start minimizeSevpa. Operand 361 states. [2019-05-23 09:25:47,557 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 361 to 357. [2019-05-23 09:25:47,557 INFO L146 ILogger]: Start removeUnreachable. Operand 357 states. [2019-05-23 09:25:47,557 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-05-23 09:25:47,557 INFO L146 ILogger]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 350 [2019-05-23 09:25:47,558 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:47,558 INFO L146 ILogger]: Abstraction has 357 states and 357 transitions. [2019-05-23 09:25:47,558 INFO L146 ILogger]: Interpolant automaton has 115 states. [2019-05-23 09:25:47,558 INFO L146 ILogger]: Start isEmpty. Operand 357 states and 357 transitions. [2019-05-23 09:25:47,560 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 357 [2019-05-23 09:25:47,560 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:47,560 INFO L146 ILogger]: trace histogram [57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:47,560 INFO L146 ILogger]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:47,560 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:47,561 INFO L146 ILogger]: Analyzing trace with hash 587883913, now seen corresponding path program 57 times [2019-05-23 09:25:47,561 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:47,590 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:47,598 INFO L146 ILogger]: Trace formula consists of 533 conjuncts, 116 conjunts are in the unsatisfiable core [2019-05-23 09:25:47,602 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:51,837 INFO L146 ILogger]: Checked inductivity of 9633 backedges. 0 proven. 9633 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:51,837 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:51,837 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-05-23 09:25:51,838 INFO L146 ILogger]: Interpolant automaton has 117 states [2019-05-23 09:25:51,838 INFO L146 ILogger]: Constructing interpolant automaton starting with 117 interpolants. [2019-05-23 09:25:51,838 INFO L146 ILogger]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2019-05-23 09:25:51,838 INFO L146 ILogger]: Start difference. First operand 357 states and 357 transitions. Second operand 117 states. [2019-05-23 09:25:58,564 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:58,564 INFO L146 ILogger]: Finished difference Result 367 states and 367 transitions. [2019-05-23 09:25:58,565 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2019-05-23 09:25:58,565 INFO L146 ILogger]: Start accepts. Automaton has 117 states. Word has length 356 [2019-05-23 09:25:58,565 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:58,567 INFO L146 ILogger]: With dead ends: 367 [2019-05-23 09:25:58,567 INFO L146 ILogger]: Without dead ends: 367 [2019-05-23 09:25:58,568 INFO L146 ILogger]: 0 DeclaredPredicates, 469 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2019-05-23 09:25:58,568 INFO L146 ILogger]: Start minimizeSevpa. Operand 367 states. [2019-05-23 09:25:58,571 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 367 to 363. [2019-05-23 09:25:58,571 INFO L146 ILogger]: Start removeUnreachable. Operand 363 states. [2019-05-23 09:25:58,571 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2019-05-23 09:25:58,571 INFO L146 ILogger]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 356 [2019-05-23 09:25:58,572 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:58,572 INFO L146 ILogger]: Abstraction has 363 states and 363 transitions. [2019-05-23 09:25:58,572 INFO L146 ILogger]: Interpolant automaton has 117 states. [2019-05-23 09:25:58,572 INFO L146 ILogger]: Start isEmpty. Operand 363 states and 363 transitions. [2019-05-23 09:25:58,573 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 363 [2019-05-23 09:25:58,573 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:58,574 INFO L146 ILogger]: trace histogram [58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:58,574 INFO L146 ILogger]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:58,574 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:58,574 INFO L146 ILogger]: Analyzing trace with hash -377749722, now seen corresponding path program 58 times [2019-05-23 09:25:58,575 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:58,602 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:58,608 INFO L146 ILogger]: Trace formula consists of 542 conjuncts, 118 conjunts are in the unsatisfiable core [2019-05-23 09:25:58,612 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:02,755 INFO L146 ILogger]: Checked inductivity of 9976 backedges. 0 proven. 9976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:02,756 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:02,756 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-05-23 09:26:02,756 INFO L146 ILogger]: Interpolant automaton has 119 states [2019-05-23 09:26:02,757 INFO L146 ILogger]: Constructing interpolant automaton starting with 119 interpolants. [2019-05-23 09:26:02,757 INFO L146 ILogger]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 09:26:02,757 INFO L146 ILogger]: Start difference. First operand 363 states and 363 transitions. Second operand 119 states. [2019-05-23 09:26:09,635 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:09,635 INFO L146 ILogger]: Finished difference Result 373 states and 373 transitions. [2019-05-23 09:26:09,635 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2019-05-23 09:26:09,635 INFO L146 ILogger]: Start accepts. Automaton has 119 states. Word has length 362 [2019-05-23 09:26:09,636 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:09,637 INFO L146 ILogger]: With dead ends: 373 [2019-05-23 09:26:09,637 INFO L146 ILogger]: Without dead ends: 373 [2019-05-23 09:26:09,639 INFO L146 ILogger]: 0 DeclaredPredicates, 477 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2019-05-23 09:26:09,639 INFO L146 ILogger]: Start minimizeSevpa. Operand 373 states. [2019-05-23 09:26:09,641 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 373 to 369. [2019-05-23 09:26:09,641 INFO L146 ILogger]: Start removeUnreachable. Operand 369 states. [2019-05-23 09:26:09,642 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2019-05-23 09:26:09,642 INFO L146 ILogger]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 362 [2019-05-23 09:26:09,642 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:09,642 INFO L146 ILogger]: Abstraction has 369 states and 369 transitions. [2019-05-23 09:26:09,642 INFO L146 ILogger]: Interpolant automaton has 119 states. [2019-05-23 09:26:09,642 INFO L146 ILogger]: Start isEmpty. Operand 369 states and 369 transitions. [2019-05-23 09:26:09,643 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 369 [2019-05-23 09:26:09,643 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:09,644 INFO L146 ILogger]: trace histogram [59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:09,644 INFO L146 ILogger]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:09,644 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:09,644 INFO L146 ILogger]: Analyzing trace with hash 1640574723, now seen corresponding path program 59 times [2019-05-23 09:26:09,645 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:09,673 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:09,679 INFO L146 ILogger]: Trace formula consists of 551 conjuncts, 120 conjunts are in the unsatisfiable core [2019-05-23 09:26:09,683 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:13,985 INFO L146 ILogger]: Checked inductivity of 10325 backedges. 0 proven. 10325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:13,986 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:13,986 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2019-05-23 09:26:13,986 INFO L146 ILogger]: Interpolant automaton has 121 states [2019-05-23 09:26:13,987 INFO L146 ILogger]: Constructing interpolant automaton starting with 121 interpolants. [2019-05-23 09:26:13,987 INFO L146 ILogger]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2019-05-23 09:26:13,987 INFO L146 ILogger]: Start difference. First operand 369 states and 369 transitions. Second operand 121 states. [2019-05-23 09:26:20,941 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:20,942 INFO L146 ILogger]: Finished difference Result 379 states and 379 transitions. [2019-05-23 09:26:20,942 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2019-05-23 09:26:20,942 INFO L146 ILogger]: Start accepts. Automaton has 121 states. Word has length 368 [2019-05-23 09:26:20,943 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:20,944 INFO L146 ILogger]: With dead ends: 379 [2019-05-23 09:26:20,944 INFO L146 ILogger]: Without dead ends: 379 [2019-05-23 09:26:20,946 INFO L146 ILogger]: 0 DeclaredPredicates, 485 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2019-05-23 09:26:20,946 INFO L146 ILogger]: Start minimizeSevpa. Operand 379 states. [2019-05-23 09:26:20,948 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 379 to 375. [2019-05-23 09:26:20,948 INFO L146 ILogger]: Start removeUnreachable. Operand 375 states. [2019-05-23 09:26:20,949 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 375 states to 375 states and 375 transitions. [2019-05-23 09:26:20,949 INFO L146 ILogger]: Start accepts. Automaton has 375 states and 375 transitions. Word has length 368 [2019-05-23 09:26:20,949 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:20,949 INFO L146 ILogger]: Abstraction has 375 states and 375 transitions. [2019-05-23 09:26:20,949 INFO L146 ILogger]: Interpolant automaton has 121 states. [2019-05-23 09:26:20,949 INFO L146 ILogger]: Start isEmpty. Operand 375 states and 375 transitions. [2019-05-23 09:26:20,951 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 375 [2019-05-23 09:26:20,951 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:20,951 INFO L146 ILogger]: trace histogram [60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:20,951 INFO L146 ILogger]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:20,951 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:20,952 INFO L146 ILogger]: Analyzing trace with hash -1678228192, now seen corresponding path program 60 times [2019-05-23 09:26:20,952 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:21,004 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:21,011 INFO L146 ILogger]: Trace formula consists of 560 conjuncts, 122 conjunts are in the unsatisfiable core [2019-05-23 09:26:21,015 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:25,615 INFO L146 ILogger]: Checked inductivity of 10680 backedges. 0 proven. 10680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:25,615 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:25,615 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2019-05-23 09:26:25,616 INFO L146 ILogger]: Interpolant automaton has 123 states [2019-05-23 09:26:25,617 INFO L146 ILogger]: Constructing interpolant automaton starting with 123 interpolants. [2019-05-23 09:26:25,617 INFO L146 ILogger]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2019-05-23 09:26:25,617 INFO L146 ILogger]: Start difference. First operand 375 states and 375 transitions. Second operand 123 states. [2019-05-23 09:26:33,126 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:33,126 INFO L146 ILogger]: Finished difference Result 385 states and 385 transitions. [2019-05-23 09:26:33,126 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2019-05-23 09:26:33,126 INFO L146 ILogger]: Start accepts. Automaton has 123 states. Word has length 374 [2019-05-23 09:26:33,127 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:33,129 INFO L146 ILogger]: With dead ends: 385 [2019-05-23 09:26:33,129 INFO L146 ILogger]: Without dead ends: 385 [2019-05-23 09:26:33,131 INFO L146 ILogger]: 0 DeclaredPredicates, 493 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2019-05-23 09:26:33,131 INFO L146 ILogger]: Start minimizeSevpa. Operand 385 states. [2019-05-23 09:26:33,134 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 385 to 381. [2019-05-23 09:26:33,134 INFO L146 ILogger]: Start removeUnreachable. Operand 381 states. [2019-05-23 09:26:33,134 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-05-23 09:26:33,134 INFO L146 ILogger]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 374 [2019-05-23 09:26:33,134 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:33,134 INFO L146 ILogger]: Abstraction has 381 states and 381 transitions. [2019-05-23 09:26:33,135 INFO L146 ILogger]: Interpolant automaton has 123 states. [2019-05-23 09:26:33,135 INFO L146 ILogger]: Start isEmpty. Operand 381 states and 381 transitions. [2019-05-23 09:26:33,136 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 381 [2019-05-23 09:26:33,136 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:33,136 INFO L146 ILogger]: trace histogram [61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:33,136 INFO L146 ILogger]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:33,136 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:33,137 INFO L146 ILogger]: Analyzing trace with hash -32272003, now seen corresponding path program 61 times [2019-05-23 09:26:33,137 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:33,158 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:33,164 INFO L146 ILogger]: Trace formula consists of 569 conjuncts, 124 conjunts are in the unsatisfiable core [2019-05-23 09:26:33,168 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:37,453 INFO L146 ILogger]: Checked inductivity of 11041 backedges. 0 proven. 11041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:37,453 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:37,454 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2019-05-23 09:26:37,454 INFO L146 ILogger]: Interpolant automaton has 125 states [2019-05-23 09:26:37,455 INFO L146 ILogger]: Constructing interpolant automaton starting with 125 interpolants. [2019-05-23 09:26:37,455 INFO L146 ILogger]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2019-05-23 09:26:37,455 INFO L146 ILogger]: Start difference. First operand 381 states and 381 transitions. Second operand 125 states. [2019-05-23 09:26:45,118 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:45,118 INFO L146 ILogger]: Finished difference Result 391 states and 391 transitions. [2019-05-23 09:26:45,119 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2019-05-23 09:26:45,119 INFO L146 ILogger]: Start accepts. Automaton has 125 states. Word has length 380 [2019-05-23 09:26:45,119 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:45,120 INFO L146 ILogger]: With dead ends: 391 [2019-05-23 09:26:45,120 INFO L146 ILogger]: Without dead ends: 391 [2019-05-23 09:26:45,122 INFO L146 ILogger]: 0 DeclaredPredicates, 501 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2019-05-23 09:26:45,122 INFO L146 ILogger]: Start minimizeSevpa. Operand 391 states. [2019-05-23 09:26:45,124 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 391 to 387. [2019-05-23 09:26:45,125 INFO L146 ILogger]: Start removeUnreachable. Operand 387 states. [2019-05-23 09:26:45,125 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2019-05-23 09:26:45,125 INFO L146 ILogger]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 380 [2019-05-23 09:26:45,125 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:45,125 INFO L146 ILogger]: Abstraction has 387 states and 387 transitions. [2019-05-23 09:26:45,125 INFO L146 ILogger]: Interpolant automaton has 125 states. [2019-05-23 09:26:45,125 INFO L146 ILogger]: Start isEmpty. Operand 387 states and 387 transitions. [2019-05-23 09:26:45,127 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 387 [2019-05-23 09:26:45,127 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:45,127 INFO L146 ILogger]: trace histogram [62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:45,127 INFO L146 ILogger]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:45,127 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:45,127 INFO L146 ILogger]: Analyzing trace with hash -1322687462, now seen corresponding path program 62 times [2019-05-23 09:26:45,128 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:45,148 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:45,152 INFO L146 ILogger]: Trace formula consists of 578 conjuncts, 126 conjunts are in the unsatisfiable core [2019-05-23 09:26:45,157 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:49,658 INFO L146 ILogger]: Checked inductivity of 11408 backedges. 0 proven. 11408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:49,659 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:49,659 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2019-05-23 09:26:49,659 INFO L146 ILogger]: Interpolant automaton has 127 states [2019-05-23 09:26:49,660 INFO L146 ILogger]: Constructing interpolant automaton starting with 127 interpolants. [2019-05-23 09:26:49,661 INFO L146 ILogger]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 09:26:49,661 INFO L146 ILogger]: Start difference. First operand 387 states and 387 transitions. Second operand 127 states. [2019-05-23 09:26:57,326 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:57,326 INFO L146 ILogger]: Finished difference Result 397 states and 397 transitions. [2019-05-23 09:26:57,333 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2019-05-23 09:26:57,333 INFO L146 ILogger]: Start accepts. Automaton has 127 states. Word has length 386 [2019-05-23 09:26:57,333 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:57,335 INFO L146 ILogger]: With dead ends: 397 [2019-05-23 09:26:57,335 INFO L146 ILogger]: Without dead ends: 397 [2019-05-23 09:26:57,336 INFO L146 ILogger]: 0 DeclaredPredicates, 509 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2019-05-23 09:26:57,337 INFO L146 ILogger]: Start minimizeSevpa. Operand 397 states. [2019-05-23 09:26:57,339 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 397 to 393. [2019-05-23 09:26:57,339 INFO L146 ILogger]: Start removeUnreachable. Operand 393 states. [2019-05-23 09:26:57,339 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-05-23 09:26:57,339 INFO L146 ILogger]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 386 [2019-05-23 09:26:57,340 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:57,340 INFO L146 ILogger]: Abstraction has 393 states and 393 transitions. [2019-05-23 09:26:57,340 INFO L146 ILogger]: Interpolant automaton has 127 states. [2019-05-23 09:26:57,340 INFO L146 ILogger]: Start isEmpty. Operand 393 states and 393 transitions. [2019-05-23 09:26:57,341 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 393 [2019-05-23 09:26:57,341 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:57,341 INFO L146 ILogger]: trace histogram [63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:57,342 INFO L146 ILogger]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:57,342 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:57,342 INFO L146 ILogger]: Analyzing trace with hash 1313606903, now seen corresponding path program 63 times [2019-05-23 09:26:57,343 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:57,371 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:57,377 INFO L146 ILogger]: Trace formula consists of 587 conjuncts, 128 conjunts are in the unsatisfiable core [2019-05-23 09:26:57,382 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:01,790 INFO L146 ILogger]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:01,791 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:01,791 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2019-05-23 09:27:01,791 INFO L146 ILogger]: Interpolant automaton has 129 states [2019-05-23 09:27:01,792 INFO L146 ILogger]: Constructing interpolant automaton starting with 129 interpolants. [2019-05-23 09:27:01,793 INFO L146 ILogger]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2019-05-23 09:27:01,793 INFO L146 ILogger]: Start difference. First operand 393 states and 393 transitions. Second operand 129 states. [2019-05-23 09:27:09,721 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:09,722 INFO L146 ILogger]: Finished difference Result 403 states and 403 transitions. [2019-05-23 09:27:09,722 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2019-05-23 09:27:09,722 INFO L146 ILogger]: Start accepts. Automaton has 129 states. Word has length 392 [2019-05-23 09:27:09,723 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:09,724 INFO L146 ILogger]: With dead ends: 403 [2019-05-23 09:27:09,724 INFO L146 ILogger]: Without dead ends: 403 [2019-05-23 09:27:09,727 INFO L146 ILogger]: 0 DeclaredPredicates, 517 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2019-05-23 09:27:09,727 INFO L146 ILogger]: Start minimizeSevpa. Operand 403 states. [2019-05-23 09:27:09,730 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 403 to 399. [2019-05-23 09:27:09,730 INFO L146 ILogger]: Start removeUnreachable. Operand 399 states. [2019-05-23 09:27:09,730 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 399 states to 399 states and 399 transitions. [2019-05-23 09:27:09,731 INFO L146 ILogger]: Start accepts. Automaton has 399 states and 399 transitions. Word has length 392 [2019-05-23 09:27:09,731 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:09,731 INFO L146 ILogger]: Abstraction has 399 states and 399 transitions. [2019-05-23 09:27:09,731 INFO L146 ILogger]: Interpolant automaton has 129 states. [2019-05-23 09:27:09,731 INFO L146 ILogger]: Start isEmpty. Operand 399 states and 399 transitions. [2019-05-23 09:27:09,733 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 399 [2019-05-23 09:27:09,733 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:09,733 INFO L146 ILogger]: trace histogram [64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:27:09,733 INFO L146 ILogger]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:09,734 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:09,734 INFO L146 ILogger]: Analyzing trace with hash -879633388, now seen corresponding path program 64 times [2019-05-23 09:27:09,734 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:09,757 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:09,762 INFO L146 ILogger]: Trace formula consists of 596 conjuncts, 130 conjunts are in the unsatisfiable core [2019-05-23 09:27:09,767 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:14,548 INFO L146 ILogger]: Checked inductivity of 12160 backedges. 0 proven. 12160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:14,548 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:14,548 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2019-05-23 09:27:14,549 INFO L146 ILogger]: Interpolant automaton has 131 states [2019-05-23 09:27:14,549 INFO L146 ILogger]: Constructing interpolant automaton starting with 131 interpolants. [2019-05-23 09:27:14,550 INFO L146 ILogger]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 09:27:14,550 INFO L146 ILogger]: Start difference. First operand 399 states and 399 transitions. Second operand 131 states. [2019-05-23 09:27:22,655 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:22,656 INFO L146 ILogger]: Finished difference Result 409 states and 409 transitions. [2019-05-23 09:27:22,656 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2019-05-23 09:27:22,656 INFO L146 ILogger]: Start accepts. Automaton has 131 states. Word has length 398 [2019-05-23 09:27:22,657 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:22,658 INFO L146 ILogger]: With dead ends: 409 [2019-05-23 09:27:22,658 INFO L146 ILogger]: Without dead ends: 409 [2019-05-23 09:27:22,660 INFO L146 ILogger]: 0 DeclaredPredicates, 525 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2019-05-23 09:27:22,660 INFO L146 ILogger]: Start minimizeSevpa. Operand 409 states. [2019-05-23 09:27:22,662 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 409 to 405. [2019-05-23 09:27:22,663 INFO L146 ILogger]: Start removeUnreachable. Operand 405 states. [2019-05-23 09:27:22,663 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2019-05-23 09:27:22,663 INFO L146 ILogger]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 398 [2019-05-23 09:27:22,663 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:22,663 INFO L146 ILogger]: Abstraction has 405 states and 405 transitions. [2019-05-23 09:27:22,664 INFO L146 ILogger]: Interpolant automaton has 131 states. [2019-05-23 09:27:22,664 INFO L146 ILogger]: Start isEmpty. Operand 405 states and 405 transitions. [2019-05-23 09:27:22,665 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 405 [2019-05-23 09:27:22,665 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:22,665 INFO L146 ILogger]: trace histogram [65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:27:22,665 INFO L146 ILogger]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:22,666 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:22,666 INFO L146 ILogger]: Analyzing trace with hash -1458232975, now seen corresponding path program 65 times [2019-05-23 09:27:22,666 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:22,691 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:22,699 INFO L146 ILogger]: Trace formula consists of 605 conjuncts, 132 conjunts are in the unsatisfiable core [2019-05-23 09:27:22,703 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:27,728 INFO L146 ILogger]: Checked inductivity of 12545 backedges. 0 proven. 12545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:27,728 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:27,728 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2019-05-23 09:27:27,729 INFO L146 ILogger]: Interpolant automaton has 133 states [2019-05-23 09:27:27,730 INFO L146 ILogger]: Constructing interpolant automaton starting with 133 interpolants. [2019-05-23 09:27:27,730 INFO L146 ILogger]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2019-05-23 09:27:27,730 INFO L146 ILogger]: Start difference. First operand 405 states and 405 transitions. Second operand 133 states. [2019-05-23 09:27:36,167 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:36,167 INFO L146 ILogger]: Finished difference Result 415 states and 415 transitions. [2019-05-23 09:27:36,167 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2019-05-23 09:27:36,168 INFO L146 ILogger]: Start accepts. Automaton has 133 states. Word has length 404 [2019-05-23 09:27:36,168 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:36,169 INFO L146 ILogger]: With dead ends: 415 [2019-05-23 09:27:36,170 INFO L146 ILogger]: Without dead ends: 415 [2019-05-23 09:27:36,171 INFO L146 ILogger]: 0 DeclaredPredicates, 533 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2019-05-23 09:27:36,171 INFO L146 ILogger]: Start minimizeSevpa. Operand 415 states. [2019-05-23 09:27:36,173 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 415 to 411. [2019-05-23 09:27:36,173 INFO L146 ILogger]: Start removeUnreachable. Operand 411 states. [2019-05-23 09:27:36,174 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2019-05-23 09:27:36,174 INFO L146 ILogger]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 404 [2019-05-23 09:27:36,174 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:36,174 INFO L146 ILogger]: Abstraction has 411 states and 411 transitions. [2019-05-23 09:27:36,174 INFO L146 ILogger]: Interpolant automaton has 133 states. [2019-05-23 09:27:36,174 INFO L146 ILogger]: Start isEmpty. Operand 411 states and 411 transitions. [2019-05-23 09:27:36,176 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 411 [2019-05-23 09:27:36,176 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:36,176 INFO L146 ILogger]: trace histogram [66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:27:36,176 INFO L146 ILogger]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:36,176 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:36,177 INFO L146 ILogger]: Analyzing trace with hash 1576283406, now seen corresponding path program 66 times [2019-05-23 09:27:36,177 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:36,204 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:36,211 INFO L146 ILogger]: Trace formula consists of 614 conjuncts, 134 conjunts are in the unsatisfiable core [2019-05-23 09:27:36,215 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:41,376 INFO L146 ILogger]: Checked inductivity of 12936 backedges. 0 proven. 12936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:41,376 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:41,376 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2019-05-23 09:27:41,377 INFO L146 ILogger]: Interpolant automaton has 135 states [2019-05-23 09:27:41,377 INFO L146 ILogger]: Constructing interpolant automaton starting with 135 interpolants. [2019-05-23 09:27:41,378 INFO L146 ILogger]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2019-05-23 09:27:41,378 INFO L146 ILogger]: Start difference. First operand 411 states and 411 transitions. Second operand 135 states. [2019-05-23 09:27:50,214 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:50,215 INFO L146 ILogger]: Finished difference Result 421 states and 421 transitions. [2019-05-23 09:27:50,215 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2019-05-23 09:27:50,215 INFO L146 ILogger]: Start accepts. Automaton has 135 states. Word has length 410 [2019-05-23 09:27:50,216 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:50,217 INFO L146 ILogger]: With dead ends: 421 [2019-05-23 09:27:50,217 INFO L146 ILogger]: Without dead ends: 421 [2019-05-23 09:27:50,219 INFO L146 ILogger]: 0 DeclaredPredicates, 541 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2019-05-23 09:27:50,220 INFO L146 ILogger]: Start minimizeSevpa. Operand 421 states. [2019-05-23 09:27:50,222 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 421 to 417. [2019-05-23 09:27:50,222 INFO L146 ILogger]: Start removeUnreachable. Operand 417 states. [2019-05-23 09:27:50,222 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 417 states to 417 states and 417 transitions. [2019-05-23 09:27:50,222 INFO L146 ILogger]: Start accepts. Automaton has 417 states and 417 transitions. Word has length 410 [2019-05-23 09:27:50,223 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:50,223 INFO L146 ILogger]: Abstraction has 417 states and 417 transitions. [2019-05-23 09:27:50,223 INFO L146 ILogger]: Interpolant automaton has 135 states. [2019-05-23 09:27:50,223 INFO L146 ILogger]: Start isEmpty. Operand 417 states and 417 transitions. [2019-05-23 09:27:50,224 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 417 [2019-05-23 09:27:50,224 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:50,224 INFO L146 ILogger]: trace histogram [67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:27:50,225 INFO L146 ILogger]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:50,225 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:50,225 INFO L146 ILogger]: Analyzing trace with hash 89214699, now seen corresponding path program 67 times [2019-05-23 09:27:50,225 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:50,247 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:50,253 INFO L146 ILogger]: Trace formula consists of 623 conjuncts, 136 conjunts are in the unsatisfiable core [2019-05-23 09:27:50,260 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:55,449 INFO L146 ILogger]: Checked inductivity of 13333 backedges. 0 proven. 13333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:55,449 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:55,449 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2019-05-23 09:27:55,450 INFO L146 ILogger]: Interpolant automaton has 137 states [2019-05-23 09:27:55,450 INFO L146 ILogger]: Constructing interpolant automaton starting with 137 interpolants. [2019-05-23 09:27:55,451 INFO L146 ILogger]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2019-05-23 09:27:55,451 INFO L146 ILogger]: Start difference. First operand 417 states and 417 transitions. Second operand 137 states. [2019-05-23 09:28:04,478 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:04,479 INFO L146 ILogger]: Finished difference Result 427 states and 427 transitions. [2019-05-23 09:28:04,479 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2019-05-23 09:28:04,479 INFO L146 ILogger]: Start accepts. Automaton has 137 states. Word has length 416 [2019-05-23 09:28:04,479 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:04,480 INFO L146 ILogger]: With dead ends: 427 [2019-05-23 09:28:04,480 INFO L146 ILogger]: Without dead ends: 427 [2019-05-23 09:28:04,482 INFO L146 ILogger]: 0 DeclaredPredicates, 549 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2019-05-23 09:28:04,482 INFO L146 ILogger]: Start minimizeSevpa. Operand 427 states. [2019-05-23 09:28:04,484 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 427 to 423. [2019-05-23 09:28:04,484 INFO L146 ILogger]: Start removeUnreachable. Operand 423 states. [2019-05-23 09:28:04,485 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2019-05-23 09:28:04,485 INFO L146 ILogger]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 416 [2019-05-23 09:28:04,485 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:04,485 INFO L146 ILogger]: Abstraction has 423 states and 423 transitions. [2019-05-23 09:28:04,485 INFO L146 ILogger]: Interpolant automaton has 137 states. [2019-05-23 09:28:04,485 INFO L146 ILogger]: Start isEmpty. Operand 423 states and 423 transitions. [2019-05-23 09:28:04,487 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 423 [2019-05-23 09:28:04,487 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:04,487 INFO L146 ILogger]: trace histogram [68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:28:04,487 INFO L146 ILogger]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:04,487 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:04,488 INFO L146 ILogger]: Analyzing trace with hash 1263720200, now seen corresponding path program 68 times [2019-05-23 09:28:04,488 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:04,511 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:04,517 INFO L146 ILogger]: Trace formula consists of 632 conjuncts, 138 conjunts are in the unsatisfiable core [2019-05-23 09:28:04,520 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:09,756 INFO L146 ILogger]: Checked inductivity of 13736 backedges. 0 proven. 13736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:09,757 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:09,757 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2019-05-23 09:28:09,757 INFO L146 ILogger]: Interpolant automaton has 139 states [2019-05-23 09:28:09,758 INFO L146 ILogger]: Constructing interpolant automaton starting with 139 interpolants. [2019-05-23 09:28:09,758 INFO L146 ILogger]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2019-05-23 09:28:09,758 INFO L146 ILogger]: Start difference. First operand 423 states and 423 transitions. Second operand 139 states. [2019-05-23 09:28:18,729 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:18,729 INFO L146 ILogger]: Finished difference Result 433 states and 433 transitions. [2019-05-23 09:28:18,730 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2019-05-23 09:28:18,730 INFO L146 ILogger]: Start accepts. Automaton has 139 states. Word has length 422 [2019-05-23 09:28:18,730 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:18,731 INFO L146 ILogger]: With dead ends: 433 [2019-05-23 09:28:18,732 INFO L146 ILogger]: Without dead ends: 433 [2019-05-23 09:28:18,734 INFO L146 ILogger]: 0 DeclaredPredicates, 557 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2019-05-23 09:28:18,734 INFO L146 ILogger]: Start minimizeSevpa. Operand 433 states. [2019-05-23 09:28:18,736 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 433 to 429. [2019-05-23 09:28:18,736 INFO L146 ILogger]: Start removeUnreachable. Operand 429 states. [2019-05-23 09:28:18,737 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 429 states to 429 states and 429 transitions. [2019-05-23 09:28:18,737 INFO L146 ILogger]: Start accepts. Automaton has 429 states and 429 transitions. Word has length 422 [2019-05-23 09:28:18,737 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:18,737 INFO L146 ILogger]: Abstraction has 429 states and 429 transitions. [2019-05-23 09:28:18,737 INFO L146 ILogger]: Interpolant automaton has 139 states. [2019-05-23 09:28:18,737 INFO L146 ILogger]: Start isEmpty. Operand 429 states and 429 transitions. [2019-05-23 09:28:18,739 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 429 [2019-05-23 09:28:18,739 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:18,739 INFO L146 ILogger]: trace histogram [69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:28:18,739 INFO L146 ILogger]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:18,739 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:18,739 INFO L146 ILogger]: Analyzing trace with hash -1708976795, now seen corresponding path program 69 times [2019-05-23 09:28:18,740 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:18,768 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:18,775 INFO L146 ILogger]: Trace formula consists of 641 conjuncts, 140 conjunts are in the unsatisfiable core [2019-05-23 09:28:18,779 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:24,240 INFO L146 ILogger]: Checked inductivity of 14145 backedges. 0 proven. 14145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:24,240 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:24,240 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2019-05-23 09:28:24,241 INFO L146 ILogger]: Interpolant automaton has 141 states [2019-05-23 09:28:24,242 INFO L146 ILogger]: Constructing interpolant automaton starting with 141 interpolants. [2019-05-23 09:28:24,242 INFO L146 ILogger]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2019-05-23 09:28:24,242 INFO L146 ILogger]: Start difference. First operand 429 states and 429 transitions. Second operand 141 states. [2019-05-23 09:28:33,766 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:33,767 INFO L146 ILogger]: Finished difference Result 439 states and 439 transitions. [2019-05-23 09:28:33,767 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2019-05-23 09:28:33,767 INFO L146 ILogger]: Start accepts. Automaton has 141 states. Word has length 428 [2019-05-23 09:28:33,768 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:33,769 INFO L146 ILogger]: With dead ends: 439 [2019-05-23 09:28:33,769 INFO L146 ILogger]: Without dead ends: 439 [2019-05-23 09:28:33,772 INFO L146 ILogger]: 0 DeclaredPredicates, 565 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2019-05-23 09:28:33,773 INFO L146 ILogger]: Start minimizeSevpa. Operand 439 states. [2019-05-23 09:28:33,775 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 439 to 435. [2019-05-23 09:28:33,775 INFO L146 ILogger]: Start removeUnreachable. Operand 435 states. [2019-05-23 09:28:33,776 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 435 states to 435 states and 435 transitions. [2019-05-23 09:28:33,776 INFO L146 ILogger]: Start accepts. Automaton has 435 states and 435 transitions. Word has length 428 [2019-05-23 09:28:33,776 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:33,776 INFO L146 ILogger]: Abstraction has 435 states and 435 transitions. [2019-05-23 09:28:33,776 INFO L146 ILogger]: Interpolant automaton has 141 states. [2019-05-23 09:28:33,776 INFO L146 ILogger]: Start isEmpty. Operand 435 states and 435 transitions. [2019-05-23 09:28:33,778 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 435 [2019-05-23 09:28:33,778 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:33,778 INFO L146 ILogger]: trace histogram [70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:28:33,778 INFO L146 ILogger]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:33,778 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:33,778 INFO L146 ILogger]: Analyzing trace with hash -2031068670, now seen corresponding path program 70 times [2019-05-23 09:28:33,779 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:33,810 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:33,816 INFO L146 ILogger]: Trace formula consists of 650 conjuncts, 142 conjunts are in the unsatisfiable core [2019-05-23 09:28:33,819 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:39,562 INFO L146 ILogger]: Checked inductivity of 14560 backedges. 0 proven. 14560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:39,562 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:39,563 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2019-05-23 09:28:39,584 INFO L146 ILogger]: Interpolant automaton has 143 states [2019-05-23 09:28:39,585 INFO L146 ILogger]: Constructing interpolant automaton starting with 143 interpolants. [2019-05-23 09:28:39,585 INFO L146 ILogger]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2019-05-23 09:28:39,585 INFO L146 ILogger]: Start difference. First operand 435 states and 435 transitions. Second operand 143 states. [2019-05-23 09:28:49,083 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:49,084 INFO L146 ILogger]: Finished difference Result 445 states and 445 transitions. [2019-05-23 09:28:49,084 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2019-05-23 09:28:49,084 INFO L146 ILogger]: Start accepts. Automaton has 143 states. Word has length 434 [2019-05-23 09:28:49,085 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:49,086 INFO L146 ILogger]: With dead ends: 445 [2019-05-23 09:28:49,086 INFO L146 ILogger]: Without dead ends: 445 [2019-05-23 09:28:49,088 INFO L146 ILogger]: 0 DeclaredPredicates, 573 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2019-05-23 09:28:49,088 INFO L146 ILogger]: Start minimizeSevpa. Operand 445 states. [2019-05-23 09:28:49,090 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 445 to 441. [2019-05-23 09:28:49,091 INFO L146 ILogger]: Start removeUnreachable. Operand 441 states. [2019-05-23 09:28:49,091 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 441 states to 441 states and 441 transitions. [2019-05-23 09:28:49,091 INFO L146 ILogger]: Start accepts. Automaton has 441 states and 441 transitions. Word has length 434 [2019-05-23 09:28:49,091 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:49,091 INFO L146 ILogger]: Abstraction has 441 states and 441 transitions. [2019-05-23 09:28:49,091 INFO L146 ILogger]: Interpolant automaton has 143 states. [2019-05-23 09:28:49,092 INFO L146 ILogger]: Start isEmpty. Operand 441 states and 441 transitions. [2019-05-23 09:28:49,093 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 441 [2019-05-23 09:28:49,093 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:49,093 INFO L146 ILogger]: trace histogram [71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:28:49,093 INFO L146 ILogger]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:49,094 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:49,094 INFO L146 ILogger]: Analyzing trace with hash 2129458399, now seen corresponding path program 71 times [2019-05-23 09:28:49,094 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:49,122 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:49,128 INFO L146 ILogger]: Trace formula consists of 659 conjuncts, 144 conjunts are in the unsatisfiable core [2019-05-23 09:28:49,131 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:54,901 INFO L146 ILogger]: Checked inductivity of 14981 backedges. 0 proven. 14981 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:54,901 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:54,902 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2019-05-23 09:28:54,902 INFO L146 ILogger]: Interpolant automaton has 145 states [2019-05-23 09:28:54,903 INFO L146 ILogger]: Constructing interpolant automaton starting with 145 interpolants. [2019-05-23 09:28:54,903 INFO L146 ILogger]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2019-05-23 09:28:54,903 INFO L146 ILogger]: Start difference. First operand 441 states and 441 transitions. Second operand 145 states. [2019-05-23 09:29:04,988 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:04,988 INFO L146 ILogger]: Finished difference Result 451 states and 451 transitions. [2019-05-23 09:29:04,988 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2019-05-23 09:29:04,989 INFO L146 ILogger]: Start accepts. Automaton has 145 states. Word has length 440 [2019-05-23 09:29:04,989 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:04,990 INFO L146 ILogger]: With dead ends: 451 [2019-05-23 09:29:04,990 INFO L146 ILogger]: Without dead ends: 451 [2019-05-23 09:29:04,993 INFO L146 ILogger]: 0 DeclaredPredicates, 581 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2019-05-23 09:29:04,993 INFO L146 ILogger]: Start minimizeSevpa. Operand 451 states. [2019-05-23 09:29:04,995 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 451 to 447. [2019-05-23 09:29:04,995 INFO L146 ILogger]: Start removeUnreachable. Operand 447 states. [2019-05-23 09:29:04,996 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 447 states to 447 states and 447 transitions. [2019-05-23 09:29:04,996 INFO L146 ILogger]: Start accepts. Automaton has 447 states and 447 transitions. Word has length 440 [2019-05-23 09:29:04,996 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:04,996 INFO L146 ILogger]: Abstraction has 447 states and 447 transitions. [2019-05-23 09:29:04,996 INFO L146 ILogger]: Interpolant automaton has 145 states. [2019-05-23 09:29:04,996 INFO L146 ILogger]: Start isEmpty. Operand 447 states and 447 transitions. [2019-05-23 09:29:04,998 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 447 [2019-05-23 09:29:04,998 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:04,998 INFO L146 ILogger]: trace histogram [72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:29:04,998 INFO L146 ILogger]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:04,998 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:04,999 INFO L146 ILogger]: Analyzing trace with hash -1269877252, now seen corresponding path program 72 times [2019-05-23 09:29:04,999 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:05,027 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:05,035 INFO L146 ILogger]: Trace formula consists of 668 conjuncts, 146 conjunts are in the unsatisfiable core [2019-05-23 09:29:05,039 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:11,040 INFO L146 ILogger]: Checked inductivity of 15408 backedges. 0 proven. 15408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:11,041 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:11,041 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2019-05-23 09:29:11,041 INFO L146 ILogger]: Interpolant automaton has 147 states [2019-05-23 09:29:11,042 INFO L146 ILogger]: Constructing interpolant automaton starting with 147 interpolants. [2019-05-23 09:29:11,043 INFO L146 ILogger]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2019-05-23 09:29:11,043 INFO L146 ILogger]: Start difference. First operand 447 states and 447 transitions. Second operand 147 states. [2019-05-23 09:29:21,505 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:21,505 INFO L146 ILogger]: Finished difference Result 457 states and 457 transitions. [2019-05-23 09:29:21,506 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-05-23 09:29:21,506 INFO L146 ILogger]: Start accepts. Automaton has 147 states. Word has length 446 [2019-05-23 09:29:21,506 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:21,508 INFO L146 ILogger]: With dead ends: 457 [2019-05-23 09:29:21,508 INFO L146 ILogger]: Without dead ends: 457 [2019-05-23 09:29:21,512 INFO L146 ILogger]: 0 DeclaredPredicates, 589 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15408 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=26643, Invalid=57747, Unknown=0, NotChecked=0, Total=84390 [2019-05-23 09:29:21,512 INFO L146 ILogger]: Start minimizeSevpa. Operand 457 states. [2019-05-23 09:29:21,515 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 457 to 453. [2019-05-23 09:29:21,515 INFO L146 ILogger]: Start removeUnreachable. Operand 453 states. [2019-05-23 09:29:21,515 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 453 states to 453 states and 453 transitions. [2019-05-23 09:29:21,515 INFO L146 ILogger]: Start accepts. Automaton has 453 states and 453 transitions. Word has length 446 [2019-05-23 09:29:21,516 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:21,516 INFO L146 ILogger]: Abstraction has 453 states and 453 transitions. [2019-05-23 09:29:21,516 INFO L146 ILogger]: Interpolant automaton has 147 states. [2019-05-23 09:29:21,516 INFO L146 ILogger]: Start isEmpty. Operand 453 states and 453 transitions. [2019-05-23 09:29:21,517 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 453 [2019-05-23 09:29:21,517 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:21,518 INFO L146 ILogger]: trace histogram [73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:29:21,518 INFO L146 ILogger]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:21,518 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:21,518 INFO L146 ILogger]: Analyzing trace with hash 1263627609, now seen corresponding path program 73 times [2019-05-23 09:29:21,519 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:21,551 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:21,559 INFO L146 ILogger]: Trace formula consists of 677 conjuncts, 148 conjunts are in the unsatisfiable core [2019-05-23 09:29:21,564 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:27,575 INFO L146 ILogger]: Checked inductivity of 15841 backedges. 0 proven. 15841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:27,576 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:27,576 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2019-05-23 09:29:27,576 INFO L146 ILogger]: Interpolant automaton has 149 states [2019-05-23 09:29:27,578 INFO L146 ILogger]: Constructing interpolant automaton starting with 149 interpolants. [2019-05-23 09:29:27,579 INFO L146 ILogger]: CoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2019-05-23 09:29:27,579 INFO L146 ILogger]: Start difference. First operand 453 states and 453 transitions. Second operand 149 states. [2019-05-23 09:29:37,976 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:37,976 INFO L146 ILogger]: Finished difference Result 463 states and 463 transitions. [2019-05-23 09:29:37,976 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2019-05-23 09:29:37,976 INFO L146 ILogger]: Start accepts. Automaton has 149 states. Word has length 452 [2019-05-23 09:29:37,977 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:37,978 INFO L146 ILogger]: With dead ends: 463 [2019-05-23 09:29:37,978 INFO L146 ILogger]: Without dead ends: 463 [2019-05-23 09:29:37,980 INFO L146 ILogger]: 0 DeclaredPredicates, 597 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15841 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=27378, Invalid=59352, Unknown=0, NotChecked=0, Total=86730 [2019-05-23 09:29:37,980 INFO L146 ILogger]: Start minimizeSevpa. Operand 463 states. [2019-05-23 09:29:37,982 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 463 to 459. [2019-05-23 09:29:37,983 INFO L146 ILogger]: Start removeUnreachable. Operand 459 states. [2019-05-23 09:29:37,983 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 459 states to 459 states and 459 transitions. [2019-05-23 09:29:37,983 INFO L146 ILogger]: Start accepts. Automaton has 459 states and 459 transitions. Word has length 452 [2019-05-23 09:29:37,983 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:37,983 INFO L146 ILogger]: Abstraction has 459 states and 459 transitions. [2019-05-23 09:29:37,983 INFO L146 ILogger]: Interpolant automaton has 149 states. [2019-05-23 09:29:37,984 INFO L146 ILogger]: Start isEmpty. Operand 459 states and 459 transitions. [2019-05-23 09:29:37,985 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 459 [2019-05-23 09:29:37,985 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:37,985 INFO L146 ILogger]: trace histogram [74, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:29:37,986 INFO L146 ILogger]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:37,986 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:37,986 INFO L146 ILogger]: Analyzing trace with hash -953029898, now seen corresponding path program 74 times [2019-05-23 09:29:37,986 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:38,030 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:38,040 INFO L146 ILogger]: Trace formula consists of 686 conjuncts, 150 conjunts are in the unsatisfiable core [2019-05-23 09:29:38,046 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:44,303 INFO L146 ILogger]: Checked inductivity of 16280 backedges. 0 proven. 16280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:44,303 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:44,303 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2019-05-23 09:29:44,304 INFO L146 ILogger]: Interpolant automaton has 151 states [2019-05-23 09:29:44,304 INFO L146 ILogger]: Constructing interpolant automaton starting with 151 interpolants. [2019-05-23 09:29:44,305 INFO L146 ILogger]: CoverageRelationStatistics Valid=5775, Invalid=16875, Unknown=0, NotChecked=0, Total=22650 [2019-05-23 09:29:44,305 INFO L146 ILogger]: Start difference. First operand 459 states and 459 transitions. Second operand 151 states. [2019-05-23 09:29:55,013 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:55,013 INFO L146 ILogger]: Finished difference Result 469 states and 469 transitions. [2019-05-23 09:29:55,014 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2019-05-23 09:29:55,014 INFO L146 ILogger]: Start accepts. Automaton has 151 states. Word has length 458 [2019-05-23 09:29:55,014 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:55,016 INFO L146 ILogger]: With dead ends: 469 [2019-05-23 09:29:55,016 INFO L146 ILogger]: Without dead ends: 469 [2019-05-23 09:29:55,018 INFO L146 ILogger]: 0 DeclaredPredicates, 605 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16280 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=28123, Invalid=60979, Unknown=0, NotChecked=0, Total=89102 [2019-05-23 09:29:55,018 INFO L146 ILogger]: Start minimizeSevpa. Operand 469 states. [2019-05-23 09:29:55,020 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 469 to 465. [2019-05-23 09:29:55,020 INFO L146 ILogger]: Start removeUnreachable. Operand 465 states. [2019-05-23 09:29:55,021 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 465 states to 465 states and 465 transitions. [2019-05-23 09:29:55,021 INFO L146 ILogger]: Start accepts. Automaton has 465 states and 465 transitions. Word has length 458 [2019-05-23 09:29:55,021 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:55,021 INFO L146 ILogger]: Abstraction has 465 states and 465 transitions. [2019-05-23 09:29:55,021 INFO L146 ILogger]: Interpolant automaton has 151 states. [2019-05-23 09:29:55,021 INFO L146 ILogger]: Start isEmpty. Operand 465 states and 465 transitions. [2019-05-23 09:29:55,023 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 465 [2019-05-23 09:29:55,023 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:55,023 INFO L146 ILogger]: trace histogram [75, 75, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:29:55,024 INFO L146 ILogger]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:55,024 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:55,024 INFO L146 ILogger]: Analyzing trace with hash -1221394733, now seen corresponding path program 75 times [2019-05-23 09:29:55,024 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:55,047 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:55,053 INFO L146 ILogger]: Trace formula consists of 695 conjuncts, 152 conjunts are in the unsatisfiable core [2019-05-23 09:29:55,056 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:01,327 INFO L146 ILogger]: Checked inductivity of 16725 backedges. 0 proven. 16725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:01,328 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:01,328 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2019-05-23 09:30:01,328 INFO L146 ILogger]: Interpolant automaton has 153 states [2019-05-23 09:30:01,329 INFO L146 ILogger]: Constructing interpolant automaton starting with 153 interpolants. [2019-05-23 09:30:01,330 INFO L146 ILogger]: CoverageRelationStatistics Valid=5928, Invalid=17328, Unknown=0, NotChecked=0, Total=23256 [2019-05-23 09:30:01,330 INFO L146 ILogger]: Start difference. First operand 465 states and 465 transitions. Second operand 153 states. [2019-05-23 09:30:12,307 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:12,307 INFO L146 ILogger]: Finished difference Result 475 states and 475 transitions. [2019-05-23 09:30:12,307 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2019-05-23 09:30:12,307 INFO L146 ILogger]: Start accepts. Automaton has 153 states. Word has length 464 [2019-05-23 09:30:12,308 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:12,309 INFO L146 ILogger]: With dead ends: 475 [2019-05-23 09:30:12,309 INFO L146 ILogger]: Without dead ends: 475 [2019-05-23 09:30:12,311 INFO L146 ILogger]: 0 DeclaredPredicates, 613 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16725 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=28878, Invalid=62628, Unknown=0, NotChecked=0, Total=91506 [2019-05-23 09:30:12,312 INFO L146 ILogger]: Start minimizeSevpa. Operand 475 states. [2019-05-23 09:30:12,314 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 475 to 471. [2019-05-23 09:30:12,314 INFO L146 ILogger]: Start removeUnreachable. Operand 471 states. [2019-05-23 09:30:12,315 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 471 states to 471 states and 471 transitions. [2019-05-23 09:30:12,315 INFO L146 ILogger]: Start accepts. Automaton has 471 states and 471 transitions. Word has length 464 [2019-05-23 09:30:12,315 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:12,315 INFO L146 ILogger]: Abstraction has 471 states and 471 transitions. [2019-05-23 09:30:12,315 INFO L146 ILogger]: Interpolant automaton has 153 states. [2019-05-23 09:30:12,315 INFO L146 ILogger]: Start isEmpty. Operand 471 states and 471 transitions. [2019-05-23 09:30:12,317 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 471 [2019-05-23 09:30:12,317 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:12,317 INFO L146 ILogger]: trace histogram [76, 76, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:30:12,317 INFO L146 ILogger]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:12,318 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:12,318 INFO L146 ILogger]: Analyzing trace with hash -1550124816, now seen corresponding path program 76 times [2019-05-23 09:30:12,318 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:12,343 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:12,349 INFO L146 ILogger]: Trace formula consists of 704 conjuncts, 154 conjunts are in the unsatisfiable core [2019-05-23 09:30:12,352 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:18,701 INFO L146 ILogger]: Checked inductivity of 17176 backedges. 0 proven. 17176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:18,701 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:18,701 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2019-05-23 09:30:18,702 INFO L146 ILogger]: Interpolant automaton has 155 states [2019-05-23 09:30:18,703 INFO L146 ILogger]: Constructing interpolant automaton starting with 155 interpolants. [2019-05-23 09:30:18,704 INFO L146 ILogger]: CoverageRelationStatistics Valid=6083, Invalid=17787, Unknown=0, NotChecked=0, Total=23870 [2019-05-23 09:30:18,704 INFO L146 ILogger]: Start difference. First operand 471 states and 471 transitions. Second operand 155 states. [2019-05-23 09:30:29,856 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:29,856 INFO L146 ILogger]: Finished difference Result 481 states and 481 transitions. [2019-05-23 09:30:29,856 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2019-05-23 09:30:29,856 INFO L146 ILogger]: Start accepts. Automaton has 155 states. Word has length 470 [2019-05-23 09:30:29,857 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:29,858 INFO L146 ILogger]: With dead ends: 481 [2019-05-23 09:30:29,859 INFO L146 ILogger]: Without dead ends: 481 [2019-05-23 09:30:29,862 INFO L146 ILogger]: 0 DeclaredPredicates, 621 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17176 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=29643, Invalid=64299, Unknown=0, NotChecked=0, Total=93942 [2019-05-23 09:30:29,862 INFO L146 ILogger]: Start minimizeSevpa. Operand 481 states. [2019-05-23 09:30:29,864 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 481 to 477. [2019-05-23 09:30:29,865 INFO L146 ILogger]: Start removeUnreachable. Operand 477 states. [2019-05-23 09:30:29,865 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 477 states to 477 states and 477 transitions. [2019-05-23 09:30:29,865 INFO L146 ILogger]: Start accepts. Automaton has 477 states and 477 transitions. Word has length 470 [2019-05-23 09:30:29,866 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:29,866 INFO L146 ILogger]: Abstraction has 477 states and 477 transitions. [2019-05-23 09:30:29,866 INFO L146 ILogger]: Interpolant automaton has 155 states. [2019-05-23 09:30:29,866 INFO L146 ILogger]: Start isEmpty. Operand 477 states and 477 transitions. [2019-05-23 09:30:29,867 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 477 [2019-05-23 09:30:29,867 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:29,868 INFO L146 ILogger]: trace histogram [77, 77, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:30:29,868 INFO L146 ILogger]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:29,868 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:29,868 INFO L146 ILogger]: Analyzing trace with hash 984885581, now seen corresponding path program 77 times [2019-05-23 09:30:29,869 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:29,892 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:29,898 INFO L146 ILogger]: Trace formula consists of 713 conjuncts, 156 conjunts are in the unsatisfiable core [2019-05-23 09:30:29,901 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:36,696 INFO L146 ILogger]: Checked inductivity of 17633 backedges. 0 proven. 17633 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:36,697 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:36,697 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2019-05-23 09:30:36,697 INFO L146 ILogger]: Interpolant automaton has 157 states [2019-05-23 09:30:36,698 INFO L146 ILogger]: Constructing interpolant automaton starting with 157 interpolants. [2019-05-23 09:30:36,699 INFO L146 ILogger]: CoverageRelationStatistics Valid=6240, Invalid=18252, Unknown=0, NotChecked=0, Total=24492 [2019-05-23 09:30:36,699 INFO L146 ILogger]: Start difference. First operand 477 states and 477 transitions. Second operand 157 states. [2019-05-23 09:30:48,426 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:48,426 INFO L146 ILogger]: Finished difference Result 487 states and 487 transitions. [2019-05-23 09:30:48,426 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2019-05-23 09:30:48,427 INFO L146 ILogger]: Start accepts. Automaton has 157 states. Word has length 476 [2019-05-23 09:30:48,427 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:48,428 INFO L146 ILogger]: With dead ends: 487 [2019-05-23 09:30:48,428 INFO L146 ILogger]: Without dead ends: 487 [2019-05-23 09:30:48,431 INFO L146 ILogger]: 0 DeclaredPredicates, 629 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17633 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=30418, Invalid=65992, Unknown=0, NotChecked=0, Total=96410 [2019-05-23 09:30:48,431 INFO L146 ILogger]: Start minimizeSevpa. Operand 487 states. [2019-05-23 09:30:48,434 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 487 to 483. [2019-05-23 09:30:48,434 INFO L146 ILogger]: Start removeUnreachable. Operand 483 states. [2019-05-23 09:30:48,435 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 483 states to 483 states and 483 transitions. [2019-05-23 09:30:48,435 INFO L146 ILogger]: Start accepts. Automaton has 483 states and 483 transitions. Word has length 476 [2019-05-23 09:30:48,435 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:48,435 INFO L146 ILogger]: Abstraction has 483 states and 483 transitions. [2019-05-23 09:30:48,435 INFO L146 ILogger]: Interpolant automaton has 157 states. [2019-05-23 09:30:48,435 INFO L146 ILogger]: Start isEmpty. Operand 483 states and 483 transitions. [2019-05-23 09:30:48,437 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 483 [2019-05-23 09:30:48,437 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:48,437 INFO L146 ILogger]: trace histogram [78, 78, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:30:48,437 INFO L146 ILogger]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:48,437 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:48,438 INFO L146 ILogger]: Analyzing trace with hash -1110646806, now seen corresponding path program 78 times [2019-05-23 09:30:48,438 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:48,463 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:48,469 INFO L146 ILogger]: Trace formula consists of 722 conjuncts, 158 conjunts are in the unsatisfiable core [2019-05-23 09:30:48,472 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:55,133 INFO L146 ILogger]: Checked inductivity of 18096 backedges. 0 proven. 18096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:55,133 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:55,133 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2019-05-23 09:30:55,134 INFO L146 ILogger]: Interpolant automaton has 159 states [2019-05-23 09:30:55,135 INFO L146 ILogger]: Constructing interpolant automaton starting with 159 interpolants. [2019-05-23 09:30:55,135 INFO L146 ILogger]: CoverageRelationStatistics Valid=6399, Invalid=18723, Unknown=0, NotChecked=0, Total=25122 [2019-05-23 09:30:55,135 INFO L146 ILogger]: Start difference. First operand 483 states and 483 transitions. Second operand 159 states. [2019-05-23 09:31:06,714 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:06,714 INFO L146 ILogger]: Finished difference Result 493 states and 493 transitions. [2019-05-23 09:31:06,715 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2019-05-23 09:31:06,715 INFO L146 ILogger]: Start accepts. Automaton has 159 states. Word has length 482 [2019-05-23 09:31:06,715 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:06,717 INFO L146 ILogger]: With dead ends: 493 [2019-05-23 09:31:06,717 INFO L146 ILogger]: Without dead ends: 493 [2019-05-23 09:31:06,720 INFO L146 ILogger]: 0 DeclaredPredicates, 637 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18096 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=31203, Invalid=67707, Unknown=0, NotChecked=0, Total=98910 [2019-05-23 09:31:06,721 INFO L146 ILogger]: Start minimizeSevpa. Operand 493 states. [2019-05-23 09:31:06,723 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 493 to 489. [2019-05-23 09:31:06,723 INFO L146 ILogger]: Start removeUnreachable. Operand 489 states. [2019-05-23 09:31:06,724 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 489 states to 489 states and 489 transitions. [2019-05-23 09:31:06,724 INFO L146 ILogger]: Start accepts. Automaton has 489 states and 489 transitions. Word has length 482 [2019-05-23 09:31:06,724 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:06,724 INFO L146 ILogger]: Abstraction has 489 states and 489 transitions. [2019-05-23 09:31:06,724 INFO L146 ILogger]: Interpolant automaton has 159 states. [2019-05-23 09:31:06,724 INFO L146 ILogger]: Start isEmpty. Operand 489 states and 489 transitions. [2019-05-23 09:31:06,726 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 489 [2019-05-23 09:31:06,726 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:06,726 INFO L146 ILogger]: trace histogram [79, 79, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:31:06,726 INFO L146 ILogger]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:06,726 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:06,727 INFO L146 ILogger]: Analyzing trace with hash -1372099385, now seen corresponding path program 79 times [2019-05-23 09:31:06,727 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:06,753 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:06,759 INFO L146 ILogger]: Trace formula consists of 731 conjuncts, 160 conjunts are in the unsatisfiable core [2019-05-23 09:31:06,763 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:13,856 INFO L146 ILogger]: Checked inductivity of 18565 backedges. 0 proven. 18565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:13,856 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:13,856 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2019-05-23 09:31:13,857 INFO L146 ILogger]: Interpolant automaton has 161 states [2019-05-23 09:31:13,858 INFO L146 ILogger]: Constructing interpolant automaton starting with 161 interpolants. [2019-05-23 09:31:13,858 INFO L146 ILogger]: CoverageRelationStatistics Valid=6560, Invalid=19200, Unknown=0, NotChecked=0, Total=25760 [2019-05-23 09:31:13,858 INFO L146 ILogger]: Start difference. First operand 489 states and 489 transitions. Second operand 161 states. [2019-05-23 09:31:25,887 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:25,887 INFO L146 ILogger]: Finished difference Result 499 states and 499 transitions. [2019-05-23 09:31:25,887 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2019-05-23 09:31:25,888 INFO L146 ILogger]: Start accepts. Automaton has 161 states. Word has length 488 [2019-05-23 09:31:25,888 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:25,889 INFO L146 ILogger]: With dead ends: 499 [2019-05-23 09:31:25,889 INFO L146 ILogger]: Without dead ends: 499 [2019-05-23 09:31:25,893 INFO L146 ILogger]: 0 DeclaredPredicates, 645 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18565 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=31998, Invalid=69444, Unknown=0, NotChecked=0, Total=101442 [2019-05-23 09:31:25,893 INFO L146 ILogger]: Start minimizeSevpa. Operand 499 states. [2019-05-23 09:31:25,896 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 499 to 495. [2019-05-23 09:31:25,896 INFO L146 ILogger]: Start removeUnreachable. Operand 495 states. [2019-05-23 09:31:25,896 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 495 states to 495 states and 495 transitions. [2019-05-23 09:31:25,896 INFO L146 ILogger]: Start accepts. Automaton has 495 states and 495 transitions. Word has length 488 [2019-05-23 09:31:25,896 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:25,897 INFO L146 ILogger]: Abstraction has 495 states and 495 transitions. [2019-05-23 09:31:25,897 INFO L146 ILogger]: Interpolant automaton has 161 states. [2019-05-23 09:31:25,897 INFO L146 ILogger]: Start isEmpty. Operand 495 states and 495 transitions. [2019-05-23 09:31:25,898 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 495 [2019-05-23 09:31:25,898 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:25,899 INFO L146 ILogger]: trace histogram [80, 80, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:31:25,899 INFO L146 ILogger]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:25,899 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:25,899 INFO L146 ILogger]: Analyzing trace with hash -1169547292, now seen corresponding path program 80 times [2019-05-23 09:31:25,899 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:25,940 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:25,949 INFO L146 ILogger]: Trace formula consists of 740 conjuncts, 162 conjunts are in the unsatisfiable core [2019-05-23 09:31:25,954 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:33,107 INFO L146 ILogger]: Checked inductivity of 19040 backedges. 0 proven. 19040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:33,107 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:33,108 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2019-05-23 09:31:33,108 INFO L146 ILogger]: Interpolant automaton has 163 states [2019-05-23 09:31:33,109 INFO L146 ILogger]: Constructing interpolant automaton starting with 163 interpolants. [2019-05-23 09:31:33,110 INFO L146 ILogger]: CoverageRelationStatistics Valid=6723, Invalid=19683, Unknown=0, NotChecked=0, Total=26406 [2019-05-23 09:31:33,110 INFO L146 ILogger]: Start difference. First operand 495 states and 495 transitions. Second operand 163 states. [2019-05-23 09:31:45,731 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:45,731 INFO L146 ILogger]: Finished difference Result 505 states and 505 transitions. [2019-05-23 09:31:45,731 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2019-05-23 09:31:45,732 INFO L146 ILogger]: Start accepts. Automaton has 163 states. Word has length 494 [2019-05-23 09:31:45,732 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:45,734 INFO L146 ILogger]: With dead ends: 505 [2019-05-23 09:31:45,735 INFO L146 ILogger]: Without dead ends: 505 [2019-05-23 09:31:45,739 INFO L146 ILogger]: 0 DeclaredPredicates, 653 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19040 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=32803, Invalid=71203, Unknown=0, NotChecked=0, Total=104006 [2019-05-23 09:31:45,739 INFO L146 ILogger]: Start minimizeSevpa. Operand 505 states. [2019-05-23 09:31:45,742 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 505 to 501. [2019-05-23 09:31:45,742 INFO L146 ILogger]: Start removeUnreachable. Operand 501 states. [2019-05-23 09:31:45,742 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 501 states to 501 states and 501 transitions. [2019-05-23 09:31:45,742 INFO L146 ILogger]: Start accepts. Automaton has 501 states and 501 transitions. Word has length 494 [2019-05-23 09:31:45,742 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:45,742 INFO L146 ILogger]: Abstraction has 501 states and 501 transitions. [2019-05-23 09:31:45,743 INFO L146 ILogger]: Interpolant automaton has 163 states. [2019-05-23 09:31:45,743 INFO L146 ILogger]: Start isEmpty. Operand 501 states and 501 transitions. [2019-05-23 09:31:45,744 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 501 [2019-05-23 09:31:45,744 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:45,745 INFO L146 ILogger]: trace histogram [81, 81, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:31:45,745 INFO L146 ILogger]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:45,745 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:45,745 INFO L146 ILogger]: Analyzing trace with hash -362854079, now seen corresponding path program 81 times [2019-05-23 09:31:45,746 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:45,787 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:45,794 INFO L146 ILogger]: Trace formula consists of 749 conjuncts, 164 conjunts are in the unsatisfiable core [2019-05-23 09:31:45,797 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:53,155 INFO L146 ILogger]: Checked inductivity of 19521 backedges. 0 proven. 19521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:53,156 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:53,156 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2019-05-23 09:31:53,156 INFO L146 ILogger]: Interpolant automaton has 165 states [2019-05-23 09:31:53,157 INFO L146 ILogger]: Constructing interpolant automaton starting with 165 interpolants. [2019-05-23 09:31:53,158 INFO L146 ILogger]: CoverageRelationStatistics Valid=6888, Invalid=20172, Unknown=0, NotChecked=0, Total=27060 [2019-05-23 09:31:53,158 INFO L146 ILogger]: Start difference. First operand 501 states and 501 transitions. Second operand 165 states. [2019-05-23 09:32:05,950 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:05,950 INFO L146 ILogger]: Finished difference Result 511 states and 511 transitions. [2019-05-23 09:32:05,950 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2019-05-23 09:32:05,951 INFO L146 ILogger]: Start accepts. Automaton has 165 states. Word has length 500 [2019-05-23 09:32:05,951 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:05,953 INFO L146 ILogger]: With dead ends: 511 [2019-05-23 09:32:05,953 INFO L146 ILogger]: Without dead ends: 511 [2019-05-23 09:32:05,956 INFO L146 ILogger]: 0 DeclaredPredicates, 661 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19521 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=33618, Invalid=72984, Unknown=0, NotChecked=0, Total=106602 [2019-05-23 09:32:05,957 INFO L146 ILogger]: Start minimizeSevpa. Operand 511 states. [2019-05-23 09:32:05,959 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 511 to 507. [2019-05-23 09:32:05,959 INFO L146 ILogger]: Start removeUnreachable. Operand 507 states. [2019-05-23 09:32:05,960 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 507 states to 507 states and 507 transitions. [2019-05-23 09:32:05,960 INFO L146 ILogger]: Start accepts. Automaton has 507 states and 507 transitions. Word has length 500 [2019-05-23 09:32:05,960 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:05,960 INFO L146 ILogger]: Abstraction has 507 states and 507 transitions. [2019-05-23 09:32:05,960 INFO L146 ILogger]: Interpolant automaton has 165 states. [2019-05-23 09:32:05,960 INFO L146 ILogger]: Start isEmpty. Operand 507 states and 507 transitions. [2019-05-23 09:32:05,962 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 507 [2019-05-23 09:32:05,962 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:05,963 INFO L146 ILogger]: trace histogram [82, 82, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:32:05,963 INFO L146 ILogger]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:05,963 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:05,963 INFO L146 ILogger]: Analyzing trace with hash 232077534, now seen corresponding path program 82 times [2019-05-23 09:32:05,964 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:05,991 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:05,997 INFO L146 ILogger]: Trace formula consists of 758 conjuncts, 166 conjunts are in the unsatisfiable core [2019-05-23 09:32:06,000 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:13,488 INFO L146 ILogger]: Checked inductivity of 20008 backedges. 0 proven. 20008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:13,489 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:13,489 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2019-05-23 09:32:13,490 INFO L146 ILogger]: Interpolant automaton has 167 states [2019-05-23 09:32:13,491 INFO L146 ILogger]: Constructing interpolant automaton starting with 167 interpolants. [2019-05-23 09:32:13,492 INFO L146 ILogger]: CoverageRelationStatistics Valid=7055, Invalid=20667, Unknown=0, NotChecked=0, Total=27722 [2019-05-23 09:32:13,492 INFO L146 ILogger]: Start difference. First operand 507 states and 507 transitions. Second operand 167 states. [2019-05-23 09:32:26,853 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:26,853 INFO L146 ILogger]: Finished difference Result 517 states and 517 transitions. [2019-05-23 09:32:26,854 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2019-05-23 09:32:26,854 INFO L146 ILogger]: Start accepts. Automaton has 167 states. Word has length 506 [2019-05-23 09:32:26,854 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:26,855 INFO L146 ILogger]: With dead ends: 517 [2019-05-23 09:32:26,855 INFO L146 ILogger]: Without dead ends: 517 [2019-05-23 09:32:26,859 INFO L146 ILogger]: 0 DeclaredPredicates, 669 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20008 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=34443, Invalid=74787, Unknown=0, NotChecked=0, Total=109230 [2019-05-23 09:32:26,860 INFO L146 ILogger]: Start minimizeSevpa. Operand 517 states. [2019-05-23 09:32:26,862 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 517 to 513. [2019-05-23 09:32:26,862 INFO L146 ILogger]: Start removeUnreachable. Operand 513 states. [2019-05-23 09:32:26,863 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 513 states to 513 states and 513 transitions. [2019-05-23 09:32:26,863 INFO L146 ILogger]: Start accepts. Automaton has 513 states and 513 transitions. Word has length 506 [2019-05-23 09:32:26,863 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:26,863 INFO L146 ILogger]: Abstraction has 513 states and 513 transitions. [2019-05-23 09:32:26,863 INFO L146 ILogger]: Interpolant automaton has 167 states. [2019-05-23 09:32:26,863 INFO L146 ILogger]: Start isEmpty. Operand 513 states and 513 transitions. [2019-05-23 09:32:26,865 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 513 [2019-05-23 09:32:26,865 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:26,865 INFO L146 ILogger]: trace histogram [83, 83, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:32:26,866 INFO L146 ILogger]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:26,866 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:26,866 INFO L146 ILogger]: Analyzing trace with hash 1745764027, now seen corresponding path program 83 times [2019-05-23 09:32:26,866 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:26,893 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:26,900 INFO L146 ILogger]: Trace formula consists of 767 conjuncts, 168 conjunts are in the unsatisfiable core [2019-05-23 09:32:26,904 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:34,485 INFO L146 ILogger]: Checked inductivity of 20501 backedges. 0 proven. 20501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:34,485 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:34,485 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2019-05-23 09:32:34,486 INFO L146 ILogger]: Interpolant automaton has 169 states [2019-05-23 09:32:34,487 INFO L146 ILogger]: Constructing interpolant automaton starting with 169 interpolants. [2019-05-23 09:32:34,488 INFO L146 ILogger]: CoverageRelationStatistics Valid=7224, Invalid=21168, Unknown=0, NotChecked=0, Total=28392 [2019-05-23 09:32:34,488 INFO L146 ILogger]: Start difference. First operand 513 states and 513 transitions. Second operand 169 states. [2019-05-23 09:32:47,724 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:47,724 INFO L146 ILogger]: Finished difference Result 523 states and 523 transitions. [2019-05-23 09:32:47,725 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 252 states. [2019-05-23 09:32:47,725 INFO L146 ILogger]: Start accepts. Automaton has 169 states. Word has length 512 [2019-05-23 09:32:47,725 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:47,728 INFO L146 ILogger]: With dead ends: 523 [2019-05-23 09:32:47,728 INFO L146 ILogger]: Without dead ends: 523 [2019-05-23 09:32:47,732 INFO L146 ILogger]: 0 DeclaredPredicates, 677 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20501 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=35278, Invalid=76612, Unknown=0, NotChecked=0, Total=111890 [2019-05-23 09:32:47,732 INFO L146 ILogger]: Start minimizeSevpa. Operand 523 states. [2019-05-23 09:32:47,735 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 523 to 519. [2019-05-23 09:32:47,735 INFO L146 ILogger]: Start removeUnreachable. Operand 519 states. [2019-05-23 09:32:47,736 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 519 states to 519 states and 519 transitions. [2019-05-23 09:32:47,736 INFO L146 ILogger]: Start accepts. Automaton has 519 states and 519 transitions. Word has length 512 [2019-05-23 09:32:47,736 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:47,736 INFO L146 ILogger]: Abstraction has 519 states and 519 transitions. [2019-05-23 09:32:47,736 INFO L146 ILogger]: Interpolant automaton has 169 states. [2019-05-23 09:32:47,736 INFO L146 ILogger]: Start isEmpty. Operand 519 states and 519 transitions. [2019-05-23 09:32:47,738 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 519 [2019-05-23 09:32:47,738 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:47,738 INFO L146 ILogger]: trace histogram [84, 84, 84, 84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:32:47,738 INFO L146 ILogger]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:47,738 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:47,739 INFO L146 ILogger]: Analyzing trace with hash -1653560616, now seen corresponding path program 84 times [2019-05-23 09:32:47,739 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:47,766 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:47,773 INFO L146 ILogger]: Trace formula consists of 776 conjuncts, 170 conjunts are in the unsatisfiable core [2019-05-23 09:32:47,776 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:55,544 INFO L146 ILogger]: Checked inductivity of 21000 backedges. 0 proven. 21000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:55,545 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:55,545 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2019-05-23 09:32:55,545 INFO L146 ILogger]: Interpolant automaton has 171 states [2019-05-23 09:32:55,546 INFO L146 ILogger]: Constructing interpolant automaton starting with 171 interpolants. [2019-05-23 09:32:55,547 INFO L146 ILogger]: CoverageRelationStatistics Valid=7395, Invalid=21675, Unknown=0, NotChecked=0, Total=29070 [2019-05-23 09:32:55,547 INFO L146 ILogger]: Start difference. First operand 519 states and 519 transitions. Second operand 171 states. [2019-05-23 09:33:09,571 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:09,572 INFO L146 ILogger]: Finished difference Result 529 states and 529 transitions. [2019-05-23 09:33:09,572 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2019-05-23 09:33:09,572 INFO L146 ILogger]: Start accepts. Automaton has 171 states. Word has length 518 [2019-05-23 09:33:09,573 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:09,575 INFO L146 ILogger]: With dead ends: 529 [2019-05-23 09:33:09,575 INFO L146 ILogger]: Without dead ends: 529 [2019-05-23 09:33:09,579 INFO L146 ILogger]: 0 DeclaredPredicates, 685 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21000 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=36123, Invalid=78459, Unknown=0, NotChecked=0, Total=114582 [2019-05-23 09:33:09,580 INFO L146 ILogger]: Start minimizeSevpa. Operand 529 states. [2019-05-23 09:33:09,582 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 529 to 525. [2019-05-23 09:33:09,582 INFO L146 ILogger]: Start removeUnreachable. Operand 525 states. [2019-05-23 09:33:09,583 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 525 states to 525 states and 525 transitions. [2019-05-23 09:33:09,583 INFO L146 ILogger]: Start accepts. Automaton has 525 states and 525 transitions. Word has length 518 [2019-05-23 09:33:09,584 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:09,584 INFO L146 ILogger]: Abstraction has 525 states and 525 transitions. [2019-05-23 09:33:09,584 INFO L146 ILogger]: Interpolant automaton has 171 states. [2019-05-23 09:33:09,584 INFO L146 ILogger]: Start isEmpty. Operand 525 states and 525 transitions. [2019-05-23 09:33:09,586 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 525 [2019-05-23 09:33:09,586 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:09,586 INFO L146 ILogger]: trace histogram [85, 85, 85, 85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:33:09,586 INFO L146 ILogger]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:09,587 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:09,587 INFO L146 ILogger]: Analyzing trace with hash -530133707, now seen corresponding path program 85 times [2019-05-23 09:33:09,587 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:09,618 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:09,624 INFO L146 ILogger]: Trace formula consists of 785 conjuncts, 172 conjunts are in the unsatisfiable core [2019-05-23 09:33:09,628 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:17,645 INFO L146 ILogger]: Checked inductivity of 21505 backedges. 0 proven. 21505 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:33:17,646 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:17,646 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2019-05-23 09:33:17,647 INFO L146 ILogger]: Interpolant automaton has 173 states [2019-05-23 09:33:17,648 INFO L146 ILogger]: Constructing interpolant automaton starting with 173 interpolants. [2019-05-23 09:33:17,649 INFO L146 ILogger]: CoverageRelationStatistics Valid=7568, Invalid=22188, Unknown=0, NotChecked=0, Total=29756 [2019-05-23 09:33:17,649 INFO L146 ILogger]: Start difference. First operand 525 states and 525 transitions. Second operand 173 states. [2019-05-23 09:33:31,470 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:31,470 INFO L146 ILogger]: Finished difference Result 535 states and 535 transitions. [2019-05-23 09:33:31,470 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2019-05-23 09:33:31,470 INFO L146 ILogger]: Start accepts. Automaton has 173 states. Word has length 524 [2019-05-23 09:33:31,471 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:31,472 INFO L146 ILogger]: With dead ends: 535 [2019-05-23 09:33:31,472 INFO L146 ILogger]: Without dead ends: 535 [2019-05-23 09:33:31,476 INFO L146 ILogger]: 0 DeclaredPredicates, 693 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21505 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=36978, Invalid=80328, Unknown=0, NotChecked=0, Total=117306 [2019-05-23 09:33:31,477 INFO L146 ILogger]: Start minimizeSevpa. Operand 535 states. [2019-05-23 09:33:31,480 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 535 to 531. [2019-05-23 09:33:31,480 INFO L146 ILogger]: Start removeUnreachable. Operand 531 states. [2019-05-23 09:33:31,481 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 531 states to 531 states and 531 transitions. [2019-05-23 09:33:31,481 INFO L146 ILogger]: Start accepts. Automaton has 531 states and 531 transitions. Word has length 524 [2019-05-23 09:33:31,481 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:31,481 INFO L146 ILogger]: Abstraction has 531 states and 531 transitions. [2019-05-23 09:33:31,481 INFO L146 ILogger]: Interpolant automaton has 173 states. [2019-05-23 09:33:31,482 INFO L146 ILogger]: Start isEmpty. Operand 531 states and 531 transitions. [2019-05-23 09:33:31,484 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 531 [2019-05-23 09:33:31,484 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:31,484 INFO L146 ILogger]: trace histogram [86, 86, 86, 86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:33:31,484 INFO L146 ILogger]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:31,485 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:31,485 INFO L146 ILogger]: Analyzing trace with hash 1583281618, now seen corresponding path program 86 times [2019-05-23 09:33:31,485 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:31,527 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:31,539 INFO L146 ILogger]: Trace formula consists of 794 conjuncts, 174 conjunts are in the unsatisfiable core [2019-05-23 09:33:31,545 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:39,800 INFO L146 ILogger]: Checked inductivity of 22016 backedges. 0 proven. 22016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:33:39,801 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:39,801 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2019-05-23 09:33:39,802 INFO L146 ILogger]: Interpolant automaton has 175 states [2019-05-23 09:33:39,803 INFO L146 ILogger]: Constructing interpolant automaton starting with 175 interpolants. [2019-05-23 09:33:39,805 INFO L146 ILogger]: CoverageRelationStatistics Valid=7743, Invalid=22707, Unknown=0, NotChecked=0, Total=30450 [2019-05-23 09:33:39,805 INFO L146 ILogger]: Start difference. First operand 531 states and 531 transitions. Second operand 175 states. [2019-05-23 09:33:54,293 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:54,293 INFO L146 ILogger]: Finished difference Result 541 states and 541 transitions. [2019-05-23 09:33:54,294 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-05-23 09:33:54,294 INFO L146 ILogger]: Start accepts. Automaton has 175 states. Word has length 530 [2019-05-23 09:33:54,294 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:54,297 INFO L146 ILogger]: With dead ends: 541 [2019-05-23 09:33:54,297 INFO L146 ILogger]: Without dead ends: 541 [2019-05-23 09:33:54,301 INFO L146 ILogger]: 0 DeclaredPredicates, 701 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22016 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=37843, Invalid=82219, Unknown=0, NotChecked=0, Total=120062 [2019-05-23 09:33:54,302 INFO L146 ILogger]: Start minimizeSevpa. Operand 541 states. [2019-05-23 09:33:54,304 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 541 to 537. [2019-05-23 09:33:54,304 INFO L146 ILogger]: Start removeUnreachable. Operand 537 states. [2019-05-23 09:33:54,305 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 537 states to 537 states and 537 transitions. [2019-05-23 09:33:54,305 INFO L146 ILogger]: Start accepts. Automaton has 537 states and 537 transitions. Word has length 530 [2019-05-23 09:33:54,305 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:54,305 INFO L146 ILogger]: Abstraction has 537 states and 537 transitions. [2019-05-23 09:33:54,305 INFO L146 ILogger]: Interpolant automaton has 175 states. [2019-05-23 09:33:54,305 INFO L146 ILogger]: Start isEmpty. Operand 537 states and 537 transitions. [2019-05-23 09:33:54,307 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 537 [2019-05-23 09:33:54,307 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:54,308 INFO L146 ILogger]: trace histogram [87, 87, 87, 87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:33:54,308 INFO L146 ILogger]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:54,308 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:54,308 INFO L146 ILogger]: Analyzing trace with hash -322210641, now seen corresponding path program 87 times [2019-05-23 09:33:54,308 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:54,337 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:54,344 INFO L146 ILogger]: Trace formula consists of 803 conjuncts, 176 conjunts are in the unsatisfiable core [2019-05-23 09:33:54,348 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:34:02,779 INFO L146 ILogger]: Checked inductivity of 22533 backedges. 0 proven. 22533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:34:02,780 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:34:02,780 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2019-05-23 09:34:02,781 INFO L146 ILogger]: Interpolant automaton has 177 states [2019-05-23 09:34:02,782 INFO L146 ILogger]: Constructing interpolant automaton starting with 177 interpolants. [2019-05-23 09:34:02,783 INFO L146 ILogger]: CoverageRelationStatistics Valid=7920, Invalid=23232, Unknown=0, NotChecked=0, Total=31152 [2019-05-23 09:34:02,783 INFO L146 ILogger]: Start difference. First operand 537 states and 537 transitions. Second operand 177 states. [2019-05-23 09:34:17,387 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:34:17,388 INFO L146 ILogger]: Finished difference Result 547 states and 547 transitions. [2019-05-23 09:34:17,388 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2019-05-23 09:34:17,388 INFO L146 ILogger]: Start accepts. Automaton has 177 states. Word has length 536 [2019-05-23 09:34:17,389 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:34:17,390 INFO L146 ILogger]: With dead ends: 547 [2019-05-23 09:34:17,390 INFO L146 ILogger]: Without dead ends: 547 [2019-05-23 09:34:17,395 INFO L146 ILogger]: 0 DeclaredPredicates, 709 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22533 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=38718, Invalid=84132, Unknown=0, NotChecked=0, Total=122850 [2019-05-23 09:34:17,395 INFO L146 ILogger]: Start minimizeSevpa. Operand 547 states. [2019-05-23 09:34:17,398 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 547 to 543. [2019-05-23 09:34:17,398 INFO L146 ILogger]: Start removeUnreachable. Operand 543 states. [2019-05-23 09:34:17,398 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 543 states to 543 states and 543 transitions. [2019-05-23 09:34:17,398 INFO L146 ILogger]: Start accepts. Automaton has 543 states and 543 transitions. Word has length 536 [2019-05-23 09:34:17,399 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:34:17,399 INFO L146 ILogger]: Abstraction has 543 states and 543 transitions. [2019-05-23 09:34:17,399 INFO L146 ILogger]: Interpolant automaton has 177 states. [2019-05-23 09:34:17,399 INFO L146 ILogger]: Start isEmpty. Operand 543 states and 543 transitions. [2019-05-23 09:34:17,401 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 543 [2019-05-23 09:34:17,401 INFO L146 ILogger]: Found error trace [2019-05-23 09:34:17,401 INFO L146 ILogger]: trace histogram [88, 88, 88, 88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:34:17,401 INFO L146 ILogger]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:34:17,401 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:34:17,402 INFO L146 ILogger]: Analyzing trace with hash -165504564, now seen corresponding path program 88 times [2019-05-23 09:34:17,402 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:34:17,431 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:34:17,438 INFO L146 ILogger]: Trace formula consists of 812 conjuncts, 178 conjunts are in the unsatisfiable core [2019-05-23 09:34:17,442 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:34:26,068 INFO L146 ILogger]: Checked inductivity of 23056 backedges. 0 proven. 23056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:34:26,068 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:34:26,068 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2019-05-23 09:34:26,069 INFO L146 ILogger]: Interpolant automaton has 179 states [2019-05-23 09:34:26,070 INFO L146 ILogger]: Constructing interpolant automaton starting with 179 interpolants. [2019-05-23 09:34:26,072 INFO L146 ILogger]: CoverageRelationStatistics Valid=8099, Invalid=23763, Unknown=0, NotChecked=0, Total=31862 [2019-05-23 09:34:26,072 INFO L146 ILogger]: Start difference. First operand 543 states and 543 transitions. Second operand 179 states. [2019-05-23 09:34:41,164 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:34:41,165 INFO L146 ILogger]: Finished difference Result 553 states and 553 transitions. [2019-05-23 09:34:41,165 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 267 states. [2019-05-23 09:34:41,165 INFO L146 ILogger]: Start accepts. Automaton has 179 states. Word has length 542 [2019-05-23 09:34:41,166 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:34:41,168 INFO L146 ILogger]: With dead ends: 553 [2019-05-23 09:34:41,168 INFO L146 ILogger]: Without dead ends: 553 [2019-05-23 09:34:41,170 INFO L146 ILogger]: 0 DeclaredPredicates, 717 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23056 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=39603, Invalid=86067, Unknown=0, NotChecked=0, Total=125670 [2019-05-23 09:34:41,170 INFO L146 ILogger]: Start minimizeSevpa. Operand 553 states. [2019-05-23 09:34:41,173 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 553 to 549. [2019-05-23 09:34:41,173 INFO L146 ILogger]: Start removeUnreachable. Operand 549 states. [2019-05-23 09:34:41,173 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 549 states to 549 states and 549 transitions. [2019-05-23 09:34:41,173 INFO L146 ILogger]: Start accepts. Automaton has 549 states and 549 transitions. Word has length 542 [2019-05-23 09:34:41,174 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:34:41,174 INFO L146 ILogger]: Abstraction has 549 states and 549 transitions. [2019-05-23 09:34:41,174 INFO L146 ILogger]: Interpolant automaton has 179 states. [2019-05-23 09:34:41,174 INFO L146 ILogger]: Start isEmpty. Operand 549 states and 549 transitions. [2019-05-23 09:34:41,176 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 549 [2019-05-23 09:34:41,176 INFO L146 ILogger]: Found error trace [2019-05-23 09:34:41,176 INFO L146 ILogger]: trace histogram [89, 89, 89, 89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:34:41,176 INFO L146 ILogger]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:34:41,176 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:34:41,176 INFO L146 ILogger]: Analyzing trace with hash -1495354071, now seen corresponding path program 89 times [2019-05-23 09:34:41,177 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:34:41,223 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:34:41,233 INFO L146 ILogger]: Trace formula consists of 821 conjuncts, 180 conjunts are in the unsatisfiable core [2019-05-23 09:34:41,239 INFO L146 ILogger]: Computing forward predicates...