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/vogal.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-7aa59a0 [2019-05-23 09:21:57,373 INFO L146 ILogger]: Resetting all preferences to default values... [2019-05-23 09:21:57,375 INFO L146 ILogger]: Resetting UltimateCore preferences to default values [2019-05-23 09:21:57,392 INFO L146 ILogger]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-23 09:21:57,392 INFO L146 ILogger]: Resetting Boogie Preprocessor preferences to default values [2019-05-23 09:21:57,393 INFO L146 ILogger]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-23 09:21:57,396 INFO L146 ILogger]: Resetting Abstract Interpretation preferences to default values [2019-05-23 09:21:57,399 INFO L146 ILogger]: Resetting LassoRanker preferences to default values [2019-05-23 09:21:57,401 INFO L146 ILogger]: Resetting Reaching Definitions preferences to default values [2019-05-23 09:21:57,405 INFO L146 ILogger]: Resetting SyntaxChecker preferences to default values [2019-05-23 09:21:57,406 INFO L146 ILogger]: Büchi Program Product provides no preferences, ignoring... [2019-05-23 09:21:57,406 INFO L146 ILogger]: Resetting LTL2Aut preferences to default values [2019-05-23 09:21:57,407 INFO L146 ILogger]: Resetting PEA to Boogie preferences to default values [2019-05-23 09:21:57,417 INFO L146 ILogger]: Resetting BlockEncodingV2 preferences to default values [2019-05-23 09:21:57,419 INFO L146 ILogger]: Resetting ChcToBoogie preferences to default values [2019-05-23 09:21:57,420 INFO L146 ILogger]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-23 09:21:57,420 INFO L146 ILogger]: Resetting BuchiAutomizer preferences to default values [2019-05-23 09:21:57,427 INFO L146 ILogger]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-23 09:21:57,430 INFO L146 ILogger]: Resetting CodeCheck preferences to default values [2019-05-23 09:21:57,433 INFO L146 ILogger]: Resetting InvariantSynthesis preferences to default values [2019-05-23 09:21:57,435 INFO L146 ILogger]: Resetting RCFGBuilder preferences to default values [2019-05-23 09:21:57,436 INFO L146 ILogger]: Resetting TraceAbstraction preferences to default values [2019-05-23 09:21:57,439 INFO L146 ILogger]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-23 09:21:57,440 INFO L146 ILogger]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-23 09:21:57,440 INFO L146 ILogger]: Resetting TreeAutomizer preferences to default values [2019-05-23 09:21:57,441 INFO L146 ILogger]: Resetting IcfgToChc preferences to default values [2019-05-23 09:21:57,441 INFO L146 ILogger]: Resetting IcfgTransformer preferences to default values [2019-05-23 09:21:57,444 INFO L146 ILogger]: ReqToTest provides no preferences, ignoring... [2019-05-23 09:21:57,444 INFO L146 ILogger]: Resetting Boogie Printer preferences to default values [2019-05-23 09:21:57,446 INFO L146 ILogger]: Resetting ChcSmtPrinter preferences to default values [2019-05-23 09:21:57,447 INFO L146 ILogger]: Resetting ReqPrinter preferences to default values [2019-05-23 09:21:57,450 INFO L146 ILogger]: Resetting Witness Printer preferences to default values [2019-05-23 09:21:57,452 INFO L146 ILogger]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-23 09:21:57,452 INFO L146 ILogger]: Resetting CDTParser preferences to default values [2019-05-23 09:21:57,453 INFO L146 ILogger]: AutomataScriptParser provides no preferences, ignoring... [2019-05-23 09:21:57,454 INFO L146 ILogger]: ReqParser provides no preferences, ignoring... [2019-05-23 09:21:57,454 INFO L146 ILogger]: Resetting SmtParser preferences to default values [2019-05-23 09:21:57,456 INFO L146 ILogger]: Resetting Witness Parser preferences to default values [2019-05-23 09:21:57,457 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,501 INFO L146 ILogger]: Repository-Root is: /tmp [2019-05-23 09:21:57,513 INFO L146 ILogger]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-23 09:21:57,516 INFO L146 ILogger]: [Toolchain 1]: Toolchain selected. [2019-05-23 09:21:57,517 INFO L146 ILogger]: Initializing Boogie PL CUP Parser... [2019-05-23 09:21:57,518 INFO L146 ILogger]: Boogie PL CUP Parser initialized [2019-05-23 09:21:57,518 INFO L146 ILogger]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl [2019-05-23 09:21:57,519 INFO L146 ILogger]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl' [2019-05-23 09:21:57,561 INFO L146 ILogger]: ####################### [Toolchain 1] ####################### [2019-05-23 09:21:57,563 INFO L146 ILogger]: Walking toolchain with 4 elements. [2019-05-23 09:21:57,564 INFO L146 ILogger]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-23 09:21:57,564 INFO L146 ILogger]: Initializing Boogie Procedure Inliner... [2019-05-23 09:21:57,564 INFO L146 ILogger]: Boogie Procedure Inliner initialized [2019-05-23 09:21:57,580 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,592 INFO L146 ILogger]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,600 INFO L146 ILogger]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-23 09:21:57,601 INFO L146 ILogger]: ------------------------Boogie Preprocessor---------------------------- [2019-05-23 09:21:57,601 INFO L146 ILogger]: Initializing Boogie Preprocessor... [2019-05-23 09:21:57,601 INFO L146 ILogger]: Boogie Preprocessor initialized [2019-05-23 09:21:57,613 INFO L146 ILogger]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,613 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "vogal.i_5.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 ConstExpander from plugin Boogie Preprocessor for "vogal.i_5.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 StructExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,620 INFO L146 ILogger]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,622 INFO L146 ILogger]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,623 INFO L146 ILogger]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,625 INFO L146 ILogger]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-23 09:21:57,626 INFO L146 ILogger]: ------------------------RCFGBuilder---------------------------- [2019-05-23 09:21:57,626 INFO L146 ILogger]: Initializing RCFGBuilder... [2019-05-23 09:21:57,626 INFO L146 ILogger]: RCFGBuilder initialized [2019-05-23 09:21:57,627 INFO L146 ILogger]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "vogal.i_5.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,699 INFO L146 ILogger]: Found specification of procedure ULTIMATE.start [2019-05-23 09:21:57,699 INFO L146 ILogger]: Found implementation of procedure ULTIMATE.start [2019-05-23 09:21:58,248 INFO L146 ILogger]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-05-23 09:21:58,250 INFO L146 ILogger]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-23 09:21:58,250 INFO L146 ILogger]: Removed 5 assume(true) statements. [2019-05-23 09:21:58,251 INFO L146 ILogger]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:21:58 BoogieIcfgContainer [2019-05-23 09:21:58,251 INFO L146 ILogger]: ------------------------ END RCFGBuilder---------------------------- [2019-05-23 09:21:58,253 INFO L146 ILogger]: ------------------------TraceAbstraction---------------------------- [2019-05-23 09:21:58,253 INFO L146 ILogger]: Initializing TraceAbstraction... [2019-05-23 09:21:58,256 INFO L146 ILogger]: TraceAbstraction initialized [2019-05-23 09:21:58,256 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/2) ... [2019-05-23 09:21:58,258 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb6c87b and model type vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.05 09:21:58, skipping insertion in model container [2019-05-23 09:21:58,258 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:21:58" (2/2) ... [2019-05-23 09:21:58,260 INFO L146 ILogger]: Analyzing ICFG vogal.i_5.bpl [2019-05-23 09:21:58,269 INFO L146 ILogger]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-23 09:21:58,277 INFO L146 ILogger]: Appying trace abstraction to program that has 1 error locations. [2019-05-23 09:21:58,294 INFO L146 ILogger]: Starting to check reachability of 1 error locations. [2019-05-23 09:21:58,320 INFO L146 ILogger]: Using default assertion order modulation [2019-05-23 09:21:58,321 INFO L146 ILogger]: Interprodecural is true [2019-05-23 09:21:58,321 INFO L146 ILogger]: Hoare is false [2019-05-23 09:21:58,321 INFO L146 ILogger]: Compute interpolants for ForwardPredicates [2019-05-23 09:21:58,322 INFO L146 ILogger]: Backedges is STRAIGHT_LINE [2019-05-23 09:21:58,322 INFO L146 ILogger]: Determinization is PREDICATE_ABSTRACTION [2019-05-23 09:21:58,322 INFO L146 ILogger]: Difference is false [2019-05-23 09:21:58,322 INFO L146 ILogger]: Minimize is MINIMIZE_SEVPA [2019-05-23 09:21:58,322 INFO L146 ILogger]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-23 09:21:58,337 INFO L146 ILogger]: Start isEmpty. Operand 58 states. [2019-05-23 09:21:58,347 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 37 [2019-05-23 09:21:58,347 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:58,348 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:58,351 INFO L146 ILogger]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:58,356 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:58,357 INFO L146 ILogger]: Analyzing trace with hash -1531038900, now seen corresponding path program 1 times [2019-05-23 09:21:58,411 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:58,476 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:58,481 INFO L146 ILogger]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,488 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,536 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,539 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:21:58,540 INFO L146 ILogger]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-23 09:21:58,544 INFO L146 ILogger]: Interpolant automaton has 3 states [2019-05-23 09:21:58,558 INFO L146 ILogger]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-23 09:21:58,559 INFO L146 ILogger]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 09:21:58,561 INFO L146 ILogger]: Start difference. First operand 58 states. Second operand 3 states. [2019-05-23 09:21:58,705 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:58,706 INFO L146 ILogger]: Finished difference Result 83 states and 87 transitions. [2019-05-23 09:21:58,706 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-23 09:21:58,708 INFO L146 ILogger]: Start accepts. Automaton has 3 states. Word has length 36 [2019-05-23 09:21:58,708 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:58,718 INFO L146 ILogger]: With dead ends: 83 [2019-05-23 09:21:58,718 INFO L146 ILogger]: Without dead ends: 83 [2019-05-23 09:21:58,721 INFO L146 ILogger]: 0 DeclaredPredicates, 35 GetRequests, 34 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,737 INFO L146 ILogger]: Start minimizeSevpa. Operand 83 states. [2019-05-23 09:21:58,754 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 83 to 59. [2019-05-23 09:21:58,756 INFO L146 ILogger]: Start removeUnreachable. Operand 59 states. [2019-05-23 09:21:58,758 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-05-23 09:21:58,759 INFO L146 ILogger]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 36 [2019-05-23 09:21:58,759 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:58,760 INFO L146 ILogger]: Abstraction has 59 states and 62 transitions. [2019-05-23 09:21:58,760 INFO L146 ILogger]: Interpolant automaton has 3 states. [2019-05-23 09:21:58,760 INFO L146 ILogger]: Start isEmpty. Operand 59 states and 62 transitions. [2019-05-23 09:21:58,762 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 44 [2019-05-23 09:21:58,762 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:58,762 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, 1, 1, 1, 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,763 INFO L146 ILogger]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:58,763 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:58,763 INFO L146 ILogger]: Analyzing trace with hash 293488085, now seen corresponding path program 1 times [2019-05-23 09:21:58,764 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:58,802 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:58,809 INFO L146 ILogger]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,812 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,898 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,898 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:58,898 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-23 09:21:58,901 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 09:21:58,902 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 09:21:58,902 INFO L146 ILogger]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:21:58,902 INFO L146 ILogger]: Start difference. First operand 59 states and 62 transitions. Second operand 5 states. [2019-05-23 09:21:59,374 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:59,375 INFO L146 ILogger]: Finished difference Result 90 states and 94 transitions. [2019-05-23 09:21:59,377 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 09:21:59,377 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 43 [2019-05-23 09:21:59,378 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:59,379 INFO L146 ILogger]: With dead ends: 90 [2019-05-23 09:21:59,379 INFO L146 ILogger]: Without dead ends: 90 [2019-05-23 09:21:59,381 INFO L146 ILogger]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:21:59,382 INFO L146 ILogger]: Start minimizeSevpa. Operand 90 states. [2019-05-23 09:21:59,388 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-05-23 09:21:59,388 INFO L146 ILogger]: Start removeUnreachable. Operand 66 states. [2019-05-23 09:21:59,390 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-05-23 09:21:59,390 INFO L146 ILogger]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 43 [2019-05-23 09:21:59,390 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:59,390 INFO L146 ILogger]: Abstraction has 66 states and 69 transitions. [2019-05-23 09:21:59,391 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 09:21:59,391 INFO L146 ILogger]: Start isEmpty. Operand 66 states and 69 transitions. [2019-05-23 09:21:59,392 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 51 [2019-05-23 09:21:59,392 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:59,393 INFO L146 ILogger]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,393 INFO L146 ILogger]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:59,393 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:59,394 INFO L146 ILogger]: Analyzing trace with hash 963049260, now seen corresponding path program 2 times [2019-05-23 09:21:59,395 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:59,444 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:59,447 INFO L146 ILogger]: Trace formula consists of 69 conjuncts, 11 conjunts are in the unsatisfiable core [2019-05-23 09:21:59,450 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:59,545 INFO L146 ILogger]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:21:59,545 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:59,546 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 09:21:59,546 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 09:21:59,547 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 09:21:59,547 INFO L146 ILogger]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:21:59,547 INFO L146 ILogger]: Start difference. First operand 66 states and 69 transitions. Second operand 7 states. [2019-05-23 09:21:59,961 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:59,961 INFO L146 ILogger]: Finished difference Result 97 states and 101 transitions. [2019-05-23 09:21:59,971 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 09:21:59,971 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 50 [2019-05-23 09:21:59,972 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:59,973 INFO L146 ILogger]: With dead ends: 97 [2019-05-23 09:21:59,974 INFO L146 ILogger]: Without dead ends: 97 [2019-05-23 09:21:59,975 INFO L146 ILogger]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:21:59,976 INFO L146 ILogger]: Start minimizeSevpa. Operand 97 states. [2019-05-23 09:21:59,984 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 97 to 73. [2019-05-23 09:21:59,985 INFO L146 ILogger]: Start removeUnreachable. Operand 73 states. [2019-05-23 09:21:59,989 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-05-23 09:21:59,990 INFO L146 ILogger]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 50 [2019-05-23 09:21:59,991 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:59,991 INFO L146 ILogger]: Abstraction has 73 states and 76 transitions. [2019-05-23 09:21:59,991 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 09:21:59,991 INFO L146 ILogger]: Start isEmpty. Operand 73 states and 76 transitions. [2019-05-23 09:21:59,992 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 58 [2019-05-23 09:21:59,992 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:59,992 INFO L146 ILogger]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,993 INFO L146 ILogger]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:59,993 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:59,993 INFO L146 ILogger]: Analyzing trace with hash -636787211, now seen corresponding path program 3 times [2019-05-23 09:21:59,994 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:00,027 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:00,030 INFO L146 ILogger]: Trace formula consists of 79 conjuncts, 15 conjunts are in the unsatisfiable core [2019-05-23 09:22:00,035 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:00,411 INFO L146 ILogger]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:00,411 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:00,411 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 09:22:00,412 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 09:22:00,412 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 09:22:00,412 INFO L146 ILogger]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:22:00,413 INFO L146 ILogger]: Start difference. First operand 73 states and 76 transitions. Second operand 9 states. [2019-05-23 09:22:00,960 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:00,963 INFO L146 ILogger]: Finished difference Result 104 states and 108 transitions. [2019-05-23 09:22:00,963 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 09:22:00,964 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 57 [2019-05-23 09:22:00,964 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:00,965 INFO L146 ILogger]: With dead ends: 104 [2019-05-23 09:22:00,965 INFO L146 ILogger]: Without dead ends: 104 [2019-05-23 09:22:00,966 INFO L146 ILogger]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:00,966 INFO L146 ILogger]: Start minimizeSevpa. Operand 104 states. [2019-05-23 09:22:00,978 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 104 to 80. [2019-05-23 09:22:00,978 INFO L146 ILogger]: Start removeUnreachable. Operand 80 states. [2019-05-23 09:22:00,979 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-05-23 09:22:00,980 INFO L146 ILogger]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 57 [2019-05-23 09:22:00,980 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:00,980 INFO L146 ILogger]: Abstraction has 80 states and 83 transitions. [2019-05-23 09:22:00,980 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 09:22:00,981 INFO L146 ILogger]: Start isEmpty. Operand 80 states and 83 transitions. [2019-05-23 09:22:00,982 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 65 [2019-05-23 09:22:00,982 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:00,982 INFO L146 ILogger]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:00,982 INFO L146 ILogger]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:00,983 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:00,983 INFO L146 ILogger]: Analyzing trace with hash 1241215756, now seen corresponding path program 4 times [2019-05-23 09:22:00,984 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:01,013 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:01,017 INFO L146 ILogger]: Trace formula consists of 89 conjuncts, 19 conjunts are in the unsatisfiable core [2019-05-23 09:22:01,020 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:01,300 INFO L146 ILogger]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:01,300 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:01,300 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 09:22:01,301 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 09:22:01,301 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 09:22:01,302 INFO L146 ILogger]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:01,302 INFO L146 ILogger]: Start difference. First operand 80 states and 83 transitions. Second operand 11 states. [2019-05-23 09:22:01,786 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:01,787 INFO L146 ILogger]: Finished difference Result 111 states and 115 transitions. [2019-05-23 09:22:01,789 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-23 09:22:01,789 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 64 [2019-05-23 09:22:01,790 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:01,791 INFO L146 ILogger]: With dead ends: 111 [2019-05-23 09:22:01,791 INFO L146 ILogger]: Without dead ends: 111 [2019-05-23 09:22:01,792 INFO L146 ILogger]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:01,792 INFO L146 ILogger]: Start minimizeSevpa. Operand 111 states. [2019-05-23 09:22:01,796 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 111 to 87. [2019-05-23 09:22:01,797 INFO L146 ILogger]: Start removeUnreachable. Operand 87 states. [2019-05-23 09:22:01,798 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2019-05-23 09:22:01,798 INFO L146 ILogger]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 64 [2019-05-23 09:22:01,798 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:01,798 INFO L146 ILogger]: Abstraction has 87 states and 90 transitions. [2019-05-23 09:22:01,799 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 09:22:01,799 INFO L146 ILogger]: Start isEmpty. Operand 87 states and 90 transitions. [2019-05-23 09:22:01,800 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 72 [2019-05-23 09:22:01,800 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:01,800 INFO L146 ILogger]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:01,801 INFO L146 ILogger]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:01,801 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:01,801 INFO L146 ILogger]: Analyzing trace with hash -796013035, now seen corresponding path program 5 times [2019-05-23 09:22:01,802 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:01,830 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:01,833 INFO L146 ILogger]: Trace formula consists of 99 conjuncts, 23 conjunts are in the unsatisfiable core [2019-05-23 09:22:01,837 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:01,995 INFO L146 ILogger]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:01,995 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:01,995 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-23 09:22:01,996 INFO L146 ILogger]: Interpolant automaton has 13 states [2019-05-23 09:22:01,996 INFO L146 ILogger]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-23 09:22:01,997 INFO L146 ILogger]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:22:01,997 INFO L146 ILogger]: Start difference. First operand 87 states and 90 transitions. Second operand 13 states. [2019-05-23 09:22:02,492 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:02,492 INFO L146 ILogger]: Finished difference Result 118 states and 122 transitions. [2019-05-23 09:22:02,493 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-23 09:22:02,493 INFO L146 ILogger]: Start accepts. Automaton has 13 states. Word has length 71 [2019-05-23 09:22:02,494 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:02,495 INFO L146 ILogger]: With dead ends: 118 [2019-05-23 09:22:02,495 INFO L146 ILogger]: Without dead ends: 118 [2019-05-23 09:22:02,496 INFO L146 ILogger]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:02,497 INFO L146 ILogger]: Start minimizeSevpa. Operand 118 states. [2019-05-23 09:22:02,501 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 118 to 94. [2019-05-23 09:22:02,502 INFO L146 ILogger]: Start removeUnreachable. Operand 94 states. [2019-05-23 09:22:02,503 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2019-05-23 09:22:02,503 INFO L146 ILogger]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 71 [2019-05-23 09:22:02,504 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:02,504 INFO L146 ILogger]: Abstraction has 94 states and 97 transitions. [2019-05-23 09:22:02,504 INFO L146 ILogger]: Interpolant automaton has 13 states. [2019-05-23 09:22:02,504 INFO L146 ILogger]: Start isEmpty. Operand 94 states and 97 transitions. [2019-05-23 09:22:02,505 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 79 [2019-05-23 09:22:02,506 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:02,506 INFO L146 ILogger]: trace histogram [6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:02,506 INFO L146 ILogger]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:02,506 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:02,507 INFO L146 ILogger]: Analyzing trace with hash -744904980, now seen corresponding path program 6 times [2019-05-23 09:22:02,508 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:02,555 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:02,566 INFO L146 ILogger]: Trace formula consists of 109 conjuncts, 27 conjunts are in the unsatisfiable core [2019-05-23 09:22:02,573 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:02,838 INFO L146 ILogger]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:02,839 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:02,839 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-23 09:22:02,840 INFO L146 ILogger]: Interpolant automaton has 15 states [2019-05-23 09:22:02,840 INFO L146 ILogger]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-23 09:22:02,840 INFO L146 ILogger]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:02,841 INFO L146 ILogger]: Start difference. First operand 94 states and 97 transitions. Second operand 15 states. [2019-05-23 09:22:03,807 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:03,807 INFO L146 ILogger]: Finished difference Result 125 states and 129 transitions. [2019-05-23 09:22:03,808 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-23 09:22:03,808 INFO L146 ILogger]: Start accepts. Automaton has 15 states. Word has length 78 [2019-05-23 09:22:03,809 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:03,810 INFO L146 ILogger]: With dead ends: 125 [2019-05-23 09:22:03,810 INFO L146 ILogger]: Without dead ends: 125 [2019-05-23 09:22:03,811 INFO L146 ILogger]: 0 DeclaredPredicates, 89 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:03,811 INFO L146 ILogger]: Start minimizeSevpa. Operand 125 states. [2019-05-23 09:22:03,815 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 125 to 101. [2019-05-23 09:22:03,815 INFO L146 ILogger]: Start removeUnreachable. Operand 101 states. [2019-05-23 09:22:03,816 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2019-05-23 09:22:03,817 INFO L146 ILogger]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 78 [2019-05-23 09:22:03,817 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:03,817 INFO L146 ILogger]: Abstraction has 101 states and 104 transitions. [2019-05-23 09:22:03,817 INFO L146 ILogger]: Interpolant automaton has 15 states. [2019-05-23 09:22:03,817 INFO L146 ILogger]: Start isEmpty. Operand 101 states and 104 transitions. [2019-05-23 09:22:03,819 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 86 [2019-05-23 09:22:03,819 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:03,819 INFO L146 ILogger]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:03,819 INFO L146 ILogger]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:03,820 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:03,820 INFO L146 ILogger]: Analyzing trace with hash -1708687819, now seen corresponding path program 7 times [2019-05-23 09:22:03,821 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:03,847 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:03,850 INFO L146 ILogger]: Trace formula consists of 119 conjuncts, 31 conjunts are in the unsatisfiable core [2019-05-23 09:22:03,854 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:04,195 INFO L146 ILogger]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:04,196 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:04,196 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-23 09:22:04,196 INFO L146 ILogger]: Interpolant automaton has 17 states [2019-05-23 09:22:04,197 INFO L146 ILogger]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-23 09:22:04,197 INFO L146 ILogger]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:22:04,197 INFO L146 ILogger]: Start difference. First operand 101 states and 104 transitions. Second operand 17 states. [2019-05-23 09:22:05,617 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:05,618 INFO L146 ILogger]: Finished difference Result 132 states and 136 transitions. [2019-05-23 09:22:05,618 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-23 09:22:05,618 INFO L146 ILogger]: Start accepts. Automaton has 17 states. Word has length 85 [2019-05-23 09:22:05,619 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:05,619 INFO L146 ILogger]: With dead ends: 132 [2019-05-23 09:22:05,620 INFO L146 ILogger]: Without dead ends: 132 [2019-05-23 09:22:05,620 INFO L146 ILogger]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:05,621 INFO L146 ILogger]: Start minimizeSevpa. Operand 132 states. [2019-05-23 09:22:05,625 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 132 to 108. [2019-05-23 09:22:05,625 INFO L146 ILogger]: Start removeUnreachable. Operand 108 states. [2019-05-23 09:22:05,626 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2019-05-23 09:22:05,626 INFO L146 ILogger]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 85 [2019-05-23 09:22:05,626 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:05,627 INFO L146 ILogger]: Abstraction has 108 states and 111 transitions. [2019-05-23 09:22:05,627 INFO L146 ILogger]: Interpolant automaton has 17 states. [2019-05-23 09:22:05,627 INFO L146 ILogger]: Start isEmpty. Operand 108 states and 111 transitions. [2019-05-23 09:22:05,628 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 93 [2019-05-23 09:22:05,628 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:05,629 INFO L146 ILogger]: trace histogram [8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:05,629 INFO L146 ILogger]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:05,629 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:05,629 INFO L146 ILogger]: Analyzing trace with hash -2032168244, now seen corresponding path program 8 times [2019-05-23 09:22:05,630 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:05,656 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:05,659 INFO L146 ILogger]: Trace formula consists of 129 conjuncts, 35 conjunts are in the unsatisfiable core [2019-05-23 09:22:05,663 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:06,135 INFO L146 ILogger]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:06,135 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:06,135 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-23 09:22:06,136 INFO L146 ILogger]: Interpolant automaton has 19 states [2019-05-23 09:22:06,136 INFO L146 ILogger]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-23 09:22:06,136 INFO L146 ILogger]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:06,136 INFO L146 ILogger]: Start difference. First operand 108 states and 111 transitions. Second operand 19 states. [2019-05-23 09:22:07,268 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:07,269 INFO L146 ILogger]: Finished difference Result 139 states and 143 transitions. [2019-05-23 09:22:07,269 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-05-23 09:22:07,269 INFO L146 ILogger]: Start accepts. Automaton has 19 states. Word has length 92 [2019-05-23 09:22:07,270 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:07,271 INFO L146 ILogger]: With dead ends: 139 [2019-05-23 09:22:07,271 INFO L146 ILogger]: Without dead ends: 139 [2019-05-23 09:22:07,273 INFO L146 ILogger]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:07,273 INFO L146 ILogger]: Start minimizeSevpa. Operand 139 states. [2019-05-23 09:22:07,276 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 139 to 115. [2019-05-23 09:22:07,276 INFO L146 ILogger]: Start removeUnreachable. Operand 115 states. [2019-05-23 09:22:07,277 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2019-05-23 09:22:07,277 INFO L146 ILogger]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 92 [2019-05-23 09:22:07,278 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:07,278 INFO L146 ILogger]: Abstraction has 115 states and 118 transitions. [2019-05-23 09:22:07,278 INFO L146 ILogger]: Interpolant automaton has 19 states. [2019-05-23 09:22:07,278 INFO L146 ILogger]: Start isEmpty. Operand 115 states and 118 transitions. [2019-05-23 09:22:07,279 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 100 [2019-05-23 09:22:07,279 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:07,280 INFO L146 ILogger]: trace histogram [9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:07,280 INFO L146 ILogger]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:07,280 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:07,280 INFO L146 ILogger]: Analyzing trace with hash 947549781, now seen corresponding path program 9 times [2019-05-23 09:22:07,281 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:07,307 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:07,310 INFO L146 ILogger]: Trace formula consists of 139 conjuncts, 39 conjunts are in the unsatisfiable core [2019-05-23 09:22:07,314 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:07,591 INFO L146 ILogger]: Checked inductivity of 261 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:07,592 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:07,592 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-23 09:22:07,592 INFO L146 ILogger]: Interpolant automaton has 21 states [2019-05-23 09:22:07,593 INFO L146 ILogger]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-23 09:22:07,593 INFO L146 ILogger]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:22:07,593 INFO L146 ILogger]: Start difference. First operand 115 states and 118 transitions. Second operand 21 states. [2019-05-23 09:22:08,523 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:08,523 INFO L146 ILogger]: Finished difference Result 146 states and 150 transitions. [2019-05-23 09:22:08,524 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-23 09:22:08,524 INFO L146 ILogger]: Start accepts. Automaton has 21 states. Word has length 99 [2019-05-23 09:22:08,524 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:08,525 INFO L146 ILogger]: With dead ends: 146 [2019-05-23 09:22:08,526 INFO L146 ILogger]: Without dead ends: 146 [2019-05-23 09:22:08,527 INFO L146 ILogger]: 0 DeclaredPredicates, 116 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:08,528 INFO L146 ILogger]: Start minimizeSevpa. Operand 146 states. [2019-05-23 09:22:08,531 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 146 to 122. [2019-05-23 09:22:08,531 INFO L146 ILogger]: Start removeUnreachable. Operand 122 states. [2019-05-23 09:22:08,531 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2019-05-23 09:22:08,532 INFO L146 ILogger]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 99 [2019-05-23 09:22:08,532 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:08,532 INFO L146 ILogger]: Abstraction has 122 states and 125 transitions. [2019-05-23 09:22:08,532 INFO L146 ILogger]: Interpolant automaton has 21 states. [2019-05-23 09:22:08,532 INFO L146 ILogger]: Start isEmpty. Operand 122 states and 125 transitions. [2019-05-23 09:22:08,534 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 107 [2019-05-23 09:22:08,534 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:08,534 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:08,535 INFO L146 ILogger]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:08,535 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:08,535 INFO L146 ILogger]: Analyzing trace with hash -1477757268, now seen corresponding path program 10 times [2019-05-23 09:22:08,536 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:08,579 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:08,590 INFO L146 ILogger]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-23 09:22:08,597 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:08,756 INFO L146 ILogger]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-05-23 09:22:08,757 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:22:08,757 INFO L146 ILogger]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-05-23 09:22:08,758 INFO L146 ILogger]: Interpolant automaton has 6 states [2019-05-23 09:22:08,758 INFO L146 ILogger]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-23 09:22:08,758 INFO L146 ILogger]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-05-23 09:22:08,758 INFO L146 ILogger]: Start difference. First operand 122 states and 125 transitions. Second operand 6 states. [2019-05-23 09:22:08,863 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:08,863 INFO L146 ILogger]: Finished difference Result 135 states and 139 transitions. [2019-05-23 09:22:08,864 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 09:22:08,865 INFO L146 ILogger]: Start accepts. Automaton has 6 states. Word has length 106 [2019-05-23 09:22:08,865 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:08,866 INFO L146 ILogger]: With dead ends: 135 [2019-05-23 09:22:08,866 INFO L146 ILogger]: Without dead ends: 131 [2019-05-23 09:22:08,866 INFO L146 ILogger]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-05-23 09:22:08,867 INFO L146 ILogger]: Start minimizeSevpa. Operand 131 states. [2019-05-23 09:22:08,870 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-05-23 09:22:08,870 INFO L146 ILogger]: Start removeUnreachable. Operand 128 states. [2019-05-23 09:22:08,871 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2019-05-23 09:22:08,871 INFO L146 ILogger]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 106 [2019-05-23 09:22:08,871 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:08,872 INFO L146 ILogger]: Abstraction has 128 states and 132 transitions. [2019-05-23 09:22:08,872 INFO L146 ILogger]: Interpolant automaton has 6 states. [2019-05-23 09:22:08,872 INFO L146 ILogger]: Start isEmpty. Operand 128 states and 132 transitions. [2019-05-23 09:22:08,873 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 121 [2019-05-23 09:22:08,874 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:08,874 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:08,874 INFO L146 ILogger]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:08,874 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:08,875 INFO L146 ILogger]: Analyzing trace with hash -176085147, now seen corresponding path program 1 times [2019-05-23 09:22:08,875 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:08,911 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:08,914 INFO L146 ILogger]: Trace formula consists of 171 conjuncts, 7 conjunts are in the unsatisfiable core [2019-05-23 09:22:08,917 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,160 INFO L146 ILogger]: Checked inductivity of 327 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-05-23 09:22:09,160 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:09,176 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-23 09:22:09,177 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 09:22:09,177 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 09:22:09,177 INFO L146 ILogger]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:22:09,177 INFO L146 ILogger]: Start difference. First operand 128 states and 132 transitions. Second operand 5 states. [2019-05-23 09:22:09,779 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,779 INFO L146 ILogger]: Finished difference Result 140 states and 143 transitions. [2019-05-23 09:22:09,780 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 09:22:09,780 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 120 [2019-05-23 09:22:09,780 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,781 INFO L146 ILogger]: With dead ends: 140 [2019-05-23 09:22:09,782 INFO L146 ILogger]: Without dead ends: 140 [2019-05-23 09:22:09,782 INFO L146 ILogger]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:22:09,783 INFO L146 ILogger]: Start minimizeSevpa. Operand 140 states. [2019-05-23 09:22:09,785 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 140 to 132. [2019-05-23 09:22:09,785 INFO L146 ILogger]: Start removeUnreachable. Operand 132 states. [2019-05-23 09:22:09,786 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2019-05-23 09:22:09,786 INFO L146 ILogger]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 120 [2019-05-23 09:22:09,786 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,786 INFO L146 ILogger]: Abstraction has 132 states and 135 transitions. [2019-05-23 09:22:09,786 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 09:22:09,787 INFO L146 ILogger]: Start isEmpty. Operand 132 states and 135 transitions. [2019-05-23 09:22:09,788 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 129 [2019-05-23 09:22:09,788 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,788 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:09,789 INFO L146 ILogger]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,789 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,789 INFO L146 ILogger]: Analyzing trace with hash -1071991455, now seen corresponding path program 2 times [2019-05-23 09:22:09,790 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,816 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,819 INFO L146 ILogger]: Trace formula consists of 184 conjuncts, 11 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,821 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,972 INFO L146 ILogger]: Checked inductivity of 336 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-05-23 09:22:09,972 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:09,972 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 09:22:09,973 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 09:22:09,973 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 09:22:09,973 INFO L146 ILogger]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:22:09,973 INFO L146 ILogger]: Start difference. First operand 132 states and 135 transitions. Second operand 7 states. [2019-05-23 09:22:10,067 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:10,067 INFO L146 ILogger]: Finished difference Result 146 states and 149 transitions. [2019-05-23 09:22:10,068 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 09:22:10,068 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 128 [2019-05-23 09:22:10,069 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:10,070 INFO L146 ILogger]: With dead ends: 146 [2019-05-23 09:22:10,070 INFO L146 ILogger]: Without dead ends: 146 [2019-05-23 09:22:10,071 INFO L146 ILogger]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:10,071 INFO L146 ILogger]: Start minimizeSevpa. Operand 146 states. [2019-05-23 09:22:10,073 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 146 to 140. [2019-05-23 09:22:10,074 INFO L146 ILogger]: Start removeUnreachable. Operand 140 states. [2019-05-23 09:22:10,074 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2019-05-23 09:22:10,074 INFO L146 ILogger]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 128 [2019-05-23 09:22:10,075 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:10,075 INFO L146 ILogger]: Abstraction has 140 states and 143 transitions. [2019-05-23 09:22:10,075 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 09:22:10,075 INFO L146 ILogger]: Start isEmpty. Operand 140 states and 143 transitions. [2019-05-23 09:22:10,076 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 137 [2019-05-23 09:22:10,076 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:10,076 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:10,077 INFO L146 ILogger]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:10,077 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:10,077 INFO L146 ILogger]: Analyzing trace with hash -2043377827, now seen corresponding path program 3 times [2019-05-23 09:22:10,078 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:10,105 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:10,108 INFO L146 ILogger]: Trace formula consists of 197 conjuncts, 15 conjunts are in the unsatisfiable core [2019-05-23 09:22:10,110 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:10,227 INFO L146 ILogger]: Checked inductivity of 353 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-05-23 09:22:10,228 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:10,228 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 09:22:10,228 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 09:22:10,229 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 09:22:10,229 INFO L146 ILogger]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:22:10,229 INFO L146 ILogger]: Start difference. First operand 140 states and 143 transitions. Second operand 9 states. [2019-05-23 09:22:10,866 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:10,866 INFO L146 ILogger]: Finished difference Result 154 states and 157 transitions. [2019-05-23 09:22:10,867 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 09:22:10,867 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 136 [2019-05-23 09:22:10,867 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:10,868 INFO L146 ILogger]: With dead ends: 154 [2019-05-23 09:22:10,868 INFO L146 ILogger]: Without dead ends: 154 [2019-05-23 09:22:10,869 INFO L146 ILogger]: 0 DeclaredPredicates, 141 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:10,870 INFO L146 ILogger]: Start minimizeSevpa. Operand 154 states. [2019-05-23 09:22:10,872 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 154 to 148. [2019-05-23 09:22:10,872 INFO L146 ILogger]: Start removeUnreachable. Operand 148 states. [2019-05-23 09:22:10,873 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2019-05-23 09:22:10,873 INFO L146 ILogger]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 136 [2019-05-23 09:22:10,873 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:10,873 INFO L146 ILogger]: Abstraction has 148 states and 151 transitions. [2019-05-23 09:22:10,874 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 09:22:10,874 INFO L146 ILogger]: Start isEmpty. Operand 148 states and 151 transitions. [2019-05-23 09:22:10,875 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 145 [2019-05-23 09:22:10,875 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:10,875 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:10,875 INFO L146 ILogger]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:10,876 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:10,876 INFO L146 ILogger]: Analyzing trace with hash -179659431, now seen corresponding path program 4 times [2019-05-23 09:22:10,877 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:10,902 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:10,905 INFO L146 ILogger]: Trace formula consists of 210 conjuncts, 19 conjunts are in the unsatisfiable core [2019-05-23 09:22:10,907 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:11,085 INFO L146 ILogger]: Checked inductivity of 378 backedges. 1 proven. 52 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-05-23 09:22:11,086 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:11,086 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 09:22:11,086 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 09:22:11,086 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 09:22:11,087 INFO L146 ILogger]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:11,087 INFO L146 ILogger]: Start difference. First operand 148 states and 151 transitions. Second operand 11 states. [2019-05-23 09:22:11,315 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:11,315 INFO L146 ILogger]: Finished difference Result 162 states and 165 transitions. [2019-05-23 09:22:11,315 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-23 09:22:11,316 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 144 [2019-05-23 09:22:11,316 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:11,317 INFO L146 ILogger]: With dead ends: 162 [2019-05-23 09:22:11,318 INFO L146 ILogger]: Without dead ends: 162 [2019-05-23 09:22:11,318 INFO L146 ILogger]: 0 DeclaredPredicates, 151 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:11,319 INFO L146 ILogger]: Start minimizeSevpa. Operand 162 states. [2019-05-23 09:22:11,322 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 162 to 156. [2019-05-23 09:22:11,322 INFO L146 ILogger]: Start removeUnreachable. Operand 156 states. [2019-05-23 09:22:11,322 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 156 states to 156 states and 159 transitions. [2019-05-23 09:22:11,323 INFO L146 ILogger]: Start accepts. Automaton has 156 states and 159 transitions. Word has length 144 [2019-05-23 09:22:11,323 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:11,323 INFO L146 ILogger]: Abstraction has 156 states and 159 transitions. [2019-05-23 09:22:11,323 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 09:22:11,323 INFO L146 ILogger]: Start isEmpty. Operand 156 states and 159 transitions. [2019-05-23 09:22:11,324 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 153 [2019-05-23 09:22:11,324 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:11,324 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:11,325 INFO L146 ILogger]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:11,325 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:11,325 INFO L146 ILogger]: Analyzing trace with hash 2128148309, now seen corresponding path program 5 times [2019-05-23 09:22:11,326 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:11,351 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:11,354 INFO L146 ILogger]: Trace formula consists of 223 conjuncts, 23 conjunts are in the unsatisfiable core [2019-05-23 09:22:11,356 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:11,536 INFO L146 ILogger]: Checked inductivity of 411 backedges. 1 proven. 85 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-05-23 09:22:11,537 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:11,537 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-23 09:22:11,537 INFO L146 ILogger]: Interpolant automaton has 13 states [2019-05-23 09:22:11,537 INFO L146 ILogger]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-23 09:22:11,538 INFO L146 ILogger]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:22:11,538 INFO L146 ILogger]: Start difference. First operand 156 states and 159 transitions. Second operand 13 states. [2019-05-23 09:22:12,022 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:12,023 INFO L146 ILogger]: Finished difference Result 170 states and 173 transitions. [2019-05-23 09:22:12,023 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-23 09:22:12,023 INFO L146 ILogger]: Start accepts. Automaton has 13 states. Word has length 152 [2019-05-23 09:22:12,024 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:12,025 INFO L146 ILogger]: With dead ends: 170 [2019-05-23 09:22:12,025 INFO L146 ILogger]: Without dead ends: 170 [2019-05-23 09:22:12,026 INFO L146 ILogger]: 0 DeclaredPredicates, 161 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:12,026 INFO L146 ILogger]: Start minimizeSevpa. Operand 170 states. [2019-05-23 09:22:12,028 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 170 to 164. [2019-05-23 09:22:12,029 INFO L146 ILogger]: Start removeUnreachable. Operand 164 states. [2019-05-23 09:22:12,029 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 164 states to 164 states and 167 transitions. [2019-05-23 09:22:12,029 INFO L146 ILogger]: Start accepts. Automaton has 164 states and 167 transitions. Word has length 152 [2019-05-23 09:22:12,030 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:12,030 INFO L146 ILogger]: Abstraction has 164 states and 167 transitions. [2019-05-23 09:22:12,030 INFO L146 ILogger]: Interpolant automaton has 13 states. [2019-05-23 09:22:12,030 INFO L146 ILogger]: Start isEmpty. Operand 164 states and 167 transitions. [2019-05-23 09:22:12,031 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 161 [2019-05-23 09:22:12,031 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:12,031 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:12,032 INFO L146 ILogger]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:12,032 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:12,032 INFO L146 ILogger]: Analyzing trace with hash 1482397009, now seen corresponding path program 6 times [2019-05-23 09:22:12,033 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:12,057 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:12,060 INFO L146 ILogger]: Trace formula consists of 236 conjuncts, 27 conjunts are in the unsatisfiable core [2019-05-23 09:22:12,062 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:12,617 INFO L146 ILogger]: Checked inductivity of 452 backedges. 1 proven. 126 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-05-23 09:22:12,617 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:12,617 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-23 09:22:12,617 INFO L146 ILogger]: Interpolant automaton has 15 states [2019-05-23 09:22:12,617 INFO L146 ILogger]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-23 09:22:12,618 INFO L146 ILogger]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:12,618 INFO L146 ILogger]: Start difference. First operand 164 states and 167 transitions. Second operand 15 states. [2019-05-23 09:22:13,176 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:13,176 INFO L146 ILogger]: Finished difference Result 178 states and 181 transitions. [2019-05-23 09:22:13,177 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-23 09:22:13,177 INFO L146 ILogger]: Start accepts. Automaton has 15 states. Word has length 160 [2019-05-23 09:22:13,178 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:13,179 INFO L146 ILogger]: With dead ends: 178 [2019-05-23 09:22:13,179 INFO L146 ILogger]: Without dead ends: 178 [2019-05-23 09:22:13,180 INFO L146 ILogger]: 0 DeclaredPredicates, 171 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:13,180 INFO L146 ILogger]: Start minimizeSevpa. Operand 178 states. [2019-05-23 09:22:13,183 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 178 to 172. [2019-05-23 09:22:13,183 INFO L146 ILogger]: Start removeUnreachable. Operand 172 states. [2019-05-23 09:22:13,184 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 172 states to 172 states and 175 transitions. [2019-05-23 09:22:13,184 INFO L146 ILogger]: Start accepts. Automaton has 172 states and 175 transitions. Word has length 160 [2019-05-23 09:22:13,184 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:13,184 INFO L146 ILogger]: Abstraction has 172 states and 175 transitions. [2019-05-23 09:22:13,184 INFO L146 ILogger]: Interpolant automaton has 15 states. [2019-05-23 09:22:13,185 INFO L146 ILogger]: Start isEmpty. Operand 172 states and 175 transitions. [2019-05-23 09:22:13,185 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 169 [2019-05-23 09:22:13,185 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:13,186 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:13,186 INFO L146 ILogger]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:13,186 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:13,186 INFO L146 ILogger]: Analyzing trace with hash 2068739917, now seen corresponding path program 7 times [2019-05-23 09:22:13,187 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:13,210 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:13,213 INFO L146 ILogger]: Trace formula consists of 249 conjuncts, 31 conjunts are in the unsatisfiable core [2019-05-23 09:22:13,215 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:13,465 INFO L146 ILogger]: Checked inductivity of 501 backedges. 1 proven. 175 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-05-23 09:22:13,465 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:13,465 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-23 09:22:13,466 INFO L146 ILogger]: Interpolant automaton has 17 states [2019-05-23 09:22:13,466 INFO L146 ILogger]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-23 09:22:13,466 INFO L146 ILogger]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:22:13,466 INFO L146 ILogger]: Start difference. First operand 172 states and 175 transitions. Second operand 17 states. [2019-05-23 09:22:14,133 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:14,134 INFO L146 ILogger]: Finished difference Result 186 states and 189 transitions. [2019-05-23 09:22:14,134 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-23 09:22:14,134 INFO L146 ILogger]: Start accepts. Automaton has 17 states. Word has length 168 [2019-05-23 09:22:14,135 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:14,136 INFO L146 ILogger]: With dead ends: 186 [2019-05-23 09:22:14,137 INFO L146 ILogger]: Without dead ends: 186 [2019-05-23 09:22:14,138 INFO L146 ILogger]: 0 DeclaredPredicates, 181 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:14,138 INFO L146 ILogger]: Start minimizeSevpa. Operand 186 states. [2019-05-23 09:22:14,141 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 186 to 180. [2019-05-23 09:22:14,141 INFO L146 ILogger]: Start removeUnreachable. Operand 180 states. [2019-05-23 09:22:14,142 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 180 states to 180 states and 183 transitions. [2019-05-23 09:22:14,142 INFO L146 ILogger]: Start accepts. Automaton has 180 states and 183 transitions. Word has length 168 [2019-05-23 09:22:14,143 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:14,143 INFO L146 ILogger]: Abstraction has 180 states and 183 transitions. [2019-05-23 09:22:14,143 INFO L146 ILogger]: Interpolant automaton has 17 states. [2019-05-23 09:22:14,143 INFO L146 ILogger]: Start isEmpty. Operand 180 states and 183 transitions. [2019-05-23 09:22:14,144 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 177 [2019-05-23 09:22:14,144 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:14,145 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:14,145 INFO L146 ILogger]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:14,145 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:14,145 INFO L146 ILogger]: Analyzing trace with hash -1523737271, now seen corresponding path program 8 times [2019-05-23 09:22:14,146 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:14,173 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:14,176 INFO L146 ILogger]: Trace formula consists of 262 conjuncts, 35 conjunts are in the unsatisfiable core [2019-05-23 09:22:14,194 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:14,397 INFO L146 ILogger]: Checked inductivity of 558 backedges. 1 proven. 232 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-05-23 09:22:14,397 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:14,398 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-23 09:22:14,398 INFO L146 ILogger]: Interpolant automaton has 19 states [2019-05-23 09:22:14,398 INFO L146 ILogger]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-23 09:22:14,398 INFO L146 ILogger]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:14,399 INFO L146 ILogger]: Start difference. First operand 180 states and 183 transitions. Second operand 19 states. [2019-05-23 09:22:15,042 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:15,042 INFO L146 ILogger]: Finished difference Result 194 states and 197 transitions. [2019-05-23 09:22:15,043 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-05-23 09:22:15,043 INFO L146 ILogger]: Start accepts. Automaton has 19 states. Word has length 176 [2019-05-23 09:22:15,043 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:15,044 INFO L146 ILogger]: With dead ends: 194 [2019-05-23 09:22:15,044 INFO L146 ILogger]: Without dead ends: 194 [2019-05-23 09:22:15,045 INFO L146 ILogger]: 0 DeclaredPredicates, 191 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:15,045 INFO L146 ILogger]: Start minimizeSevpa. Operand 194 states. [2019-05-23 09:22:15,047 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 194 to 188. [2019-05-23 09:22:15,047 INFO L146 ILogger]: Start removeUnreachable. Operand 188 states. [2019-05-23 09:22:15,048 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 188 states to 188 states and 191 transitions. [2019-05-23 09:22:15,048 INFO L146 ILogger]: Start accepts. Automaton has 188 states and 191 transitions. Word has length 176 [2019-05-23 09:22:15,049 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:15,049 INFO L146 ILogger]: Abstraction has 188 states and 191 transitions. [2019-05-23 09:22:15,049 INFO L146 ILogger]: Interpolant automaton has 19 states. [2019-05-23 09:22:15,049 INFO L146 ILogger]: Start isEmpty. Operand 188 states and 191 transitions. [2019-05-23 09:22:15,050 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 185 [2019-05-23 09:22:15,050 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:15,050 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:15,050 INFO L146 ILogger]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:15,051 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:15,051 INFO L146 ILogger]: Analyzing trace with hash 1467287365, now seen corresponding path program 9 times [2019-05-23 09:22:15,052 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:15,077 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:15,079 INFO L146 ILogger]: Trace formula consists of 275 conjuncts, 39 conjunts are in the unsatisfiable core [2019-05-23 09:22:15,082 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:15,338 INFO L146 ILogger]: Checked inductivity of 623 backedges. 1 proven. 297 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-05-23 09:22:15,338 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:15,338 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-23 09:22:15,339 INFO L146 ILogger]: Interpolant automaton has 21 states [2019-05-23 09:22:15,339 INFO L146 ILogger]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-23 09:22:15,339 INFO L146 ILogger]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:22:15,339 INFO L146 ILogger]: Start difference. First operand 188 states and 191 transitions. Second operand 21 states. [2019-05-23 09:22:16,349 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:16,350 INFO L146 ILogger]: Finished difference Result 202 states and 205 transitions. [2019-05-23 09:22:16,350 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-23 09:22:16,350 INFO L146 ILogger]: Start accepts. Automaton has 21 states. Word has length 184 [2019-05-23 09:22:16,351 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:16,352 INFO L146 ILogger]: With dead ends: 202 [2019-05-23 09:22:16,352 INFO L146 ILogger]: Without dead ends: 202 [2019-05-23 09:22:16,352 INFO L146 ILogger]: 0 DeclaredPredicates, 201 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:16,353 INFO L146 ILogger]: Start minimizeSevpa. Operand 202 states. [2019-05-23 09:22:16,355 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 202 to 196. [2019-05-23 09:22:16,356 INFO L146 ILogger]: Start removeUnreachable. Operand 196 states. [2019-05-23 09:22:16,356 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 196 states to 196 states and 199 transitions. [2019-05-23 09:22:16,357 INFO L146 ILogger]: Start accepts. Automaton has 196 states and 199 transitions. Word has length 184 [2019-05-23 09:22:16,357 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:16,357 INFO L146 ILogger]: Abstraction has 196 states and 199 transitions. [2019-05-23 09:22:16,357 INFO L146 ILogger]: Interpolant automaton has 21 states. [2019-05-23 09:22:16,357 INFO L146 ILogger]: Start isEmpty. Operand 196 states and 199 transitions. [2019-05-23 09:22:16,358 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 193 [2019-05-23 09:22:16,358 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:16,358 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:16,359 INFO L146 ILogger]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:16,359 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:16,359 INFO L146 ILogger]: Analyzing trace with hash -677333695, now seen corresponding path program 10 times [2019-05-23 09:22:16,360 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:16,404 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:16,407 INFO L146 ILogger]: Trace formula consists of 288 conjuncts, 7 conjunts are in the unsatisfiable core [2019-05-23 09:22:16,409 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:16,498 INFO L146 ILogger]: Checked inductivity of 696 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2019-05-23 09:22:16,498 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:22:16,498 INFO L146 ILogger]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-05-23 09:22:16,499 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 09:22:16,499 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 09:22:16,499 INFO L146 ILogger]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:22:16,499 INFO L146 ILogger]: Start difference. First operand 196 states and 199 transitions. Second operand 5 states. [2019-05-23 09:22:16,583 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:16,583 INFO L146 ILogger]: Finished difference Result 205 states and 208 transitions. [2019-05-23 09:22:16,584 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-23 09:22:16,584 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 192 [2019-05-23 09:22:16,584 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:16,585 INFO L146 ILogger]: With dead ends: 205 [2019-05-23 09:22:16,585 INFO L146 ILogger]: Without dead ends: 199 [2019-05-23 09:22:16,586 INFO L146 ILogger]: 0 DeclaredPredicates, 193 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:22:16,586 INFO L146 ILogger]: Start minimizeSevpa. Operand 199 states. [2019-05-23 09:22:16,589 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 199 to 197. [2019-05-23 09:22:16,589 INFO L146 ILogger]: Start removeUnreachable. Operand 197 states. [2019-05-23 09:22:16,590 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 197 states to 197 states and 200 transitions. [2019-05-23 09:22:16,590 INFO L146 ILogger]: Start accepts. Automaton has 197 states and 200 transitions. Word has length 192 [2019-05-23 09:22:16,590 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:16,590 INFO L146 ILogger]: Abstraction has 197 states and 200 transitions. [2019-05-23 09:22:16,591 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 09:22:16,591 INFO L146 ILogger]: Start isEmpty. Operand 197 states and 200 transitions. [2019-05-23 09:22:16,592 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 197 [2019-05-23 09:22:16,592 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:16,592 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:16,592 INFO L146 ILogger]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:16,592 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:16,593 INFO L146 ILogger]: Analyzing trace with hash -94524033, now seen corresponding path program 1 times [2019-05-23 09:22:16,593 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:16,632 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:16,636 INFO L146 ILogger]: Trace formula consists of 294 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-23 09:22:16,638 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:16,910 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:16,910 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:16,937 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:16,937 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:16,938 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:17,057 INFO L146 ILogger]: Checked inductivity of 697 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:17,057 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:17,057 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-05-23 09:22:17,058 INFO L146 ILogger]: Interpolant automaton has 6 states [2019-05-23 09:22:17,058 INFO L146 ILogger]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-23 09:22:17,058 INFO L146 ILogger]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-05-23 09:22:17,059 INFO L146 ILogger]: Start difference. First operand 197 states and 200 transitions. Second operand 6 states. [2019-05-23 09:22:17,133 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:17,133 INFO L146 ILogger]: Finished difference Result 206 states and 209 transitions. [2019-05-23 09:22:17,135 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-05-23 09:22:17,136 INFO L146 ILogger]: Start accepts. Automaton has 6 states. Word has length 196 [2019-05-23 09:22:17,136 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:17,138 INFO L146 ILogger]: With dead ends: 206 [2019-05-23 09:22:17,138 INFO L146 ILogger]: Without dead ends: 203 [2019-05-23 09:22:17,138 INFO L146 ILogger]: 0 DeclaredPredicates, 197 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-05-23 09:22:17,138 INFO L146 ILogger]: Start minimizeSevpa. Operand 203 states. [2019-05-23 09:22:17,141 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 203 to 201. [2019-05-23 09:22:17,141 INFO L146 ILogger]: Start removeUnreachable. Operand 201 states. [2019-05-23 09:22:17,142 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 201 states to 201 states and 204 transitions. [2019-05-23 09:22:17,142 INFO L146 ILogger]: Start accepts. Automaton has 201 states and 204 transitions. Word has length 196 [2019-05-23 09:22:17,142 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:17,142 INFO L146 ILogger]: Abstraction has 201 states and 204 transitions. [2019-05-23 09:22:17,142 INFO L146 ILogger]: Interpolant automaton has 6 states. [2019-05-23 09:22:17,142 INFO L146 ILogger]: Start isEmpty. Operand 201 states and 204 transitions. [2019-05-23 09:22:17,143 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 201 [2019-05-23 09:22:17,143 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:17,144 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:17,144 INFO L146 ILogger]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:17,144 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:17,144 INFO L146 ILogger]: Analyzing trace with hash 155735741, now seen corresponding path program 2 times [2019-05-23 09:22:17,145 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:17,178 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:17,181 INFO L146 ILogger]: Trace formula consists of 300 conjuncts, 14 conjunts are in the unsatisfiable core [2019-05-23 09:22:17,184 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:17,684 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:17,684 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:17,710 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:17,710 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:17,711 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:17,950 INFO L146 ILogger]: Checked inductivity of 702 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:17,950 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:17,950 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-05-23 09:22:17,951 INFO L146 ILogger]: Interpolant automaton has 8 states [2019-05-23 09:22:17,951 INFO L146 ILogger]: Constructing interpolant automaton starting with 8 interpolants. [2019-05-23 09:22:17,951 INFO L146 ILogger]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-05-23 09:22:17,952 INFO L146 ILogger]: Start difference. First operand 201 states and 204 transitions. Second operand 8 states. [2019-05-23 09:22:18,454 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:18,454 INFO L146 ILogger]: Finished difference Result 210 states and 213 transitions. [2019-05-23 09:22:18,455 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-05-23 09:22:18,455 INFO L146 ILogger]: Start accepts. Automaton has 8 states. Word has length 200 [2019-05-23 09:22:18,455 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:18,457 INFO L146 ILogger]: With dead ends: 210 [2019-05-23 09:22:18,457 INFO L146 ILogger]: Without dead ends: 207 [2019-05-23 09:22:18,458 INFO L146 ILogger]: 0 DeclaredPredicates, 203 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-05-23 09:22:18,458 INFO L146 ILogger]: Start minimizeSevpa. Operand 207 states. [2019-05-23 09:22:18,461 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 207 to 205. [2019-05-23 09:22:18,461 INFO L146 ILogger]: Start removeUnreachable. Operand 205 states. [2019-05-23 09:22:18,462 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 205 states to 205 states and 208 transitions. [2019-05-23 09:22:18,462 INFO L146 ILogger]: Start accepts. Automaton has 205 states and 208 transitions. Word has length 200 [2019-05-23 09:22:18,462 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:18,462 INFO L146 ILogger]: Abstraction has 205 states and 208 transitions. [2019-05-23 09:22:18,463 INFO L146 ILogger]: Interpolant automaton has 8 states. [2019-05-23 09:22:18,463 INFO L146 ILogger]: Start isEmpty. Operand 205 states and 208 transitions. [2019-05-23 09:22:18,464 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 205 [2019-05-23 09:22:18,464 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:18,464 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:18,464 INFO L146 ILogger]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:18,464 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:18,465 INFO L146 ILogger]: Analyzing trace with hash -467652357, now seen corresponding path program 3 times [2019-05-23 09:22:18,465 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:18,497 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:18,500 INFO L146 ILogger]: Trace formula consists of 306 conjuncts, 18 conjunts are in the unsatisfiable core [2019-05-23 09:22:18,503 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:19,376 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:19,376 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:19,402 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:19,402 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:19,402 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:19,710 INFO L146 ILogger]: Checked inductivity of 711 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:19,710 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:19,710 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-05-23 09:22:19,711 INFO L146 ILogger]: Interpolant automaton has 10 states [2019-05-23 09:22:19,711 INFO L146 ILogger]: Constructing interpolant automaton starting with 10 interpolants. [2019-05-23 09:22:19,711 INFO L146 ILogger]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-05-23 09:22:19,712 INFO L146 ILogger]: Start difference. First operand 205 states and 208 transitions. Second operand 10 states. [2019-05-23 09:22:20,674 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:20,674 INFO L146 ILogger]: Finished difference Result 214 states and 217 transitions. [2019-05-23 09:22:20,674 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-05-23 09:22:20,675 INFO L146 ILogger]: Start accepts. Automaton has 10 states. Word has length 204 [2019-05-23 09:22:20,675 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:20,676 INFO L146 ILogger]: With dead ends: 214 [2019-05-23 09:22:20,676 INFO L146 ILogger]: Without dead ends: 211 [2019-05-23 09:22:20,677 INFO L146 ILogger]: 0 DeclaredPredicates, 209 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-05-23 09:22:20,677 INFO L146 ILogger]: Start minimizeSevpa. Operand 211 states. [2019-05-23 09:22:20,680 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 211 to 209. [2019-05-23 09:22:20,680 INFO L146 ILogger]: Start removeUnreachable. Operand 209 states. [2019-05-23 09:22:20,681 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 209 states to 209 states and 212 transitions. [2019-05-23 09:22:20,681 INFO L146 ILogger]: Start accepts. Automaton has 209 states and 212 transitions. Word has length 204 [2019-05-23 09:22:20,681 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:20,681 INFO L146 ILogger]: Abstraction has 209 states and 212 transitions. [2019-05-23 09:22:20,682 INFO L146 ILogger]: Interpolant automaton has 10 states. [2019-05-23 09:22:20,682 INFO L146 ILogger]: Start isEmpty. Operand 209 states and 212 transitions. [2019-05-23 09:22:20,683 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 209 [2019-05-23 09:22:20,683 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:20,683 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:20,683 INFO L146 ILogger]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:20,683 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:20,684 INFO L146 ILogger]: Analyzing trace with hash 2128919609, now seen corresponding path program 4 times [2019-05-23 09:22:20,684 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:20,713 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:20,716 INFO L146 ILogger]: Trace formula consists of 312 conjuncts, 22 conjunts are in the unsatisfiable core [2019-05-23 09:22:20,719 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:20,924 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:20,924 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:20,926 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:20,926 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:20,926 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:20,984 INFO L146 ILogger]: Checked inductivity of 724 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:20,985 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:20,985 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-05-23 09:22:20,985 INFO L146 ILogger]: Interpolant automaton has 12 states [2019-05-23 09:22:20,985 INFO L146 ILogger]: Constructing interpolant automaton starting with 12 interpolants. [2019-05-23 09:22:20,985 INFO L146 ILogger]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-05-23 09:22:20,986 INFO L146 ILogger]: Start difference. First operand 209 states and 212 transitions. Second operand 12 states. [2019-05-23 09:22:21,374 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:21,374 INFO L146 ILogger]: Finished difference Result 218 states and 221 transitions. [2019-05-23 09:22:21,375 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-05-23 09:22:21,375 INFO L146 ILogger]: Start accepts. Automaton has 12 states. Word has length 208 [2019-05-23 09:22:21,376 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:21,377 INFO L146 ILogger]: With dead ends: 218 [2019-05-23 09:22:21,377 INFO L146 ILogger]: Without dead ends: 215 [2019-05-23 09:22:21,377 INFO L146 ILogger]: 0 DeclaredPredicates, 215 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-05-23 09:22:21,378 INFO L146 ILogger]: Start minimizeSevpa. Operand 215 states. [2019-05-23 09:22:21,381 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-05-23 09:22:21,382 INFO L146 ILogger]: Start removeUnreachable. Operand 213 states. [2019-05-23 09:22:21,383 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 213 states to 213 states and 216 transitions. [2019-05-23 09:22:21,383 INFO L146 ILogger]: Start accepts. Automaton has 213 states and 216 transitions. Word has length 208 [2019-05-23 09:22:21,383 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:21,383 INFO L146 ILogger]: Abstraction has 213 states and 216 transitions. [2019-05-23 09:22:21,384 INFO L146 ILogger]: Interpolant automaton has 12 states. [2019-05-23 09:22:21,384 INFO L146 ILogger]: Start isEmpty. Operand 213 states and 216 transitions. [2019-05-23 09:22:21,385 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 213 [2019-05-23 09:22:21,386 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:21,386 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:21,386 INFO L146 ILogger]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:21,387 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:21,387 INFO L146 ILogger]: Analyzing trace with hash -1042974601, now seen corresponding path program 5 times [2019-05-23 09:22:21,388 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:21,429 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:21,434 INFO L146 ILogger]: Trace formula consists of 318 conjuncts, 26 conjunts are in the unsatisfiable core [2019-05-23 09:22:21,437 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:21,762 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:21,763 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:21,764 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:21,764 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:21,764 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:21,794 INFO L146 ILogger]: Checked inductivity of 741 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:21,794 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:21,794 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-05-23 09:22:21,794 INFO L146 ILogger]: Interpolant automaton has 14 states [2019-05-23 09:22:21,795 INFO L146 ILogger]: Constructing interpolant automaton starting with 14 interpolants. [2019-05-23 09:22:21,795 INFO L146 ILogger]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-05-23 09:22:21,795 INFO L146 ILogger]: Start difference. First operand 213 states and 216 transitions. Second operand 14 states. [2019-05-23 09:22:22,048 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:22,048 INFO L146 ILogger]: Finished difference Result 222 states and 225 transitions. [2019-05-23 09:22:22,057 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-05-23 09:22:22,057 INFO L146 ILogger]: Start accepts. Automaton has 14 states. Word has length 212 [2019-05-23 09:22:22,057 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:22,058 INFO L146 ILogger]: With dead ends: 222 [2019-05-23 09:22:22,058 INFO L146 ILogger]: Without dead ends: 219 [2019-05-23 09:22:22,058 INFO L146 ILogger]: 0 DeclaredPredicates, 221 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-05-23 09:22:22,059 INFO L146 ILogger]: Start minimizeSevpa. Operand 219 states. [2019-05-23 09:22:22,061 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 219 to 217. [2019-05-23 09:22:22,061 INFO L146 ILogger]: Start removeUnreachable. Operand 217 states. [2019-05-23 09:22:22,061 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 217 states to 217 states and 220 transitions. [2019-05-23 09:22:22,062 INFO L146 ILogger]: Start accepts. Automaton has 217 states and 220 transitions. Word has length 212 [2019-05-23 09:22:22,062 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:22,062 INFO L146 ILogger]: Abstraction has 217 states and 220 transitions. [2019-05-23 09:22:22,062 INFO L146 ILogger]: Interpolant automaton has 14 states. [2019-05-23 09:22:22,062 INFO L146 ILogger]: Start isEmpty. Operand 217 states and 220 transitions. [2019-05-23 09:22:22,063 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 217 [2019-05-23 09:22:22,063 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:22,063 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:22,064 INFO L146 ILogger]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:22,064 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:22,064 INFO L146 ILogger]: Analyzing trace with hash 1769072053, now seen corresponding path program 6 times [2019-05-23 09:22:22,065 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:22,097 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:22,101 INFO L146 ILogger]: Trace formula consists of 324 conjuncts, 30 conjunts are in the unsatisfiable core [2019-05-23 09:22:22,103 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:22,491 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:22,491 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:22,492 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:22,493 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:22,493 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:22,553 INFO L146 ILogger]: Checked inductivity of 762 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:22,553 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:22,553 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-05-23 09:22:22,554 INFO L146 ILogger]: Interpolant automaton has 16 states [2019-05-23 09:22:22,554 INFO L146 ILogger]: Constructing interpolant automaton starting with 16 interpolants. [2019-05-23 09:22:22,554 INFO L146 ILogger]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-05-23 09:22:22,554 INFO L146 ILogger]: Start difference. First operand 217 states and 220 transitions. Second operand 16 states. [2019-05-23 09:22:22,989 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:22,989 INFO L146 ILogger]: Finished difference Result 226 states and 229 transitions. [2019-05-23 09:22:22,989 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-05-23 09:22:22,989 INFO L146 ILogger]: Start accepts. Automaton has 16 states. Word has length 216 [2019-05-23 09:22:22,990 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:22,991 INFO L146 ILogger]: With dead ends: 226 [2019-05-23 09:22:22,992 INFO L146 ILogger]: Without dead ends: 223 [2019-05-23 09:22:22,993 INFO L146 ILogger]: 0 DeclaredPredicates, 227 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-05-23 09:22:22,993 INFO L146 ILogger]: Start minimizeSevpa. Operand 223 states. [2019-05-23 09:22:22,996 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 223 to 221. [2019-05-23 09:22:22,996 INFO L146 ILogger]: Start removeUnreachable. Operand 221 states. [2019-05-23 09:22:22,997 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 221 states to 221 states and 224 transitions. [2019-05-23 09:22:22,997 INFO L146 ILogger]: Start accepts. Automaton has 221 states and 224 transitions. Word has length 216 [2019-05-23 09:22:22,997 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:22,997 INFO L146 ILogger]: Abstraction has 221 states and 224 transitions. [2019-05-23 09:22:22,998 INFO L146 ILogger]: Interpolant automaton has 16 states. [2019-05-23 09:22:22,998 INFO L146 ILogger]: Start isEmpty. Operand 221 states and 224 transitions. [2019-05-23 09:22:22,999 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 221 [2019-05-23 09:22:22,999 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:22,999 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:22,999 INFO L146 ILogger]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:22,999 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:23,000 INFO L146 ILogger]: Analyzing trace with hash -428243981, now seen corresponding path program 7 times [2019-05-23 09:22:23,000 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:23,036 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:23,039 INFO L146 ILogger]: Trace formula consists of 330 conjuncts, 34 conjunts are in the unsatisfiable core [2019-05-23 09:22:23,042 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:23,624 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:23,625 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:23,626 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:23,626 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:23,626 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:23,663 INFO L146 ILogger]: Checked inductivity of 787 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:23,664 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:23,664 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-05-23 09:22:23,664 INFO L146 ILogger]: Interpolant automaton has 18 states [2019-05-23 09:22:23,664 INFO L146 ILogger]: Constructing interpolant automaton starting with 18 interpolants. [2019-05-23 09:22:23,665 INFO L146 ILogger]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-05-23 09:22:23,665 INFO L146 ILogger]: Start difference. First operand 221 states and 224 transitions. Second operand 18 states. [2019-05-23 09:22:24,099 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:24,100 INFO L146 ILogger]: Finished difference Result 230 states and 233 transitions. [2019-05-23 09:22:24,106 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-05-23 09:22:24,106 INFO L146 ILogger]: Start accepts. Automaton has 18 states. Word has length 220 [2019-05-23 09:22:24,106 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:24,107 INFO L146 ILogger]: With dead ends: 230 [2019-05-23 09:22:24,107 INFO L146 ILogger]: Without dead ends: 227 [2019-05-23 09:22:24,108 INFO L146 ILogger]: 0 DeclaredPredicates, 233 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-05-23 09:22:24,108 INFO L146 ILogger]: Start minimizeSevpa. Operand 227 states. [2019-05-23 09:22:24,111 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 227 to 225. [2019-05-23 09:22:24,111 INFO L146 ILogger]: Start removeUnreachable. Operand 225 states. [2019-05-23 09:22:24,112 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 225 states to 225 states and 228 transitions. [2019-05-23 09:22:24,112 INFO L146 ILogger]: Start accepts. Automaton has 225 states and 228 transitions. Word has length 220 [2019-05-23 09:22:24,112 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:24,112 INFO L146 ILogger]: Abstraction has 225 states and 228 transitions. [2019-05-23 09:22:24,112 INFO L146 ILogger]: Interpolant automaton has 18 states. [2019-05-23 09:22:24,112 INFO L146 ILogger]: Start isEmpty. Operand 225 states and 228 transitions. [2019-05-23 09:22:24,113 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 225 [2019-05-23 09:22:24,114 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:24,114 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:24,114 INFO L146 ILogger]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:24,114 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:24,114 INFO L146 ILogger]: Analyzing trace with hash 1038865201, now seen corresponding path program 8 times [2019-05-23 09:22:24,115 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:24,148 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:24,152 INFO L146 ILogger]: Trace formula consists of 336 conjuncts, 38 conjunts are in the unsatisfiable core [2019-05-23 09:22:24,154 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:25,448 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:25,448 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:25,449 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:25,449 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:25,450 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:25,488 INFO L146 ILogger]: Checked inductivity of 816 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:25,488 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:25,488 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-05-23 09:22:25,489 INFO L146 ILogger]: Interpolant automaton has 20 states [2019-05-23 09:22:25,489 INFO L146 ILogger]: Constructing interpolant automaton starting with 20 interpolants. [2019-05-23 09:22:25,489 INFO L146 ILogger]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-05-23 09:22:25,489 INFO L146 ILogger]: Start difference. First operand 225 states and 228 transitions. Second operand 20 states. [2019-05-23 09:22:26,302 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:26,302 INFO L146 ILogger]: Finished difference Result 234 states and 237 transitions. [2019-05-23 09:22:26,302 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-05-23 09:22:26,302 INFO L146 ILogger]: Start accepts. Automaton has 20 states. Word has length 224 [2019-05-23 09:22:26,303 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:26,304 INFO L146 ILogger]: With dead ends: 234 [2019-05-23 09:22:26,305 INFO L146 ILogger]: Without dead ends: 231 [2019-05-23 09:22:26,305 INFO L146 ILogger]: 0 DeclaredPredicates, 239 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 09:22:26,306 INFO L146 ILogger]: Start minimizeSevpa. Operand 231 states. [2019-05-23 09:22:26,308 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 231 to 229. [2019-05-23 09:22:26,308 INFO L146 ILogger]: Start removeUnreachable. Operand 229 states. [2019-05-23 09:22:26,309 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 229 states to 229 states and 232 transitions. [2019-05-23 09:22:26,309 INFO L146 ILogger]: Start accepts. Automaton has 229 states and 232 transitions. Word has length 224 [2019-05-23 09:22:26,310 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:26,310 INFO L146 ILogger]: Abstraction has 229 states and 232 transitions. [2019-05-23 09:22:26,310 INFO L146 ILogger]: Interpolant automaton has 20 states. [2019-05-23 09:22:26,310 INFO L146 ILogger]: Start isEmpty. Operand 229 states and 232 transitions. [2019-05-23 09:22:26,311 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 229 [2019-05-23 09:22:26,311 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:26,311 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:26,311 INFO L146 ILogger]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:26,312 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:26,312 INFO L146 ILogger]: Analyzing trace with hash -385330321, now seen corresponding path program 9 times [2019-05-23 09:22:26,312 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:26,345 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:26,348 INFO L146 ILogger]: Trace formula consists of 342 conjuncts, 42 conjunts are in the unsatisfiable core [2019-05-23 09:22:26,351 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:26,774 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:26,775 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:26,776 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:26,776 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:26,776 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:26,819 INFO L146 ILogger]: Checked inductivity of 849 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:26,819 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:26,819 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-05-23 09:22:26,819 INFO L146 ILogger]: Interpolant automaton has 22 states [2019-05-23 09:22:26,820 INFO L146 ILogger]: Constructing interpolant automaton starting with 22 interpolants. [2019-05-23 09:22:26,820 INFO L146 ILogger]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2019-05-23 09:22:26,820 INFO L146 ILogger]: Start difference. First operand 229 states and 232 transitions. Second operand 22 states. [2019-05-23 09:22:27,471 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:27,471 INFO L146 ILogger]: Finished difference Result 238 states and 241 transitions. [2019-05-23 09:22:27,478 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-05-23 09:22:27,478 INFO L146 ILogger]: Start accepts. Automaton has 22 states. Word has length 228 [2019-05-23 09:22:27,478 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:27,479 INFO L146 ILogger]: With dead ends: 238 [2019-05-23 09:22:27,479 INFO L146 ILogger]: Without dead ends: 235 [2019-05-23 09:22:27,480 INFO L146 ILogger]: 0 DeclaredPredicates, 245 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 09:22:27,481 INFO L146 ILogger]: Start minimizeSevpa. Operand 235 states. [2019-05-23 09:22:27,484 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-05-23 09:22:27,485 INFO L146 ILogger]: Start removeUnreachable. Operand 233 states. [2019-05-23 09:22:27,485 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 233 states to 233 states and 236 transitions. [2019-05-23 09:22:27,485 INFO L146 ILogger]: Start accepts. Automaton has 233 states and 236 transitions. Word has length 228 [2019-05-23 09:22:27,486 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:27,486 INFO L146 ILogger]: Abstraction has 233 states and 236 transitions. [2019-05-23 09:22:27,486 INFO L146 ILogger]: Interpolant automaton has 22 states. [2019-05-23 09:22:27,486 INFO L146 ILogger]: Start isEmpty. Operand 233 states and 236 transitions. [2019-05-23 09:22:27,487 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 233 [2019-05-23 09:22:27,487 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:27,487 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:27,488 INFO L146 ILogger]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:27,488 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:27,488 INFO L146 ILogger]: Analyzing trace with hash -1253145427, now seen corresponding path program 10 times [2019-05-23 09:22:27,489 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:27,520 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:27,524 INFO L146 ILogger]: Trace formula consists of 348 conjuncts, 46 conjunts are in the unsatisfiable core [2019-05-23 09:22:27,526 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:28,036 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:28,036 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:28,037 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:28,038 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:28,038 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:28,080 INFO L146 ILogger]: Checked inductivity of 886 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:28,080 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:28,080 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-05-23 09:22:28,081 INFO L146 ILogger]: Interpolant automaton has 24 states [2019-05-23 09:22:28,081 INFO L146 ILogger]: Constructing interpolant automaton starting with 24 interpolants. [2019-05-23 09:22:28,081 INFO L146 ILogger]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2019-05-23 09:22:28,081 INFO L146 ILogger]: Start difference. First operand 233 states and 236 transitions. Second operand 24 states. [2019-05-23 09:22:28,942 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:28,942 INFO L146 ILogger]: Finished difference Result 242 states and 245 transitions. [2019-05-23 09:22:28,944 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-05-23 09:22:28,944 INFO L146 ILogger]: Start accepts. Automaton has 24 states. Word has length 232 [2019-05-23 09:22:28,944 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:28,945 INFO L146 ILogger]: With dead ends: 242 [2019-05-23 09:22:28,945 INFO L146 ILogger]: Without dead ends: 239 [2019-05-23 09:22:28,946 INFO L146 ILogger]: 0 DeclaredPredicates, 251 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 09:22:28,946 INFO L146 ILogger]: Start minimizeSevpa. Operand 239 states. [2019-05-23 09:22:28,948 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 239 to 237. [2019-05-23 09:22:28,949 INFO L146 ILogger]: Start removeUnreachable. Operand 237 states. [2019-05-23 09:22:28,949 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 237 states to 237 states and 240 transitions. [2019-05-23 09:22:28,949 INFO L146 ILogger]: Start accepts. Automaton has 237 states and 240 transitions. Word has length 232 [2019-05-23 09:22:28,950 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:28,950 INFO L146 ILogger]: Abstraction has 237 states and 240 transitions. [2019-05-23 09:22:28,950 INFO L146 ILogger]: Interpolant automaton has 24 states. [2019-05-23 09:22:28,950 INFO L146 ILogger]: Start isEmpty. Operand 237 states and 240 transitions. [2019-05-23 09:22:28,951 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 237 [2019-05-23 09:22:28,951 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:28,951 INFO L146 ILogger]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:28,952 INFO L146 ILogger]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:28,952 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:28,952 INFO L146 ILogger]: Analyzing trace with hash -1535252757, now seen corresponding path program 11 times [2019-05-23 09:22:28,952 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:28,989 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:28,993 INFO L146 ILogger]: Trace formula consists of 354 conjuncts, 50 conjunts are in the unsatisfiable core [2019-05-23 09:22:28,999 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:29,333 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:29,333 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:29,339 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:29,339 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:29,339 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:29,381 INFO L146 ILogger]: Checked inductivity of 927 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:29,381 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:29,381 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-05-23 09:22:29,382 INFO L146 ILogger]: Interpolant automaton has 26 states [2019-05-23 09:22:29,382 INFO L146 ILogger]: Constructing interpolant automaton starting with 26 interpolants. [2019-05-23 09:22:29,382 INFO L146 ILogger]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2019-05-23 09:22:29,382 INFO L146 ILogger]: Start difference. First operand 237 states and 240 transitions. Second operand 26 states. [2019-05-23 09:22:30,363 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:30,363 INFO L146 ILogger]: Finished difference Result 246 states and 249 transitions. [2019-05-23 09:22:30,363 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-05-23 09:22:30,364 INFO L146 ILogger]: Start accepts. Automaton has 26 states. Word has length 236 [2019-05-23 09:22:30,364 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:30,366 INFO L146 ILogger]: With dead ends: 246 [2019-05-23 09:22:30,366 INFO L146 ILogger]: Without dead ends: 243 [2019-05-23 09:22:30,367 INFO L146 ILogger]: 0 DeclaredPredicates, 257 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 09:22:30,368 INFO L146 ILogger]: Start minimizeSevpa. Operand 243 states. [2019-05-23 09:22:30,370 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 243 to 241. [2019-05-23 09:22:30,370 INFO L146 ILogger]: Start removeUnreachable. Operand 241 states. [2019-05-23 09:22:30,371 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 241 states to 241 states and 244 transitions. [2019-05-23 09:22:30,371 INFO L146 ILogger]: Start accepts. Automaton has 241 states and 244 transitions. Word has length 236 [2019-05-23 09:22:30,371 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:30,371 INFO L146 ILogger]: Abstraction has 241 states and 244 transitions. [2019-05-23 09:22:30,372 INFO L146 ILogger]: Interpolant automaton has 26 states. [2019-05-23 09:22:30,372 INFO L146 ILogger]: Start isEmpty. Operand 241 states and 244 transitions. [2019-05-23 09:22:30,373 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 241 [2019-05-23 09:22:30,373 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:30,373 INFO L146 ILogger]: trace histogram [12, 12, 12, 12, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:30,373 INFO L146 ILogger]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:30,374 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:30,374 INFO L146 ILogger]: Analyzing trace with hash -862586327, now seen corresponding path program 12 times [2019-05-23 09:22:30,374 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:30,406 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:30,409 INFO L146 ILogger]: Trace formula consists of 360 conjuncts, 54 conjunts are in the unsatisfiable core [2019-05-23 09:22:30,412 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:30,786 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:30,786 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:30,788 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:30,788 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:30,788 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:30,840 INFO L146 ILogger]: Checked inductivity of 972 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:30,841 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:30,841 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-05-23 09:22:30,841 INFO L146 ILogger]: Interpolant automaton has 28 states [2019-05-23 09:22:30,842 INFO L146 ILogger]: Constructing interpolant automaton starting with 28 interpolants. [2019-05-23 09:22:30,842 INFO L146 ILogger]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2019-05-23 09:22:30,842 INFO L146 ILogger]: Start difference. First operand 241 states and 244 transitions. Second operand 28 states. [2019-05-23 09:22:32,170 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:32,171 INFO L146 ILogger]: Finished difference Result 250 states and 253 transitions. [2019-05-23 09:22:32,171 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-05-23 09:22:32,171 INFO L146 ILogger]: Start accepts. Automaton has 28 states. Word has length 240 [2019-05-23 09:22:32,172 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:32,173 INFO L146 ILogger]: With dead ends: 250 [2019-05-23 09:22:32,173 INFO L146 ILogger]: Without dead ends: 247 [2019-05-23 09:22:32,174 INFO L146 ILogger]: 0 DeclaredPredicates, 263 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 09:22:32,174 INFO L146 ILogger]: Start minimizeSevpa. Operand 247 states. [2019-05-23 09:22:32,177 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 247 to 245. [2019-05-23 09:22:32,177 INFO L146 ILogger]: Start removeUnreachable. Operand 245 states. [2019-05-23 09:22:32,178 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 245 states to 245 states and 248 transitions. [2019-05-23 09:22:32,178 INFO L146 ILogger]: Start accepts. Automaton has 245 states and 248 transitions. Word has length 240 [2019-05-23 09:22:32,178 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:32,178 INFO L146 ILogger]: Abstraction has 245 states and 248 transitions. [2019-05-23 09:22:32,178 INFO L146 ILogger]: Interpolant automaton has 28 states. [2019-05-23 09:22:32,179 INFO L146 ILogger]: Start isEmpty. Operand 245 states and 248 transitions. [2019-05-23 09:22:32,180 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 245 [2019-05-23 09:22:32,180 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:32,180 INFO L146 ILogger]: trace histogram [13, 13, 13, 13, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:32,180 INFO L146 ILogger]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:32,180 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:32,181 INFO L146 ILogger]: Analyzing trace with hash 936787559, now seen corresponding path program 13 times [2019-05-23 09:22:32,181 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:32,215 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:32,219 INFO L146 ILogger]: Trace formula consists of 366 conjuncts, 58 conjunts are in the unsatisfiable core [2019-05-23 09:22:32,223 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:33,848 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:33,849 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:33,850 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:33,850 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:33,851 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:33,907 INFO L146 ILogger]: Checked inductivity of 1021 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:33,908 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:33,908 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-05-23 09:22:33,908 INFO L146 ILogger]: Interpolant automaton has 30 states [2019-05-23 09:22:33,908 INFO L146 ILogger]: Constructing interpolant automaton starting with 30 interpolants. [2019-05-23 09:22:33,909 INFO L146 ILogger]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2019-05-23 09:22:33,909 INFO L146 ILogger]: Start difference. First operand 245 states and 248 transitions. Second operand 30 states. [2019-05-23 09:22:35,531 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:35,532 INFO L146 ILogger]: Finished difference Result 254 states and 257 transitions. [2019-05-23 09:22:35,532 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-05-23 09:22:35,532 INFO L146 ILogger]: Start accepts. Automaton has 30 states. Word has length 244 [2019-05-23 09:22:35,533 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:35,534 INFO L146 ILogger]: With dead ends: 254 [2019-05-23 09:22:35,534 INFO L146 ILogger]: Without dead ends: 251 [2019-05-23 09:22:35,535 INFO L146 ILogger]: 0 DeclaredPredicates, 269 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 09:22:35,536 INFO L146 ILogger]: Start minimizeSevpa. Operand 251 states. [2019-05-23 09:22:35,538 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 251 to 249. [2019-05-23 09:22:35,538 INFO L146 ILogger]: Start removeUnreachable. Operand 249 states. [2019-05-23 09:22:35,538 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 249 states to 249 states and 252 transitions. [2019-05-23 09:22:35,539 INFO L146 ILogger]: Start accepts. Automaton has 249 states and 252 transitions. Word has length 244 [2019-05-23 09:22:35,539 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:35,539 INFO L146 ILogger]: Abstraction has 249 states and 252 transitions. [2019-05-23 09:22:35,539 INFO L146 ILogger]: Interpolant automaton has 30 states. [2019-05-23 09:22:35,539 INFO L146 ILogger]: Start isEmpty. Operand 249 states and 252 transitions. [2019-05-23 09:22:35,540 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 249 [2019-05-23 09:22:35,540 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:35,541 INFO L146 ILogger]: trace histogram [14, 14, 14, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:35,541 INFO L146 ILogger]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:35,541 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:35,541 INFO L146 ILogger]: Analyzing trace with hash -994167899, now seen corresponding path program 14 times [2019-05-23 09:22:35,542 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:35,575 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:35,579 INFO L146 ILogger]: Trace formula consists of 372 conjuncts, 62 conjunts are in the unsatisfiable core [2019-05-23 09:22:35,583 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:36,040 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:36,041 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:36,046 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:36,047 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:36,047 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:36,106 INFO L146 ILogger]: Checked inductivity of 1074 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:36,107 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:36,107 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-05-23 09:22:36,107 INFO L146 ILogger]: Interpolant automaton has 32 states [2019-05-23 09:22:36,107 INFO L146 ILogger]: Constructing interpolant automaton starting with 32 interpolants. [2019-05-23 09:22:36,108 INFO L146 ILogger]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2019-05-23 09:22:36,108 INFO L146 ILogger]: Start difference. First operand 249 states and 252 transitions. Second operand 32 states. [2019-05-23 09:22:37,817 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:37,817 INFO L146 ILogger]: Finished difference Result 258 states and 261 transitions. [2019-05-23 09:22:37,818 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-05-23 09:22:37,818 INFO L146 ILogger]: Start accepts. Automaton has 32 states. Word has length 248 [2019-05-23 09:22:37,818 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:37,819 INFO L146 ILogger]: With dead ends: 258 [2019-05-23 09:22:37,819 INFO L146 ILogger]: Without dead ends: 255 [2019-05-23 09:22:37,821 INFO L146 ILogger]: 0 DeclaredPredicates, 275 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 09:22:37,821 INFO L146 ILogger]: Start minimizeSevpa. Operand 255 states. [2019-05-23 09:22:37,824 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 255 to 253. [2019-05-23 09:22:37,824 INFO L146 ILogger]: Start removeUnreachable. Operand 253 states. [2019-05-23 09:22:37,824 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 253 states to 253 states and 256 transitions. [2019-05-23 09:22:37,824 INFO L146 ILogger]: Start accepts. Automaton has 253 states and 256 transitions. Word has length 248 [2019-05-23 09:22:37,825 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:37,825 INFO L146 ILogger]: Abstraction has 253 states and 256 transitions. [2019-05-23 09:22:37,825 INFO L146 ILogger]: Interpolant automaton has 32 states. [2019-05-23 09:22:37,825 INFO L146 ILogger]: Start isEmpty. Operand 253 states and 256 transitions. [2019-05-23 09:22:37,826 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 253 [2019-05-23 09:22:37,826 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:37,827 INFO L146 ILogger]: trace histogram [15, 15, 15, 15, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:37,827 INFO L146 ILogger]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:37,827 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:37,827 INFO L146 ILogger]: Analyzing trace with hash 101538275, now seen corresponding path program 15 times [2019-05-23 09:22:37,828 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,867 INFO L146 ILogger]: Trace formula consists of 378 conjuncts, 66 conjunts are in the unsatisfiable core [2019-05-23 09:22:37,870 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:38,853 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:38,854 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:38,855 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:38,855 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:38,855 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:38,924 INFO L146 ILogger]: Checked inductivity of 1131 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:38,924 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:38,924 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-05-23 09:22:38,925 INFO L146 ILogger]: Interpolant automaton has 34 states [2019-05-23 09:22:38,925 INFO L146 ILogger]: Constructing interpolant automaton starting with 34 interpolants. [2019-05-23 09:22:38,925 INFO L146 ILogger]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 09:22:38,925 INFO L146 ILogger]: Start difference. First operand 253 states and 256 transitions. Second operand 34 states. [2019-05-23 09:22:40,585 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:40,585 INFO L146 ILogger]: Finished difference Result 262 states and 265 transitions. [2019-05-23 09:22:40,586 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-05-23 09:22:40,586 INFO L146 ILogger]: Start accepts. Automaton has 34 states. Word has length 252 [2019-05-23 09:22:40,586 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:40,587 INFO L146 ILogger]: With dead ends: 262 [2019-05-23 09:22:40,587 INFO L146 ILogger]: Without dead ends: 259 [2019-05-23 09:22:40,589 INFO L146 ILogger]: 0 DeclaredPredicates, 281 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 09:22:40,589 INFO L146 ILogger]: Start minimizeSevpa. Operand 259 states. [2019-05-23 09:22:40,591 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 259 to 257. [2019-05-23 09:22:40,591 INFO L146 ILogger]: Start removeUnreachable. Operand 257 states. [2019-05-23 09:22:40,592 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 257 states to 257 states and 260 transitions. [2019-05-23 09:22:40,592 INFO L146 ILogger]: Start accepts. Automaton has 257 states and 260 transitions. Word has length 252 [2019-05-23 09:22:40,592 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:40,592 INFO L146 ILogger]: Abstraction has 257 states and 260 transitions. [2019-05-23 09:22:40,592 INFO L146 ILogger]: Interpolant automaton has 34 states. [2019-05-23 09:22:40,592 INFO L146 ILogger]: Start isEmpty. Operand 257 states and 260 transitions. [2019-05-23 09:22:40,593 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 257 [2019-05-23 09:22:40,594 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:40,594 INFO L146 ILogger]: trace histogram [16, 16, 16, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:40,594 INFO L146 ILogger]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:40,594 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:40,594 INFO L146 ILogger]: Analyzing trace with hash 583217441, now seen corresponding path program 16 times [2019-05-23 09:22:40,595 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:40,632 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:40,636 INFO L146 ILogger]: Trace formula consists of 384 conjuncts, 70 conjunts are in the unsatisfiable core [2019-05-23 09:22:40,639 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:41,934 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:41,934 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:41,937 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:41,937 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:41,938 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:42,001 INFO L146 ILogger]: Checked inductivity of 1192 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:42,001 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:42,001 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-05-23 09:22:42,002 INFO L146 ILogger]: Interpolant automaton has 36 states [2019-05-23 09:22:42,002 INFO L146 ILogger]: Constructing interpolant automaton starting with 36 interpolants. [2019-05-23 09:22:42,002 INFO L146 ILogger]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 09:22:42,003 INFO L146 ILogger]: Start difference. First operand 257 states and 260 transitions. Second operand 36 states. [2019-05-23 09:22:43,748 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:43,749 INFO L146 ILogger]: Finished difference Result 266 states and 269 transitions. [2019-05-23 09:22:43,749 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-05-23 09:22:43,749 INFO L146 ILogger]: Start accepts. Automaton has 36 states. Word has length 256 [2019-05-23 09:22:43,750 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:43,750 INFO L146 ILogger]: With dead ends: 266 [2019-05-23 09:22:43,751 INFO L146 ILogger]: Without dead ends: 263 [2019-05-23 09:22:43,753 INFO L146 ILogger]: 0 DeclaredPredicates, 287 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 09:22:43,754 INFO L146 ILogger]: Start minimizeSevpa. Operand 263 states. [2019-05-23 09:22:43,757 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 263 to 261. [2019-05-23 09:22:43,757 INFO L146 ILogger]: Start removeUnreachable. Operand 261 states. [2019-05-23 09:22:43,757 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 261 states to 261 states and 264 transitions. [2019-05-23 09:22:43,758 INFO L146 ILogger]: Start accepts. Automaton has 261 states and 264 transitions. Word has length 256 [2019-05-23 09:22:43,758 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:43,758 INFO L146 ILogger]: Abstraction has 261 states and 264 transitions. [2019-05-23 09:22:43,758 INFO L146 ILogger]: Interpolant automaton has 36 states. [2019-05-23 09:22:43,758 INFO L146 ILogger]: Start isEmpty. Operand 261 states and 264 transitions. [2019-05-23 09:22:43,760 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 261 [2019-05-23 09:22:43,760 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:43,760 INFO L146 ILogger]: trace histogram [17, 17, 17, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:43,761 INFO L146 ILogger]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:43,761 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:43,761 INFO L146 ILogger]: Analyzing trace with hash -1239467681, now seen corresponding path program 17 times [2019-05-23 09:22:43,762 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:43,806 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:43,810 INFO L146 ILogger]: Trace formula consists of 390 conjuncts, 74 conjunts are in the unsatisfiable core [2019-05-23 09:22:43,813 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:44,350 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:44,350 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:44,351 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:44,351 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:44,351 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:44,413 INFO L146 ILogger]: Checked inductivity of 1257 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:44,413 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:44,413 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-05-23 09:22:44,414 INFO L146 ILogger]: Interpolant automaton has 38 states [2019-05-23 09:22:44,414 INFO L146 ILogger]: Constructing interpolant automaton starting with 38 interpolants. [2019-05-23 09:22:44,414 INFO L146 ILogger]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 09:22:44,415 INFO L146 ILogger]: Start difference. First operand 261 states and 264 transitions. Second operand 38 states. [2019-05-23 09:22:46,461 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:46,461 INFO L146 ILogger]: Finished difference Result 270 states and 273 transitions. [2019-05-23 09:22:46,462 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-05-23 09:22:46,462 INFO L146 ILogger]: Start accepts. Automaton has 38 states. Word has length 260 [2019-05-23 09:22:46,462 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:46,463 INFO L146 ILogger]: With dead ends: 270 [2019-05-23 09:22:46,463 INFO L146 ILogger]: Without dead ends: 267 [2019-05-23 09:22:46,464 INFO L146 ILogger]: 0 DeclaredPredicates, 293 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=210, Invalid=4902, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 09:22:46,464 INFO L146 ILogger]: Start minimizeSevpa. Operand 267 states. [2019-05-23 09:22:46,467 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 267 to 265. [2019-05-23 09:22:46,467 INFO L146 ILogger]: Start removeUnreachable. Operand 265 states. [2019-05-23 09:22:46,467 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 265 states to 265 states and 268 transitions. [2019-05-23 09:22:46,467 INFO L146 ILogger]: Start accepts. Automaton has 265 states and 268 transitions. Word has length 260 [2019-05-23 09:22:46,468 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:46,468 INFO L146 ILogger]: Abstraction has 265 states and 268 transitions. [2019-05-23 09:22:46,468 INFO L146 ILogger]: Interpolant automaton has 38 states. [2019-05-23 09:22:46,468 INFO L146 ILogger]: Start isEmpty. Operand 265 states and 268 transitions. [2019-05-23 09:22:46,469 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 265 [2019-05-23 09:22:46,469 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:46,470 INFO L146 ILogger]: trace histogram [18, 18, 18, 18, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:46,470 INFO L146 ILogger]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:46,470 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:46,470 INFO L146 ILogger]: Analyzing trace with hash -1348406627, now seen corresponding path program 18 times [2019-05-23 09:22:46,471 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:46,507 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:46,511 INFO L146 ILogger]: Trace formula consists of 396 conjuncts, 78 conjunts are in the unsatisfiable core [2019-05-23 09:22:46,514 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:47,356 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:47,356 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:47,377 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:47,377 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:47,378 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:47,439 INFO L146 ILogger]: Checked inductivity of 1326 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:47,440 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:47,440 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-05-23 09:22:47,440 INFO L146 ILogger]: Interpolant automaton has 40 states [2019-05-23 09:22:47,440 INFO L146 ILogger]: Constructing interpolant automaton starting with 40 interpolants. [2019-05-23 09:22:47,441 INFO L146 ILogger]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 09:22:47,441 INFO L146 ILogger]: Start difference. First operand 265 states and 268 transitions. Second operand 40 states. [2019-05-23 09:22:49,648 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:49,648 INFO L146 ILogger]: Finished difference Result 274 states and 277 transitions. [2019-05-23 09:22:49,649 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-05-23 09:22:49,649 INFO L146 ILogger]: Start accepts. Automaton has 40 states. Word has length 264 [2019-05-23 09:22:49,649 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:49,650 INFO L146 ILogger]: With dead ends: 274 [2019-05-23 09:22:49,650 INFO L146 ILogger]: Without dead ends: 271 [2019-05-23 09:22:49,652 INFO L146 ILogger]: 0 DeclaredPredicates, 299 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=222, Invalid=5478, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 09:22:49,652 INFO L146 ILogger]: Start minimizeSevpa. Operand 271 states. [2019-05-23 09:22:49,654 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 271 to 269. [2019-05-23 09:22:49,655 INFO L146 ILogger]: Start removeUnreachable. Operand 269 states. [2019-05-23 09:22:49,655 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 269 states to 269 states and 272 transitions. [2019-05-23 09:22:49,655 INFO L146 ILogger]: Start accepts. Automaton has 269 states and 272 transitions. Word has length 264 [2019-05-23 09:22:49,655 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:49,656 INFO L146 ILogger]: Abstraction has 269 states and 272 transitions. [2019-05-23 09:22:49,656 INFO L146 ILogger]: Interpolant automaton has 40 states. [2019-05-23 09:22:49,656 INFO L146 ILogger]: Start isEmpty. Operand 269 states and 272 transitions. [2019-05-23 09:22:49,657 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 269 [2019-05-23 09:22:49,657 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:49,657 INFO L146 ILogger]: trace histogram [19, 19, 19, 19, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:49,658 INFO L146 ILogger]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:49,658 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:49,658 INFO L146 ILogger]: Analyzing trace with hash 856153307, now seen corresponding path program 19 times [2019-05-23 09:22:49,659 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:49,693 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:49,698 INFO L146 ILogger]: Trace formula consists of 402 conjuncts, 82 conjunts are in the unsatisfiable core [2019-05-23 09:22:49,701 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:50,344 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:50,344 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:50,345 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:50,345 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:50,345 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:50,419 INFO L146 ILogger]: Checked inductivity of 1399 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:50,419 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:50,419 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-05-23 09:22:50,420 INFO L146 ILogger]: Interpolant automaton has 42 states [2019-05-23 09:22:50,420 INFO L146 ILogger]: Constructing interpolant automaton starting with 42 interpolants. [2019-05-23 09:22:50,421 INFO L146 ILogger]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 09:22:50,421 INFO L146 ILogger]: Start difference. First operand 269 states and 272 transitions. Second operand 42 states. [2019-05-23 09:22:53,184 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:53,185 INFO L146 ILogger]: Finished difference Result 278 states and 281 transitions. [2019-05-23 09:22:53,185 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-05-23 09:22:53,185 INFO L146 ILogger]: Start accepts. Automaton has 42 states. Word has length 268 [2019-05-23 09:22:53,186 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:53,187 INFO L146 ILogger]: With dead ends: 278 [2019-05-23 09:22:53,187 INFO L146 ILogger]: Without dead ends: 275 [2019-05-23 09:22:53,188 INFO L146 ILogger]: 0 DeclaredPredicates, 305 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=234, Invalid=6086, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 09:22:53,189 INFO L146 ILogger]: Start minimizeSevpa. Operand 275 states. [2019-05-23 09:22:53,192 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 275 to 273. [2019-05-23 09:22:53,192 INFO L146 ILogger]: Start removeUnreachable. Operand 273 states. [2019-05-23 09:22:53,192 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 273 states to 273 states and 276 transitions. [2019-05-23 09:22:53,192 INFO L146 ILogger]: Start accepts. Automaton has 273 states and 276 transitions. Word has length 268 [2019-05-23 09:22:53,193 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:53,193 INFO L146 ILogger]: Abstraction has 273 states and 276 transitions. [2019-05-23 09:22:53,193 INFO L146 ILogger]: Interpolant automaton has 42 states. [2019-05-23 09:22:53,193 INFO L146 ILogger]: Start isEmpty. Operand 273 states and 276 transitions. [2019-05-23 09:22:53,194 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 273 [2019-05-23 09:22:53,194 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:53,195 INFO L146 ILogger]: trace histogram [20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:53,195 INFO L146 ILogger]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:53,195 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:53,195 INFO L146 ILogger]: Analyzing trace with hash 2018736153, now seen corresponding path program 20 times [2019-05-23 09:22:53,196 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:53,232 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:53,237 INFO L146 ILogger]: Trace formula consists of 408 conjuncts, 86 conjunts are in the unsatisfiable core [2019-05-23 09:22:53,241 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:54,050 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:54,051 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:54,052 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:54,052 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:54,053 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:54,120 INFO L146 ILogger]: Checked inductivity of 1476 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:54,120 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:54,120 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-05-23 09:22:54,121 INFO L146 ILogger]: Interpolant automaton has 44 states [2019-05-23 09:22:54,121 INFO L146 ILogger]: Constructing interpolant automaton starting with 44 interpolants. [2019-05-23 09:22:54,121 INFO L146 ILogger]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 09:22:54,121 INFO L146 ILogger]: Start difference. First operand 273 states and 276 transitions. Second operand 44 states. [2019-05-23 09:22:56,876 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:56,876 INFO L146 ILogger]: Finished difference Result 282 states and 285 transitions. [2019-05-23 09:22:56,877 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-05-23 09:22:56,877 INFO L146 ILogger]: Start accepts. Automaton has 44 states. Word has length 272 [2019-05-23 09:22:56,877 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:56,878 INFO L146 ILogger]: With dead ends: 282 [2019-05-23 09:22:56,878 INFO L146 ILogger]: Without dead ends: 279 [2019-05-23 09:22:56,879 INFO L146 ILogger]: 0 DeclaredPredicates, 311 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=246, Invalid=6726, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 09:22:56,879 INFO L146 ILogger]: Start minimizeSevpa. Operand 279 states. [2019-05-23 09:22:56,881 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 279 to 277. [2019-05-23 09:22:56,882 INFO L146 ILogger]: Start removeUnreachable. Operand 277 states. [2019-05-23 09:22:56,882 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 277 states to 277 states and 280 transitions. [2019-05-23 09:22:56,882 INFO L146 ILogger]: Start accepts. Automaton has 277 states and 280 transitions. Word has length 272 [2019-05-23 09:22:56,883 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:56,883 INFO L146 ILogger]: Abstraction has 277 states and 280 transitions. [2019-05-23 09:22:56,883 INFO L146 ILogger]: Interpolant automaton has 44 states. [2019-05-23 09:22:56,883 INFO L146 ILogger]: Start isEmpty. Operand 277 states and 280 transitions. [2019-05-23 09:22:56,884 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 277 [2019-05-23 09:22:56,884 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:56,885 INFO L146 ILogger]: trace histogram [21, 21, 21, 21, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:56,885 INFO L146 ILogger]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:56,885 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:56,885 INFO L146 ILogger]: Analyzing trace with hash -1413266345, now seen corresponding path program 21 times [2019-05-23 09:22:56,886 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:56,926 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:56,930 INFO L146 ILogger]: Trace formula consists of 414 conjuncts, 90 conjunts are in the unsatisfiable core [2019-05-23 09:22:56,934 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:57,716 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:22:57,716 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:57,718 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:57,718 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:57,718 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:22:57,795 INFO L146 ILogger]: Checked inductivity of 1557 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:22:57,796 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:57,796 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-05-23 09:22:57,796 INFO L146 ILogger]: Interpolant automaton has 46 states [2019-05-23 09:22:57,796 INFO L146 ILogger]: Constructing interpolant automaton starting with 46 interpolants. [2019-05-23 09:22:57,797 INFO L146 ILogger]: CoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 09:22:57,797 INFO L146 ILogger]: Start difference. First operand 277 states and 280 transitions. Second operand 46 states. [2019-05-23 09:23:00,735 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:00,736 INFO L146 ILogger]: Finished difference Result 286 states and 289 transitions. [2019-05-23 09:23:00,736 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-05-23 09:23:00,736 INFO L146 ILogger]: Start accepts. Automaton has 46 states. Word has length 276 [2019-05-23 09:23:00,736 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:00,737 INFO L146 ILogger]: With dead ends: 286 [2019-05-23 09:23:00,737 INFO L146 ILogger]: Without dead ends: 283 [2019-05-23 09:23:00,738 INFO L146 ILogger]: 0 DeclaredPredicates, 317 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=258, Invalid=7398, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 09:23:00,739 INFO L146 ILogger]: Start minimizeSevpa. Operand 283 states. [2019-05-23 09:23:00,741 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 283 to 281. [2019-05-23 09:23:00,741 INFO L146 ILogger]: Start removeUnreachable. Operand 281 states. [2019-05-23 09:23:00,742 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 281 states to 281 states and 284 transitions. [2019-05-23 09:23:00,742 INFO L146 ILogger]: Start accepts. Automaton has 281 states and 284 transitions. Word has length 276 [2019-05-23 09:23:00,742 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:00,743 INFO L146 ILogger]: Abstraction has 281 states and 284 transitions. [2019-05-23 09:23:00,743 INFO L146 ILogger]: Interpolant automaton has 46 states. [2019-05-23 09:23:00,743 INFO L146 ILogger]: Start isEmpty. Operand 281 states and 284 transitions. [2019-05-23 09:23:00,744 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 281 [2019-05-23 09:23:00,744 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:00,744 INFO L146 ILogger]: trace histogram [22, 22, 22, 22, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:00,745 INFO L146 ILogger]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:00,745 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:00,745 INFO L146 ILogger]: Analyzing trace with hash -841563755, now seen corresponding path program 22 times [2019-05-23 09:23:00,746 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:00,782 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:00,787 INFO L146 ILogger]: Trace formula consists of 420 conjuncts, 94 conjunts are in the unsatisfiable core [2019-05-23 09:23:00,792 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:01,696 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:23:01,697 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:01,698 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:01,698 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:01,698 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:23:01,781 INFO L146 ILogger]: Checked inductivity of 1642 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:23:01,782 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:01,782 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-05-23 09:23:01,782 INFO L146 ILogger]: Interpolant automaton has 48 states [2019-05-23 09:23:01,782 INFO L146 ILogger]: Constructing interpolant automaton starting with 48 interpolants. [2019-05-23 09:23:01,783 INFO L146 ILogger]: CoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 09:23:01,783 INFO L146 ILogger]: Start difference. First operand 281 states and 284 transitions. Second operand 48 states. [2019-05-23 09:23:05,189 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:05,189 INFO L146 ILogger]: Finished difference Result 290 states and 293 transitions. [2019-05-23 09:23:05,190 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-05-23 09:23:05,190 INFO L146 ILogger]: Start accepts. Automaton has 48 states. Word has length 280 [2019-05-23 09:23:05,190 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:05,191 INFO L146 ILogger]: With dead ends: 290 [2019-05-23 09:23:05,191 INFO L146 ILogger]: Without dead ends: 287 [2019-05-23 09:23:05,192 INFO L146 ILogger]: 0 DeclaredPredicates, 323 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=270, Invalid=8102, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 09:23:05,193 INFO L146 ILogger]: Start minimizeSevpa. Operand 287 states. [2019-05-23 09:23:05,195 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 287 to 285. [2019-05-23 09:23:05,195 INFO L146 ILogger]: Start removeUnreachable. Operand 285 states. [2019-05-23 09:23:05,196 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 285 states to 285 states and 288 transitions. [2019-05-23 09:23:05,196 INFO L146 ILogger]: Start accepts. Automaton has 285 states and 288 transitions. Word has length 280 [2019-05-23 09:23:05,196 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:05,196 INFO L146 ILogger]: Abstraction has 285 states and 288 transitions. [2019-05-23 09:23:05,196 INFO L146 ILogger]: Interpolant automaton has 48 states. [2019-05-23 09:23:05,196 INFO L146 ILogger]: Start isEmpty. Operand 285 states and 288 transitions. [2019-05-23 09:23:05,198 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 285 [2019-05-23 09:23:05,198 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:05,198 INFO L146 ILogger]: trace histogram [23, 23, 23, 23, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:05,198 INFO L146 ILogger]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:05,199 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:05,199 INFO L146 ILogger]: Analyzing trace with hash -1823641645, now seen corresponding path program 23 times [2019-05-23 09:23:05,199 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:05,240 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:05,247 INFO L146 ILogger]: Trace formula consists of 426 conjuncts, 98 conjunts are in the unsatisfiable core [2019-05-23 09:23:05,251 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:06,215 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:23:06,216 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:06,220 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:06,221 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:06,221 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:23:06,297 INFO L146 ILogger]: Checked inductivity of 1731 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:23:06,298 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:06,298 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-05-23 09:23:06,298 INFO L146 ILogger]: Interpolant automaton has 50 states [2019-05-23 09:23:06,298 INFO L146 ILogger]: Constructing interpolant automaton starting with 50 interpolants. [2019-05-23 09:23:06,299 INFO L146 ILogger]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 09:23:06,299 INFO L146 ILogger]: Start difference. First operand 285 states and 288 transitions. Second operand 50 states. [2019-05-23 09:23:10,135 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:10,136 INFO L146 ILogger]: Finished difference Result 294 states and 297 transitions. [2019-05-23 09:23:10,136 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-05-23 09:23:10,136 INFO L146 ILogger]: Start accepts. Automaton has 50 states. Word has length 284 [2019-05-23 09:23:10,137 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:10,137 INFO L146 ILogger]: With dead ends: 294 [2019-05-23 09:23:10,138 INFO L146 ILogger]: Without dead ends: 291 [2019-05-23 09:23:10,139 INFO L146 ILogger]: 0 DeclaredPredicates, 329 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=282, Invalid=8838, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 09:23:10,139 INFO L146 ILogger]: Start minimizeSevpa. Operand 291 states. [2019-05-23 09:23:10,141 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 291 to 289. [2019-05-23 09:23:10,141 INFO L146 ILogger]: Start removeUnreachable. Operand 289 states. [2019-05-23 09:23:10,142 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 289 states to 289 states and 292 transitions. [2019-05-23 09:23:10,142 INFO L146 ILogger]: Start accepts. Automaton has 289 states and 292 transitions. Word has length 284 [2019-05-23 09:23:10,142 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:10,142 INFO L146 ILogger]: Abstraction has 289 states and 292 transitions. [2019-05-23 09:23:10,143 INFO L146 ILogger]: Interpolant automaton has 50 states. [2019-05-23 09:23:10,143 INFO L146 ILogger]: Start isEmpty. Operand 289 states and 292 transitions. [2019-05-23 09:23:10,144 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 289 [2019-05-23 09:23:10,144 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:10,144 INFO L146 ILogger]: trace histogram [24, 24, 24, 24, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:10,145 INFO L146 ILogger]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:10,145 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:10,145 INFO L146 ILogger]: Analyzing trace with hash 1160171281, now seen corresponding path program 24 times [2019-05-23 09:23:10,145 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:10,184 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:10,189 INFO L146 ILogger]: Trace formula consists of 432 conjuncts, 102 conjunts are in the unsatisfiable core [2019-05-23 09:23:10,193 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:11,286 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:23:11,287 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:11,288 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:11,289 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:11,289 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:23:11,367 INFO L146 ILogger]: Checked inductivity of 1824 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:23:11,368 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:11,368 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-05-23 09:23:11,368 INFO L146 ILogger]: Interpolant automaton has 52 states [2019-05-23 09:23:11,368 INFO L146 ILogger]: Constructing interpolant automaton starting with 52 interpolants. [2019-05-23 09:23:11,368 INFO L146 ILogger]: CoverageRelationStatistics Valid=102, Invalid=2550, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 09:23:11,369 INFO L146 ILogger]: Start difference. First operand 289 states and 292 transitions. Second operand 52 states. [2019-05-23 09:23:15,363 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:15,364 INFO L146 ILogger]: Finished difference Result 298 states and 301 transitions. [2019-05-23 09:23:15,364 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-05-23 09:23:15,364 INFO L146 ILogger]: Start accepts. Automaton has 52 states. Word has length 288 [2019-05-23 09:23:15,365 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:15,366 INFO L146 ILogger]: With dead ends: 298 [2019-05-23 09:23:15,366 INFO L146 ILogger]: Without dead ends: 295 [2019-05-23 09:23:15,367 INFO L146 ILogger]: 0 DeclaredPredicates, 335 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=294, Invalid=9606, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 09:23:15,367 INFO L146 ILogger]: Start minimizeSevpa. Operand 295 states. [2019-05-23 09:23:15,369 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 295 to 293. [2019-05-23 09:23:15,370 INFO L146 ILogger]: Start removeUnreachable. Operand 293 states. [2019-05-23 09:23:15,370 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 293 states to 293 states and 296 transitions. [2019-05-23 09:23:15,370 INFO L146 ILogger]: Start accepts. Automaton has 293 states and 296 transitions. Word has length 288 [2019-05-23 09:23:15,371 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:15,371 INFO L146 ILogger]: Abstraction has 293 states and 296 transitions. [2019-05-23 09:23:15,371 INFO L146 ILogger]: Interpolant automaton has 52 states. [2019-05-23 09:23:15,371 INFO L146 ILogger]: Start isEmpty. Operand 293 states and 296 transitions. [2019-05-23 09:23:15,372 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 293 [2019-05-23 09:23:15,372 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:15,373 INFO L146 ILogger]: trace histogram [25, 25, 25, 25, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:15,373 INFO L146 ILogger]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:15,373 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:15,373 INFO L146 ILogger]: Analyzing trace with hash -1599971505, now seen corresponding path program 25 times [2019-05-23 09:23:15,374 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:15,416 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:15,421 INFO L146 ILogger]: Trace formula consists of 438 conjuncts, 106 conjunts are in the unsatisfiable core [2019-05-23 09:23:15,424 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:16,616 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:23:16,616 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:16,617 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:16,617 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:16,618 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:23:16,694 INFO L146 ILogger]: Checked inductivity of 1921 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:23:16,694 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:16,694 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-05-23 09:23:16,694 INFO L146 ILogger]: Interpolant automaton has 54 states [2019-05-23 09:23:16,695 INFO L146 ILogger]: Constructing interpolant automaton starting with 54 interpolants. [2019-05-23 09:23:16,695 INFO L146 ILogger]: CoverageRelationStatistics Valid=106, Invalid=2756, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 09:23:16,695 INFO L146 ILogger]: Start difference. First operand 293 states and 296 transitions. Second operand 54 states. [2019-05-23 09:23:20,962 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:20,962 INFO L146 ILogger]: Finished difference Result 302 states and 305 transitions. [2019-05-23 09:23:20,962 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-05-23 09:23:20,962 INFO L146 ILogger]: Start accepts. Automaton has 54 states. Word has length 292 [2019-05-23 09:23:20,963 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:20,964 INFO L146 ILogger]: With dead ends: 302 [2019-05-23 09:23:20,964 INFO L146 ILogger]: Without dead ends: 299 [2019-05-23 09:23:20,964 INFO L146 ILogger]: 0 DeclaredPredicates, 341 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=306, Invalid=10406, Unknown=0, NotChecked=0, Total=10712 [2019-05-23 09:23:20,965 INFO L146 ILogger]: Start minimizeSevpa. Operand 299 states. [2019-05-23 09:23:20,967 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 299 to 297. [2019-05-23 09:23:20,967 INFO L146 ILogger]: Start removeUnreachable. Operand 297 states. [2019-05-23 09:23:20,967 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 297 states to 297 states and 300 transitions. [2019-05-23 09:23:20,968 INFO L146 ILogger]: Start accepts. Automaton has 297 states and 300 transitions. Word has length 292 [2019-05-23 09:23:20,968 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:20,968 INFO L146 ILogger]: Abstraction has 297 states and 300 transitions. [2019-05-23 09:23:20,968 INFO L146 ILogger]: Interpolant automaton has 54 states. [2019-05-23 09:23:20,968 INFO L146 ILogger]: Start isEmpty. Operand 297 states and 300 transitions. [2019-05-23 09:23:20,970 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 297 [2019-05-23 09:23:20,970 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:20,970 INFO L146 ILogger]: trace histogram [26, 26, 26, 26, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:20,970 INFO L146 ILogger]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:20,970 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:20,971 INFO L146 ILogger]: Analyzing trace with hash -1220566899, now seen corresponding path program 26 times [2019-05-23 09:23:20,971 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:21,009 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:21,015 INFO L146 ILogger]: Trace formula consists of 444 conjuncts, 110 conjunts are in the unsatisfiable core [2019-05-23 09:23:21,019 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:23,078 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:23:23,079 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:23,080 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:23,080 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:23,080 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:23:23,159 INFO L146 ILogger]: Checked inductivity of 2022 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:23:23,159 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:23,159 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-05-23 09:23:23,160 INFO L146 ILogger]: Interpolant automaton has 56 states [2019-05-23 09:23:23,160 INFO L146 ILogger]: Constructing interpolant automaton starting with 56 interpolants. [2019-05-23 09:23:23,160 INFO L146 ILogger]: CoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 09:23:23,160 INFO L146 ILogger]: Start difference. First operand 297 states and 300 transitions. Second operand 56 states. [2019-05-23 09:23:27,569 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:27,570 INFO L146 ILogger]: Finished difference Result 306 states and 309 transitions. [2019-05-23 09:23:27,570 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-05-23 09:23:27,570 INFO L146 ILogger]: Start accepts. Automaton has 56 states. Word has length 296 [2019-05-23 09:23:27,571 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:27,572 INFO L146 ILogger]: With dead ends: 306 [2019-05-23 09:23:27,572 INFO L146 ILogger]: Without dead ends: 303 [2019-05-23 09:23:27,572 INFO L146 ILogger]: 0 DeclaredPredicates, 347 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=318, Invalid=11238, Unknown=0, NotChecked=0, Total=11556 [2019-05-23 09:23:27,573 INFO L146 ILogger]: Start minimizeSevpa. Operand 303 states. [2019-05-23 09:23:27,574 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 303 to 301. [2019-05-23 09:23:27,574 INFO L146 ILogger]: Start removeUnreachable. Operand 301 states. [2019-05-23 09:23:27,575 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 301 states to 301 states and 304 transitions. [2019-05-23 09:23:27,575 INFO L146 ILogger]: Start accepts. Automaton has 301 states and 304 transitions. Word has length 296 [2019-05-23 09:23:27,575 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:27,575 INFO L146 ILogger]: Abstraction has 301 states and 304 transitions. [2019-05-23 09:23:27,575 INFO L146 ILogger]: Interpolant automaton has 56 states. [2019-05-23 09:23:27,575 INFO L146 ILogger]: Start isEmpty. Operand 301 states and 304 transitions. [2019-05-23 09:23:27,576 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 301 [2019-05-23 09:23:27,576 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:27,576 INFO L146 ILogger]: trace histogram [27, 27, 27, 27, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:27,577 INFO L146 ILogger]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:27,577 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:27,577 INFO L146 ILogger]: Analyzing trace with hash -826404149, now seen corresponding path program 27 times [2019-05-23 09:23:27,577 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:27,617 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:27,622 INFO L146 ILogger]: Trace formula consists of 450 conjuncts, 114 conjunts are in the unsatisfiable core [2019-05-23 09:23:27,626 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:28,936 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:23:28,937 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:28,939 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:28,939 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:28,940 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:23:29,029 INFO L146 ILogger]: Checked inductivity of 2127 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:23:29,030 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:29,030 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-05-23 09:23:29,030 INFO L146 ILogger]: Interpolant automaton has 58 states [2019-05-23 09:23:29,030 INFO L146 ILogger]: Constructing interpolant automaton starting with 58 interpolants. [2019-05-23 09:23:29,030 INFO L146 ILogger]: CoverageRelationStatistics Valid=114, Invalid=3192, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 09:23:29,031 INFO L146 ILogger]: Start difference. First operand 301 states and 304 transitions. Second operand 58 states. [2019-05-23 09:23:33,826 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:33,826 INFO L146 ILogger]: Finished difference Result 310 states and 313 transitions. [2019-05-23 09:23:33,826 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-05-23 09:23:33,826 INFO L146 ILogger]: Start accepts. Automaton has 58 states. Word has length 300 [2019-05-23 09:23:33,827 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:33,827 INFO L146 ILogger]: With dead ends: 310 [2019-05-23 09:23:33,827 INFO L146 ILogger]: Without dead ends: 307 [2019-05-23 09:23:33,828 INFO L146 ILogger]: 0 DeclaredPredicates, 353 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=330, Invalid=12102, Unknown=0, NotChecked=0, Total=12432 [2019-05-23 09:23:33,829 INFO L146 ILogger]: Start minimizeSevpa. Operand 307 states. [2019-05-23 09:23:33,831 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-05-23 09:23:33,831 INFO L146 ILogger]: Start removeUnreachable. Operand 305 states. [2019-05-23 09:23:33,831 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 305 states to 305 states and 308 transitions. [2019-05-23 09:23:33,832 INFO L146 ILogger]: Start accepts. Automaton has 305 states and 308 transitions. Word has length 300 [2019-05-23 09:23:33,832 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:33,832 INFO L146 ILogger]: Abstraction has 305 states and 308 transitions. [2019-05-23 09:23:33,832 INFO L146 ILogger]: Interpolant automaton has 58 states. [2019-05-23 09:23:33,832 INFO L146 ILogger]: Start isEmpty. Operand 305 states and 308 transitions. [2019-05-23 09:23:33,833 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 305 [2019-05-23 09:23:33,833 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:33,834 INFO L146 ILogger]: trace histogram [28, 28, 28, 28, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:33,834 INFO L146 ILogger]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:33,834 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:33,834 INFO L146 ILogger]: Analyzing trace with hash 1092433417, now seen corresponding path program 28 times [2019-05-23 09:23:33,835 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:33,886 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:33,891 INFO L146 ILogger]: Trace formula consists of 456 conjuncts, 118 conjunts are in the unsatisfiable core [2019-05-23 09:23:33,895 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:35,680 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:23:35,680 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:35,681 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:35,681 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:35,682 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:23:35,775 INFO L146 ILogger]: Checked inductivity of 2236 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:23:35,775 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:35,776 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-05-23 09:23:35,776 INFO L146 ILogger]: Interpolant automaton has 60 states [2019-05-23 09:23:35,776 INFO L146 ILogger]: Constructing interpolant automaton starting with 60 interpolants. [2019-05-23 09:23:35,776 INFO L146 ILogger]: CoverageRelationStatistics Valid=118, Invalid=3422, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 09:23:35,777 INFO L146 ILogger]: Start difference. First operand 305 states and 308 transitions. Second operand 60 states. [2019-05-23 09:23:40,971 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:40,971 INFO L146 ILogger]: Finished difference Result 314 states and 317 transitions. [2019-05-23 09:23:40,973 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-05-23 09:23:40,973 INFO L146 ILogger]: Start accepts. Automaton has 60 states. Word has length 304 [2019-05-23 09:23:40,973 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:40,974 INFO L146 ILogger]: With dead ends: 314 [2019-05-23 09:23:40,974 INFO L146 ILogger]: Without dead ends: 311 [2019-05-23 09:23:40,975 INFO L146 ILogger]: 0 DeclaredPredicates, 359 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=342, Invalid=12998, Unknown=0, NotChecked=0, Total=13340 [2019-05-23 09:23:40,975 INFO L146 ILogger]: Start minimizeSevpa. Operand 311 states. [2019-05-23 09:23:40,977 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 311 to 309. [2019-05-23 09:23:40,977 INFO L146 ILogger]: Start removeUnreachable. Operand 309 states. [2019-05-23 09:23:40,978 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 309 states to 309 states and 312 transitions. [2019-05-23 09:23:40,978 INFO L146 ILogger]: Start accepts. Automaton has 309 states and 312 transitions. Word has length 304 [2019-05-23 09:23:40,978 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:40,978 INFO L146 ILogger]: Abstraction has 309 states and 312 transitions. [2019-05-23 09:23:40,978 INFO L146 ILogger]: Interpolant automaton has 60 states. [2019-05-23 09:23:40,979 INFO L146 ILogger]: Start isEmpty. Operand 309 states and 312 transitions. [2019-05-23 09:23:40,980 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 309 [2019-05-23 09:23:40,980 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:40,980 INFO L146 ILogger]: trace histogram [29, 29, 29, 29, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:40,980 INFO L146 ILogger]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:40,981 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:40,981 INFO L146 ILogger]: Analyzing trace with hash 1553762887, now seen corresponding path program 29 times [2019-05-23 09:23:40,981 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:41,023 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:41,029 INFO L146 ILogger]: Trace formula consists of 462 conjuncts, 122 conjunts are in the unsatisfiable core [2019-05-23 09:23:41,034 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:42,519 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:23:42,519 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:42,520 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:42,520 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:42,520 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:23:42,606 INFO L146 ILogger]: Checked inductivity of 2349 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:23:42,607 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:42,607 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-05-23 09:23:42,607 INFO L146 ILogger]: Interpolant automaton has 62 states [2019-05-23 09:23:42,607 INFO L146 ILogger]: Constructing interpolant automaton starting with 62 interpolants. [2019-05-23 09:23:42,608 INFO L146 ILogger]: CoverageRelationStatistics Valid=122, Invalid=3660, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 09:23:42,608 INFO L146 ILogger]: Start difference. First operand 309 states and 312 transitions. Second operand 62 states. [2019-05-23 09:23:48,309 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:48,309 INFO L146 ILogger]: Finished difference Result 318 states and 321 transitions. [2019-05-23 09:23:48,310 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-05-23 09:23:48,310 INFO L146 ILogger]: Start accepts. Automaton has 62 states. Word has length 308 [2019-05-23 09:23:48,310 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:48,311 INFO L146 ILogger]: With dead ends: 318 [2019-05-23 09:23:48,311 INFO L146 ILogger]: Without dead ends: 315 [2019-05-23 09:23:48,312 INFO L146 ILogger]: 0 DeclaredPredicates, 365 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=354, Invalid=13926, Unknown=0, NotChecked=0, Total=14280 [2019-05-23 09:23:48,312 INFO L146 ILogger]: Start minimizeSevpa. Operand 315 states. [2019-05-23 09:23:48,314 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 315 to 313. [2019-05-23 09:23:48,314 INFO L146 ILogger]: Start removeUnreachable. Operand 313 states. [2019-05-23 09:23:48,315 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 313 states to 313 states and 316 transitions. [2019-05-23 09:23:48,315 INFO L146 ILogger]: Start accepts. Automaton has 313 states and 316 transitions. Word has length 308 [2019-05-23 09:23:48,315 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:48,315 INFO L146 ILogger]: Abstraction has 313 states and 316 transitions. [2019-05-23 09:23:48,315 INFO L146 ILogger]: Interpolant automaton has 62 states. [2019-05-23 09:23:48,315 INFO L146 ILogger]: Start isEmpty. Operand 313 states and 316 transitions. [2019-05-23 09:23:48,316 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 313 [2019-05-23 09:23:48,316 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:48,317 INFO L146 ILogger]: trace histogram [30, 30, 30, 30, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:48,317 INFO L146 ILogger]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:48,317 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:48,317 INFO L146 ILogger]: Analyzing trace with hash 1136365445, now seen corresponding path program 30 times [2019-05-23 09:23:48,318 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:48,361 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:48,366 INFO L146 ILogger]: Trace formula consists of 468 conjuncts, 126 conjunts are in the unsatisfiable core [2019-05-23 09:23:48,370 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:49,895 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:23:49,896 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:49,922 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:49,922 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:49,922 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:23:50,016 INFO L146 ILogger]: Checked inductivity of 2466 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:23:50,016 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:50,016 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-05-23 09:23:50,017 INFO L146 ILogger]: Interpolant automaton has 64 states [2019-05-23 09:23:50,017 INFO L146 ILogger]: Constructing interpolant automaton starting with 64 interpolants. [2019-05-23 09:23:50,017 INFO L146 ILogger]: CoverageRelationStatistics Valid=126, Invalid=3906, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 09:23:50,018 INFO L146 ILogger]: Start difference. First operand 313 states and 316 transitions. Second operand 64 states. [2019-05-23 09:23:55,944 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:55,944 INFO L146 ILogger]: Finished difference Result 322 states and 325 transitions. [2019-05-23 09:23:55,944 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-05-23 09:23:55,944 INFO L146 ILogger]: Start accepts. Automaton has 64 states. Word has length 312 [2019-05-23 09:23:55,945 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:55,946 INFO L146 ILogger]: With dead ends: 322 [2019-05-23 09:23:55,946 INFO L146 ILogger]: Without dead ends: 319 [2019-05-23 09:23:55,947 INFO L146 ILogger]: 0 DeclaredPredicates, 371 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=366, Invalid=14886, Unknown=0, NotChecked=0, Total=15252 [2019-05-23 09:23:55,947 INFO L146 ILogger]: Start minimizeSevpa. Operand 319 states. [2019-05-23 09:23:55,949 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 319 to 317. [2019-05-23 09:23:55,949 INFO L146 ILogger]: Start removeUnreachable. Operand 317 states. [2019-05-23 09:23:55,949 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 317 states to 317 states and 320 transitions. [2019-05-23 09:23:55,949 INFO L146 ILogger]: Start accepts. Automaton has 317 states and 320 transitions. Word has length 312 [2019-05-23 09:23:55,949 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:55,950 INFO L146 ILogger]: Abstraction has 317 states and 320 transitions. [2019-05-23 09:23:55,950 INFO L146 ILogger]: Interpolant automaton has 64 states. [2019-05-23 09:23:55,950 INFO L146 ILogger]: Start isEmpty. Operand 317 states and 320 transitions. [2019-05-23 09:23:55,951 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 317 [2019-05-23 09:23:55,951 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:55,951 INFO L146 ILogger]: trace histogram [31, 31, 31, 31, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:55,952 INFO L146 ILogger]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:55,952 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:55,952 INFO L146 ILogger]: Analyzing trace with hash -851851837, now seen corresponding path program 31 times [2019-05-23 09:23:55,952 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:55,993 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:56,000 INFO L146 ILogger]: Trace formula consists of 474 conjuncts, 130 conjunts are in the unsatisfiable core [2019-05-23 09:23:56,004 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:57,576 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:23:57,576 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:57,577 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:57,577 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:57,578 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:23:57,669 INFO L146 ILogger]: Checked inductivity of 2587 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:23:57,669 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:57,670 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-05-23 09:23:57,670 INFO L146 ILogger]: Interpolant automaton has 66 states [2019-05-23 09:23:57,670 INFO L146 ILogger]: Constructing interpolant automaton starting with 66 interpolants. [2019-05-23 09:23:57,670 INFO L146 ILogger]: CoverageRelationStatistics Valid=130, Invalid=4160, Unknown=0, NotChecked=0, Total=4290 [2019-05-23 09:23:57,670 INFO L146 ILogger]: Start difference. First operand 317 states and 320 transitions. Second operand 66 states. [2019-05-23 09:24:04,191 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:04,191 INFO L146 ILogger]: Finished difference Result 326 states and 329 transitions. [2019-05-23 09:24:04,191 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-05-23 09:24:04,192 INFO L146 ILogger]: Start accepts. Automaton has 66 states. Word has length 316 [2019-05-23 09:24:04,192 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:04,193 INFO L146 ILogger]: With dead ends: 326 [2019-05-23 09:24:04,193 INFO L146 ILogger]: Without dead ends: 323 [2019-05-23 09:24:04,194 INFO L146 ILogger]: 0 DeclaredPredicates, 377 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=378, Invalid=15878, Unknown=0, NotChecked=0, Total=16256 [2019-05-23 09:24:04,194 INFO L146 ILogger]: Start minimizeSevpa. Operand 323 states. [2019-05-23 09:24:04,197 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 323 to 321. [2019-05-23 09:24:04,197 INFO L146 ILogger]: Start removeUnreachable. Operand 321 states. [2019-05-23 09:24:04,198 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 321 states to 321 states and 324 transitions. [2019-05-23 09:24:04,198 INFO L146 ILogger]: Start accepts. Automaton has 321 states and 324 transitions. Word has length 316 [2019-05-23 09:24:04,198 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:04,198 INFO L146 ILogger]: Abstraction has 321 states and 324 transitions. [2019-05-23 09:24:04,198 INFO L146 ILogger]: Interpolant automaton has 66 states. [2019-05-23 09:24:04,198 INFO L146 ILogger]: Start isEmpty. Operand 321 states and 324 transitions. [2019-05-23 09:24:04,199 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 321 [2019-05-23 09:24:04,200 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:04,200 INFO L146 ILogger]: trace histogram [32, 32, 32, 32, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:04,200 INFO L146 ILogger]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:04,200 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:04,200 INFO L146 ILogger]: Analyzing trace with hash 1679207681, now seen corresponding path program 32 times [2019-05-23 09:24:04,201 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:04,243 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:04,249 INFO L146 ILogger]: Trace formula consists of 480 conjuncts, 134 conjunts are in the unsatisfiable core [2019-05-23 09:24:04,254 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:06,966 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:24:06,966 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:06,967 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:06,967 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:06,968 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:24:07,074 INFO L146 ILogger]: Checked inductivity of 2712 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:24:07,074 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:07,075 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-05-23 09:24:07,075 INFO L146 ILogger]: Interpolant automaton has 68 states [2019-05-23 09:24:07,075 INFO L146 ILogger]: Constructing interpolant automaton starting with 68 interpolants. [2019-05-23 09:24:07,076 INFO L146 ILogger]: CoverageRelationStatistics Valid=134, Invalid=4422, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 09:24:07,076 INFO L146 ILogger]: Start difference. First operand 321 states and 324 transitions. Second operand 68 states. [2019-05-23 09:24:14,079 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:14,080 INFO L146 ILogger]: Finished difference Result 330 states and 333 transitions. [2019-05-23 09:24:14,080 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-05-23 09:24:14,080 INFO L146 ILogger]: Start accepts. Automaton has 68 states. Word has length 320 [2019-05-23 09:24:14,080 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:14,081 INFO L146 ILogger]: With dead ends: 330 [2019-05-23 09:24:14,081 INFO L146 ILogger]: Without dead ends: 327 [2019-05-23 09:24:14,082 INFO L146 ILogger]: 0 DeclaredPredicates, 383 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=390, Invalid=16902, Unknown=0, NotChecked=0, Total=17292 [2019-05-23 09:24:14,082 INFO L146 ILogger]: Start minimizeSevpa. Operand 327 states. [2019-05-23 09:24:14,084 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 327 to 325. [2019-05-23 09:24:14,084 INFO L146 ILogger]: Start removeUnreachable. Operand 325 states. [2019-05-23 09:24:14,085 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 325 states to 325 states and 328 transitions. [2019-05-23 09:24:14,085 INFO L146 ILogger]: Start accepts. Automaton has 325 states and 328 transitions. Word has length 320 [2019-05-23 09:24:14,085 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:14,085 INFO L146 ILogger]: Abstraction has 325 states and 328 transitions. [2019-05-23 09:24:14,085 INFO L146 ILogger]: Interpolant automaton has 68 states. [2019-05-23 09:24:14,085 INFO L146 ILogger]: Start isEmpty. Operand 325 states and 328 transitions. [2019-05-23 09:24:14,086 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 325 [2019-05-23 09:24:14,086 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:14,086 INFO L146 ILogger]: trace histogram [33, 33, 33, 33, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:14,087 INFO L146 ILogger]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:14,087 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:14,087 INFO L146 ILogger]: Analyzing trace with hash -409877185, now seen corresponding path program 33 times [2019-05-23 09:24:14,087 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:14,130 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:14,137 INFO L146 ILogger]: Trace formula consists of 486 conjuncts, 138 conjunts are in the unsatisfiable core [2019-05-23 09:24:14,141 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:16,074 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:24:16,075 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:16,076 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:16,077 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:16,077 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:24:16,180 INFO L146 ILogger]: Checked inductivity of 2841 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:24:16,180 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:16,180 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-05-23 09:24:16,181 INFO L146 ILogger]: Interpolant automaton has 70 states [2019-05-23 09:24:16,181 INFO L146 ILogger]: Constructing interpolant automaton starting with 70 interpolants. [2019-05-23 09:24:16,181 INFO L146 ILogger]: CoverageRelationStatistics Valid=138, Invalid=4692, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 09:24:16,181 INFO L146 ILogger]: Start difference. First operand 325 states and 328 transitions. Second operand 70 states. [2019-05-23 09:24:23,294 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:23,294 INFO L146 ILogger]: Finished difference Result 334 states and 337 transitions. [2019-05-23 09:24:23,294 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-05-23 09:24:23,294 INFO L146 ILogger]: Start accepts. Automaton has 70 states. Word has length 324 [2019-05-23 09:24:23,295 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:23,295 INFO L146 ILogger]: With dead ends: 334 [2019-05-23 09:24:23,295 INFO L146 ILogger]: Without dead ends: 331 [2019-05-23 09:24:23,296 INFO L146 ILogger]: 0 DeclaredPredicates, 389 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=402, Invalid=17958, Unknown=0, NotChecked=0, Total=18360 [2019-05-23 09:24:23,297 INFO L146 ILogger]: Start minimizeSevpa. Operand 331 states. [2019-05-23 09:24:23,299 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 331 to 329. [2019-05-23 09:24:23,299 INFO L146 ILogger]: Start removeUnreachable. Operand 329 states. [2019-05-23 09:24:23,300 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 329 states to 329 states and 332 transitions. [2019-05-23 09:24:23,300 INFO L146 ILogger]: Start accepts. Automaton has 329 states and 332 transitions. Word has length 324 [2019-05-23 09:24:23,300 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:23,300 INFO L146 ILogger]: Abstraction has 329 states and 332 transitions. [2019-05-23 09:24:23,300 INFO L146 ILogger]: Interpolant automaton has 70 states. [2019-05-23 09:24:23,300 INFO L146 ILogger]: Start isEmpty. Operand 329 states and 332 transitions. [2019-05-23 09:24:23,301 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 329 [2019-05-23 09:24:23,301 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:23,301 INFO L146 ILogger]: trace histogram [34, 34, 34, 34, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:23,301 INFO L146 ILogger]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:23,302 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:23,302 INFO L146 ILogger]: Analyzing trace with hash -1960145283, now seen corresponding path program 34 times [2019-05-23 09:24:23,302 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:23,358 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:23,363 INFO L146 ILogger]: Trace formula consists of 492 conjuncts, 142 conjunts are in the unsatisfiable core [2019-05-23 09:24:23,367 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:25,755 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:24:25,755 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:25,756 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:25,756 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:25,757 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:24:25,871 INFO L146 ILogger]: Checked inductivity of 2974 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:24:25,872 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:25,872 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-05-23 09:24:25,872 INFO L146 ILogger]: Interpolant automaton has 72 states [2019-05-23 09:24:25,872 INFO L146 ILogger]: Constructing interpolant automaton starting with 72 interpolants. [2019-05-23 09:24:25,873 INFO L146 ILogger]: CoverageRelationStatistics Valid=142, Invalid=4970, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 09:24:25,873 INFO L146 ILogger]: Start difference. First operand 329 states and 332 transitions. Second operand 72 states. [2019-05-23 09:24:33,402 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:33,402 INFO L146 ILogger]: Finished difference Result 338 states and 341 transitions. [2019-05-23 09:24:33,402 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-05-23 09:24:33,403 INFO L146 ILogger]: Start accepts. Automaton has 72 states. Word has length 328 [2019-05-23 09:24:33,403 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:33,404 INFO L146 ILogger]: With dead ends: 338 [2019-05-23 09:24:33,404 INFO L146 ILogger]: Without dead ends: 335 [2019-05-23 09:24:33,405 INFO L146 ILogger]: 0 DeclaredPredicates, 395 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2345 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=414, Invalid=19046, Unknown=0, NotChecked=0, Total=19460 [2019-05-23 09:24:33,405 INFO L146 ILogger]: Start minimizeSevpa. Operand 335 states. [2019-05-23 09:24:33,407 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 335 to 333. [2019-05-23 09:24:33,407 INFO L146 ILogger]: Start removeUnreachable. Operand 333 states. [2019-05-23 09:24:33,408 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 333 states to 333 states and 336 transitions. [2019-05-23 09:24:33,408 INFO L146 ILogger]: Start accepts. Automaton has 333 states and 336 transitions. Word has length 328 [2019-05-23 09:24:33,408 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:33,408 INFO L146 ILogger]: Abstraction has 333 states and 336 transitions. [2019-05-23 09:24:33,409 INFO L146 ILogger]: Interpolant automaton has 72 states. [2019-05-23 09:24:33,409 INFO L146 ILogger]: Start isEmpty. Operand 333 states and 336 transitions. [2019-05-23 09:24:33,410 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 333 [2019-05-23 09:24:33,410 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:33,410 INFO L146 ILogger]: trace histogram [35, 35, 35, 35, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:33,410 INFO L146 ILogger]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:33,410 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:33,410 INFO L146 ILogger]: Analyzing trace with hash -1230993221, now seen corresponding path program 35 times [2019-05-23 09:24:33,411 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:33,454 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:33,461 INFO L146 ILogger]: Trace formula consists of 498 conjuncts, 146 conjunts are in the unsatisfiable core [2019-05-23 09:24:33,465 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:36,107 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:24:36,107 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:36,108 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:36,108 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:36,108 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:24:36,221 INFO L146 ILogger]: Checked inductivity of 3111 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:24:36,221 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:36,221 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-05-23 09:24:36,222 INFO L146 ILogger]: Interpolant automaton has 74 states [2019-05-23 09:24:36,222 INFO L146 ILogger]: Constructing interpolant automaton starting with 74 interpolants. [2019-05-23 09:24:36,222 INFO L146 ILogger]: CoverageRelationStatistics Valid=146, Invalid=5256, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 09:24:36,222 INFO L146 ILogger]: Start difference. First operand 333 states and 336 transitions. Second operand 74 states. [2019-05-23 09:24:44,261 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:44,261 INFO L146 ILogger]: Finished difference Result 342 states and 345 transitions. [2019-05-23 09:24:44,262 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-05-23 09:24:44,262 INFO L146 ILogger]: Start accepts. Automaton has 74 states. Word has length 332 [2019-05-23 09:24:44,262 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:44,263 INFO L146 ILogger]: With dead ends: 342 [2019-05-23 09:24:44,263 INFO L146 ILogger]: Without dead ends: 339 [2019-05-23 09:24:44,264 INFO L146 ILogger]: 0 DeclaredPredicates, 401 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2484 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=426, Invalid=20166, Unknown=0, NotChecked=0, Total=20592 [2019-05-23 09:24:44,264 INFO L146 ILogger]: Start minimizeSevpa. Operand 339 states. [2019-05-23 09:24:44,267 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 339 to 337. [2019-05-23 09:24:44,268 INFO L146 ILogger]: Start removeUnreachable. Operand 337 states. [2019-05-23 09:24:44,268 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 337 states to 337 states and 340 transitions. [2019-05-23 09:24:44,268 INFO L146 ILogger]: Start accepts. Automaton has 337 states and 340 transitions. Word has length 332 [2019-05-23 09:24:44,268 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:44,268 INFO L146 ILogger]: Abstraction has 337 states and 340 transitions. [2019-05-23 09:24:44,268 INFO L146 ILogger]: Interpolant automaton has 74 states. [2019-05-23 09:24:44,268 INFO L146 ILogger]: Start isEmpty. Operand 337 states and 340 transitions. [2019-05-23 09:24:44,270 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 337 [2019-05-23 09:24:44,270 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:44,270 INFO L146 ILogger]: trace histogram [36, 36, 36, 36, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:44,270 INFO L146 ILogger]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:44,271 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:44,271 INFO L146 ILogger]: Analyzing trace with hash -437046279, now seen corresponding path program 36 times [2019-05-23 09:24:44,271 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:44,317 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:44,323 INFO L146 ILogger]: Trace formula consists of 504 conjuncts, 150 conjunts are in the unsatisfiable core [2019-05-23 09:24:44,327 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:46,612 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:24:46,612 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:46,613 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:46,614 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:46,614 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:24:46,723 INFO L146 ILogger]: Checked inductivity of 3252 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:24:46,723 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:46,723 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-05-23 09:24:46,724 INFO L146 ILogger]: Interpolant automaton has 76 states [2019-05-23 09:24:46,724 INFO L146 ILogger]: Constructing interpolant automaton starting with 76 interpolants. [2019-05-23 09:24:46,724 INFO L146 ILogger]: CoverageRelationStatistics Valid=150, Invalid=5550, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 09:24:46,724 INFO L146 ILogger]: Start difference. First operand 337 states and 340 transitions. Second operand 76 states. [2019-05-23 09:24:55,400 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:55,400 INFO L146 ILogger]: Finished difference Result 346 states and 349 transitions. [2019-05-23 09:24:55,401 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-05-23 09:24:55,401 INFO L146 ILogger]: Start accepts. Automaton has 76 states. Word has length 336 [2019-05-23 09:24:55,401 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:55,402 INFO L146 ILogger]: With dead ends: 346 [2019-05-23 09:24:55,402 INFO L146 ILogger]: Without dead ends: 343 [2019-05-23 09:24:55,403 INFO L146 ILogger]: 0 DeclaredPredicates, 407 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2627 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=438, Invalid=21318, Unknown=0, NotChecked=0, Total=21756 [2019-05-23 09:24:55,403 INFO L146 ILogger]: Start minimizeSevpa. Operand 343 states. [2019-05-23 09:24:55,405 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 343 to 341. [2019-05-23 09:24:55,405 INFO L146 ILogger]: Start removeUnreachable. Operand 341 states. [2019-05-23 09:24:55,405 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 341 states to 341 states and 344 transitions. [2019-05-23 09:24:55,405 INFO L146 ILogger]: Start accepts. Automaton has 341 states and 344 transitions. Word has length 336 [2019-05-23 09:24:55,406 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:55,406 INFO L146 ILogger]: Abstraction has 341 states and 344 transitions. [2019-05-23 09:24:55,406 INFO L146 ILogger]: Interpolant automaton has 76 states. [2019-05-23 09:24:55,406 INFO L146 ILogger]: Start isEmpty. Operand 341 states and 344 transitions. [2019-05-23 09:24:55,407 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 341 [2019-05-23 09:24:55,407 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:55,407 INFO L146 ILogger]: trace histogram [37, 37, 37, 37, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:55,407 INFO L146 ILogger]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:55,408 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:55,408 INFO L146 ILogger]: Analyzing trace with hash -1990062025, now seen corresponding path program 37 times [2019-05-23 09:24:55,408 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:55,457 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:55,464 INFO L146 ILogger]: Trace formula consists of 510 conjuncts, 154 conjunts are in the unsatisfiable core [2019-05-23 09:24:55,467 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:58,052 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:24:58,053 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:58,058 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:58,058 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:58,058 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:24:58,169 INFO L146 ILogger]: Checked inductivity of 3397 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:24:58,170 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:58,170 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-05-23 09:24:58,170 INFO L146 ILogger]: Interpolant automaton has 78 states [2019-05-23 09:24:58,170 INFO L146 ILogger]: Constructing interpolant automaton starting with 78 interpolants. [2019-05-23 09:24:58,171 INFO L146 ILogger]: CoverageRelationStatistics Valid=154, Invalid=5852, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 09:24:58,171 INFO L146 ILogger]: Start difference. First operand 341 states and 344 transitions. Second operand 78 states. [2019-05-23 09:25:07,519 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:07,520 INFO L146 ILogger]: Finished difference Result 350 states and 353 transitions. [2019-05-23 09:25:07,520 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-05-23 09:25:07,520 INFO L146 ILogger]: Start accepts. Automaton has 78 states. Word has length 340 [2019-05-23 09:25:07,520 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:07,521 INFO L146 ILogger]: With dead ends: 350 [2019-05-23 09:25:07,521 INFO L146 ILogger]: Without dead ends: 347 [2019-05-23 09:25:07,522 INFO L146 ILogger]: 0 DeclaredPredicates, 413 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2774 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=450, Invalid=22502, Unknown=0, NotChecked=0, Total=22952 [2019-05-23 09:25:07,523 INFO L146 ILogger]: Start minimizeSevpa. Operand 347 states. [2019-05-23 09:25:07,525 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 347 to 345. [2019-05-23 09:25:07,525 INFO L146 ILogger]: Start removeUnreachable. Operand 345 states. [2019-05-23 09:25:07,525 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 345 states to 345 states and 348 transitions. [2019-05-23 09:25:07,525 INFO L146 ILogger]: Start accepts. Automaton has 345 states and 348 transitions. Word has length 340 [2019-05-23 09:25:07,525 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:07,525 INFO L146 ILogger]: Abstraction has 345 states and 348 transitions. [2019-05-23 09:25:07,525 INFO L146 ILogger]: Interpolant automaton has 78 states. [2019-05-23 09:25:07,526 INFO L146 ILogger]: Start isEmpty. Operand 345 states and 348 transitions. [2019-05-23 09:25:07,527 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 345 [2019-05-23 09:25:07,527 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:07,527 INFO L146 ILogger]: trace histogram [38, 38, 38, 38, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:07,527 INFO L146 ILogger]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:07,527 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:07,527 INFO L146 ILogger]: Analyzing trace with hash -445866635, now seen corresponding path program 38 times [2019-05-23 09:25:07,528 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:07,571 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:07,579 INFO L146 ILogger]: Trace formula consists of 516 conjuncts, 158 conjunts are in the unsatisfiable core [2019-05-23 09:25:07,582 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:10,185 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:25:10,185 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:10,193 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:10,194 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:10,194 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:25:10,318 INFO L146 ILogger]: Checked inductivity of 3546 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:25:10,318 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:10,318 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-05-23 09:25:10,319 INFO L146 ILogger]: Interpolant automaton has 80 states [2019-05-23 09:25:10,319 INFO L146 ILogger]: Constructing interpolant automaton starting with 80 interpolants. [2019-05-23 09:25:10,319 INFO L146 ILogger]: CoverageRelationStatistics Valid=158, Invalid=6162, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 09:25:10,319 INFO L146 ILogger]: Start difference. First operand 345 states and 348 transitions. Second operand 80 states. [2019-05-23 09:25:19,574 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:19,575 INFO L146 ILogger]: Finished difference Result 354 states and 357 transitions. [2019-05-23 09:25:19,575 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-05-23 09:25:19,575 INFO L146 ILogger]: Start accepts. Automaton has 80 states. Word has length 344 [2019-05-23 09:25:19,575 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:19,576 INFO L146 ILogger]: With dead ends: 354 [2019-05-23 09:25:19,576 INFO L146 ILogger]: Without dead ends: 351 [2019-05-23 09:25:19,577 INFO L146 ILogger]: 0 DeclaredPredicates, 419 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2925 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=462, Invalid=23718, Unknown=0, NotChecked=0, Total=24180 [2019-05-23 09:25:19,577 INFO L146 ILogger]: Start minimizeSevpa. Operand 351 states. [2019-05-23 09:25:19,580 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-05-23 09:25:19,580 INFO L146 ILogger]: Start removeUnreachable. Operand 349 states. [2019-05-23 09:25:19,580 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 349 states to 349 states and 352 transitions. [2019-05-23 09:25:19,581 INFO L146 ILogger]: Start accepts. Automaton has 349 states and 352 transitions. Word has length 344 [2019-05-23 09:25:19,581 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:19,581 INFO L146 ILogger]: Abstraction has 349 states and 352 transitions. [2019-05-23 09:25:19,581 INFO L146 ILogger]: Interpolant automaton has 80 states. [2019-05-23 09:25:19,581 INFO L146 ILogger]: Start isEmpty. Operand 349 states and 352 transitions. [2019-05-23 09:25:19,582 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 349 [2019-05-23 09:25:19,582 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:19,582 INFO L146 ILogger]: trace histogram [39, 39, 39, 39, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:19,583 INFO L146 ILogger]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:19,583 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:19,583 INFO L146 ILogger]: Analyzing trace with hash -221094989, now seen corresponding path program 39 times [2019-05-23 09:25:19,583 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:19,635 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:19,642 INFO L146 ILogger]: Trace formula consists of 522 conjuncts, 162 conjunts are in the unsatisfiable core [2019-05-23 09:25:19,646 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:22,384 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:25:22,385 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:22,386 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:22,387 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:22,387 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:25:22,504 INFO L146 ILogger]: Checked inductivity of 3699 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:25:22,505 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:22,505 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-05-23 09:25:22,505 INFO L146 ILogger]: Interpolant automaton has 82 states [2019-05-23 09:25:22,505 INFO L146 ILogger]: Constructing interpolant automaton starting with 82 interpolants. [2019-05-23 09:25:22,506 INFO L146 ILogger]: CoverageRelationStatistics Valid=162, Invalid=6480, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 09:25:22,506 INFO L146 ILogger]: Start difference. First operand 349 states and 352 transitions. Second operand 82 states. [2019-05-23 09:25:32,427 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:32,427 INFO L146 ILogger]: Finished difference Result 358 states and 361 transitions. [2019-05-23 09:25:32,427 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-05-23 09:25:32,428 INFO L146 ILogger]: Start accepts. Automaton has 82 states. Word has length 348 [2019-05-23 09:25:32,428 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:32,429 INFO L146 ILogger]: With dead ends: 358 [2019-05-23 09:25:32,429 INFO L146 ILogger]: Without dead ends: 355 [2019-05-23 09:25:32,430 INFO L146 ILogger]: 0 DeclaredPredicates, 425 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=474, Invalid=24966, Unknown=0, NotChecked=0, Total=25440 [2019-05-23 09:25:32,430 INFO L146 ILogger]: Start minimizeSevpa. Operand 355 states. [2019-05-23 09:25:32,432 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 355 to 353. [2019-05-23 09:25:32,432 INFO L146 ILogger]: Start removeUnreachable. Operand 353 states. [2019-05-23 09:25:32,432 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 353 states to 353 states and 356 transitions. [2019-05-23 09:25:32,432 INFO L146 ILogger]: Start accepts. Automaton has 353 states and 356 transitions. Word has length 348 [2019-05-23 09:25:32,433 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:32,433 INFO L146 ILogger]: Abstraction has 353 states and 356 transitions. [2019-05-23 09:25:32,433 INFO L146 ILogger]: Interpolant automaton has 82 states. [2019-05-23 09:25:32,433 INFO L146 ILogger]: Start isEmpty. Operand 353 states and 356 transitions. [2019-05-23 09:25:32,434 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 353 [2019-05-23 09:25:32,434 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:32,434 INFO L146 ILogger]: trace histogram [40, 40, 40, 40, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:32,434 INFO L146 ILogger]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:32,435 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:32,435 INFO L146 ILogger]: Analyzing trace with hash 1049807601, now seen corresponding path program 40 times [2019-05-23 09:25:32,435 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:32,475 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:32,483 INFO L146 ILogger]: Trace formula consists of 528 conjuncts, 166 conjunts are in the unsatisfiable core [2019-05-23 09:25:32,487 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:35,601 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:25:35,601 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:35,612 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:35,612 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:35,612 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:25:35,839 INFO L146 ILogger]: Checked inductivity of 3856 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:25:35,839 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:35,840 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-05-23 09:25:35,840 INFO L146 ILogger]: Interpolant automaton has 84 states [2019-05-23 09:25:35,840 INFO L146 ILogger]: Constructing interpolant automaton starting with 84 interpolants. [2019-05-23 09:25:35,841 INFO L146 ILogger]: CoverageRelationStatistics Valid=166, Invalid=6806, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 09:25:35,841 INFO L146 ILogger]: Start difference. First operand 353 states and 356 transitions. Second operand 84 states. [2019-05-23 09:25:46,128 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:46,128 INFO L146 ILogger]: Finished difference Result 362 states and 365 transitions. [2019-05-23 09:25:46,128 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-05-23 09:25:46,128 INFO L146 ILogger]: Start accepts. Automaton has 84 states. Word has length 352 [2019-05-23 09:25:46,128 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:46,129 INFO L146 ILogger]: With dead ends: 362 [2019-05-23 09:25:46,130 INFO L146 ILogger]: Without dead ends: 359 [2019-05-23 09:25:46,131 INFO L146 ILogger]: 0 DeclaredPredicates, 431 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3239 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=486, Invalid=26246, Unknown=0, NotChecked=0, Total=26732 [2019-05-23 09:25:46,131 INFO L146 ILogger]: Start minimizeSevpa. Operand 359 states. [2019-05-23 09:25:46,134 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 359 to 357. [2019-05-23 09:25:46,134 INFO L146 ILogger]: Start removeUnreachable. Operand 357 states. [2019-05-23 09:25:46,134 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 357 states to 357 states and 360 transitions. [2019-05-23 09:25:46,135 INFO L146 ILogger]: Start accepts. Automaton has 357 states and 360 transitions. Word has length 352 [2019-05-23 09:25:46,135 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:46,135 INFO L146 ILogger]: Abstraction has 357 states and 360 transitions. [2019-05-23 09:25:46,135 INFO L146 ILogger]: Interpolant automaton has 84 states. [2019-05-23 09:25:46,135 INFO L146 ILogger]: Start isEmpty. Operand 357 states and 360 transitions. [2019-05-23 09:25:46,136 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 357 [2019-05-23 09:25:46,137 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:46,137 INFO L146 ILogger]: trace histogram [41, 41, 41, 41, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:46,137 INFO L146 ILogger]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:46,137 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:46,138 INFO L146 ILogger]: Analyzing trace with hash -907187409, now seen corresponding path program 41 times [2019-05-23 09:25:46,138 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:46,214 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:46,221 INFO L146 ILogger]: Trace formula consists of 534 conjuncts, 170 conjunts are in the unsatisfiable core [2019-05-23 09:25:46,226 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:49,102 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:25:49,102 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:49,103 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:49,103 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:49,104 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:25:49,223 INFO L146 ILogger]: Checked inductivity of 4017 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:25:49,223 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:49,223 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-05-23 09:25:49,223 INFO L146 ILogger]: Interpolant automaton has 86 states [2019-05-23 09:25:49,224 INFO L146 ILogger]: Constructing interpolant automaton starting with 86 interpolants. [2019-05-23 09:25:49,224 INFO L146 ILogger]: CoverageRelationStatistics Valid=170, Invalid=7140, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 09:25:49,224 INFO L146 ILogger]: Start difference. First operand 357 states and 360 transitions. Second operand 86 states. [2019-05-23 09:25:59,765 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:59,765 INFO L146 ILogger]: Finished difference Result 366 states and 369 transitions. [2019-05-23 09:25:59,765 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-05-23 09:25:59,765 INFO L146 ILogger]: Start accepts. Automaton has 86 states. Word has length 356 [2019-05-23 09:25:59,766 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:59,767 INFO L146 ILogger]: With dead ends: 366 [2019-05-23 09:25:59,767 INFO L146 ILogger]: Without dead ends: 363 [2019-05-23 09:25:59,768 INFO L146 ILogger]: 0 DeclaredPredicates, 437 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3402 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=498, Invalid=27558, Unknown=0, NotChecked=0, Total=28056 [2019-05-23 09:25:59,768 INFO L146 ILogger]: Start minimizeSevpa. Operand 363 states. [2019-05-23 09:25:59,770 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 363 to 361. [2019-05-23 09:25:59,770 INFO L146 ILogger]: Start removeUnreachable. Operand 361 states. [2019-05-23 09:25:59,770 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 361 states to 361 states and 364 transitions. [2019-05-23 09:25:59,770 INFO L146 ILogger]: Start accepts. Automaton has 361 states and 364 transitions. Word has length 356 [2019-05-23 09:25:59,771 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:59,771 INFO L146 ILogger]: Abstraction has 361 states and 364 transitions. [2019-05-23 09:25:59,771 INFO L146 ILogger]: Interpolant automaton has 86 states. [2019-05-23 09:25:59,771 INFO L146 ILogger]: Start isEmpty. Operand 361 states and 364 transitions. [2019-05-23 09:25:59,772 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 361 [2019-05-23 09:25:59,772 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:59,772 INFO L146 ILogger]: trace histogram [42, 42, 42, 42, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:59,772 INFO L146 ILogger]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:59,773 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:59,773 INFO L146 ILogger]: Analyzing trace with hash -362693523, now seen corresponding path program 42 times [2019-05-23 09:25:59,773 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:59,817 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:59,825 INFO L146 ILogger]: Trace formula consists of 540 conjuncts, 174 conjunts are in the unsatisfiable core [2019-05-23 09:25:59,829 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:02,840 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:26:02,841 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:02,842 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:02,842 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:02,842 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:26:03,024 INFO L146 ILogger]: Checked inductivity of 4182 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:26:03,025 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:03,025 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-05-23 09:26:03,025 INFO L146 ILogger]: Interpolant automaton has 88 states [2019-05-23 09:26:03,026 INFO L146 ILogger]: Constructing interpolant automaton starting with 88 interpolants. [2019-05-23 09:26:03,026 INFO L146 ILogger]: CoverageRelationStatistics Valid=174, Invalid=7482, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 09:26:03,026 INFO L146 ILogger]: Start difference. First operand 361 states and 364 transitions. Second operand 88 states. [2019-05-23 09:26:14,329 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:14,330 INFO L146 ILogger]: Finished difference Result 370 states and 373 transitions. [2019-05-23 09:26:14,330 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-05-23 09:26:14,330 INFO L146 ILogger]: Start accepts. Automaton has 88 states. Word has length 360 [2019-05-23 09:26:14,330 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:14,331 INFO L146 ILogger]: With dead ends: 370 [2019-05-23 09:26:14,331 INFO L146 ILogger]: Without dead ends: 367 [2019-05-23 09:26:14,332 INFO L146 ILogger]: 0 DeclaredPredicates, 443 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3569 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=510, Invalid=28902, Unknown=0, NotChecked=0, Total=29412 [2019-05-23 09:26:14,333 INFO L146 ILogger]: Start minimizeSevpa. Operand 367 states. [2019-05-23 09:26:14,335 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 367 to 365. [2019-05-23 09:26:14,335 INFO L146 ILogger]: Start removeUnreachable. Operand 365 states. [2019-05-23 09:26:14,335 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 365 states to 365 states and 368 transitions. [2019-05-23 09:26:14,335 INFO L146 ILogger]: Start accepts. Automaton has 365 states and 368 transitions. Word has length 360 [2019-05-23 09:26:14,336 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:14,336 INFO L146 ILogger]: Abstraction has 365 states and 368 transitions. [2019-05-23 09:26:14,336 INFO L146 ILogger]: Interpolant automaton has 88 states. [2019-05-23 09:26:14,336 INFO L146 ILogger]: Start isEmpty. Operand 365 states and 368 transitions. [2019-05-23 09:26:14,337 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 365 [2019-05-23 09:26:14,337 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:14,337 INFO L146 ILogger]: trace histogram [43, 43, 43, 43, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:14,337 INFO L146 ILogger]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:14,337 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:14,338 INFO L146 ILogger]: Analyzing trace with hash 699350699, now seen corresponding path program 43 times [2019-05-23 09:26:14,338 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:14,381 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:14,390 INFO L146 ILogger]: Trace formula consists of 546 conjuncts, 178 conjunts are in the unsatisfiable core [2019-05-23 09:26:14,393 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:17,552 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:26:17,552 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:17,555 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:17,555 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:17,555 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:26:17,697 INFO L146 ILogger]: Checked inductivity of 4351 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:26:17,697 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:17,697 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-05-23 09:26:17,698 INFO L146 ILogger]: Interpolant automaton has 90 states [2019-05-23 09:26:17,698 INFO L146 ILogger]: Constructing interpolant automaton starting with 90 interpolants. [2019-05-23 09:26:17,698 INFO L146 ILogger]: CoverageRelationStatistics Valid=178, Invalid=7832, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 09:26:17,699 INFO L146 ILogger]: Start difference. First operand 365 states and 368 transitions. Second operand 90 states. [2019-05-23 09:26:29,600 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:29,601 INFO L146 ILogger]: Finished difference Result 374 states and 377 transitions. [2019-05-23 09:26:29,601 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-05-23 09:26:29,601 INFO L146 ILogger]: Start accepts. Automaton has 90 states. Word has length 364 [2019-05-23 09:26:29,602 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:29,603 INFO L146 ILogger]: With dead ends: 374 [2019-05-23 09:26:29,603 INFO L146 ILogger]: Without dead ends: 371 [2019-05-23 09:26:29,605 INFO L146 ILogger]: 0 DeclaredPredicates, 449 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3740 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=522, Invalid=30278, Unknown=0, NotChecked=0, Total=30800 [2019-05-23 09:26:29,605 INFO L146 ILogger]: Start minimizeSevpa. Operand 371 states. [2019-05-23 09:26:29,607 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 371 to 369. [2019-05-23 09:26:29,607 INFO L146 ILogger]: Start removeUnreachable. Operand 369 states. [2019-05-23 09:26:29,607 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 369 states to 369 states and 372 transitions. [2019-05-23 09:26:29,607 INFO L146 ILogger]: Start accepts. Automaton has 369 states and 372 transitions. Word has length 364 [2019-05-23 09:26:29,608 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:29,608 INFO L146 ILogger]: Abstraction has 369 states and 372 transitions. [2019-05-23 09:26:29,608 INFO L146 ILogger]: Interpolant automaton has 90 states. [2019-05-23 09:26:29,608 INFO L146 ILogger]: Start isEmpty. Operand 369 states and 372 transitions. [2019-05-23 09:26:29,609 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 369 [2019-05-23 09:26:29,609 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:29,610 INFO L146 ILogger]: trace histogram [44, 44, 44, 44, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:29,610 INFO L146 ILogger]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:29,610 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:29,610 INFO L146 ILogger]: Analyzing trace with hash 634745321, now seen corresponding path program 44 times [2019-05-23 09:26:29,611 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:29,664 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:29,672 INFO L146 ILogger]: Trace formula consists of 552 conjuncts, 182 conjunts are in the unsatisfiable core [2019-05-23 09:26:29,675 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:33,435 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:26:33,435 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:33,436 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:33,437 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:33,437 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:26:33,564 INFO L146 ILogger]: Checked inductivity of 4524 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:26:33,565 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:33,565 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-05-23 09:26:33,566 INFO L146 ILogger]: Interpolant automaton has 92 states [2019-05-23 09:26:33,566 INFO L146 ILogger]: Constructing interpolant automaton starting with 92 interpolants. [2019-05-23 09:26:33,566 INFO L146 ILogger]: CoverageRelationStatistics Valid=182, Invalid=8190, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 09:26:33,567 INFO L146 ILogger]: Start difference. First operand 369 states and 372 transitions. Second operand 92 states. [2019-05-23 09:26:45,809 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:45,809 INFO L146 ILogger]: Finished difference Result 378 states and 381 transitions. [2019-05-23 09:26:45,810 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-05-23 09:26:45,810 INFO L146 ILogger]: Start accepts. Automaton has 92 states. Word has length 368 [2019-05-23 09:26:45,810 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:45,811 INFO L146 ILogger]: With dead ends: 378 [2019-05-23 09:26:45,811 INFO L146 ILogger]: Without dead ends: 375 [2019-05-23 09:26:45,812 INFO L146 ILogger]: 0 DeclaredPredicates, 455 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3915 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=534, Invalid=31686, Unknown=0, NotChecked=0, Total=32220 [2019-05-23 09:26:45,813 INFO L146 ILogger]: Start minimizeSevpa. Operand 375 states. [2019-05-23 09:26:45,815 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 375 to 373. [2019-05-23 09:26:45,815 INFO L146 ILogger]: Start removeUnreachable. Operand 373 states. [2019-05-23 09:26:45,815 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 373 states to 373 states and 376 transitions. [2019-05-23 09:26:45,815 INFO L146 ILogger]: Start accepts. Automaton has 373 states and 376 transitions. Word has length 368 [2019-05-23 09:26:45,816 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:45,816 INFO L146 ILogger]: Abstraction has 373 states and 376 transitions. [2019-05-23 09:26:45,816 INFO L146 ILogger]: Interpolant automaton has 92 states. [2019-05-23 09:26:45,816 INFO L146 ILogger]: Start isEmpty. Operand 373 states and 376 transitions. [2019-05-23 09:26:45,817 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 373 [2019-05-23 09:26:45,817 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:45,817 INFO L146 ILogger]: trace histogram [45, 45, 45, 45, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:45,818 INFO L146 ILogger]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:45,818 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:45,818 INFO L146 ILogger]: Analyzing trace with hash 1897125415, now seen corresponding path program 45 times [2019-05-23 09:26:45,818 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:45,875 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:45,885 INFO L146 ILogger]: Trace formula consists of 558 conjuncts, 186 conjunts are in the unsatisfiable core [2019-05-23 09:26:45,888 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:49,389 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:26:49,390 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:49,391 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:49,391 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:49,391 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:26:49,521 INFO L146 ILogger]: Checked inductivity of 4701 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:26:49,521 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:49,522 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-05-23 09:26:49,522 INFO L146 ILogger]: Interpolant automaton has 94 states [2019-05-23 09:26:49,522 INFO L146 ILogger]: Constructing interpolant automaton starting with 94 interpolants. [2019-05-23 09:26:49,523 INFO L146 ILogger]: CoverageRelationStatistics Valid=186, Invalid=8556, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 09:26:49,523 INFO L146 ILogger]: Start difference. First operand 373 states and 376 transitions. Second operand 94 states. [2019-05-23 09:27:02,443 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:02,443 INFO L146 ILogger]: Finished difference Result 382 states and 385 transitions. [2019-05-23 09:27:02,443 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-05-23 09:27:02,444 INFO L146 ILogger]: Start accepts. Automaton has 94 states. Word has length 372 [2019-05-23 09:27:02,444 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:02,445 INFO L146 ILogger]: With dead ends: 382 [2019-05-23 09:27:02,445 INFO L146 ILogger]: Without dead ends: 379 [2019-05-23 09:27:02,447 INFO L146 ILogger]: 0 DeclaredPredicates, 461 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4094 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=546, Invalid=33126, Unknown=0, NotChecked=0, Total=33672 [2019-05-23 09:27:02,447 INFO L146 ILogger]: Start minimizeSevpa. Operand 379 states. [2019-05-23 09:27:02,449 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 379 to 377. [2019-05-23 09:27:02,449 INFO L146 ILogger]: Start removeUnreachable. Operand 377 states. [2019-05-23 09:27:02,450 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 377 states to 377 states and 380 transitions. [2019-05-23 09:27:02,450 INFO L146 ILogger]: Start accepts. Automaton has 377 states and 380 transitions. Word has length 372 [2019-05-23 09:27:02,450 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:02,450 INFO L146 ILogger]: Abstraction has 377 states and 380 transitions. [2019-05-23 09:27:02,450 INFO L146 ILogger]: Interpolant automaton has 94 states. [2019-05-23 09:27:02,450 INFO L146 ILogger]: Start isEmpty. Operand 377 states and 380 transitions. [2019-05-23 09:27:02,451 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 377 [2019-05-23 09:27:02,451 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:02,452 INFO L146 ILogger]: trace histogram [46, 46, 46, 46, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:27:02,452 INFO L146 ILogger]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:02,452 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:02,452 INFO L146 ILogger]: Analyzing trace with hash 1911155557, now seen corresponding path program 46 times [2019-05-23 09:27:02,453 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:02,496 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:02,505 INFO L146 ILogger]: Trace formula consists of 564 conjuncts, 190 conjunts are in the unsatisfiable core [2019-05-23 09:27:02,508 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:06,035 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:27:06,036 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:06,037 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:06,037 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:06,037 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:27:06,214 INFO L146 ILogger]: Checked inductivity of 4882 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:27:06,215 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:06,215 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-05-23 09:27:06,215 INFO L146 ILogger]: Interpolant automaton has 96 states [2019-05-23 09:27:06,216 INFO L146 ILogger]: Constructing interpolant automaton starting with 96 interpolants. [2019-05-23 09:27:06,216 INFO L146 ILogger]: CoverageRelationStatistics Valid=190, Invalid=8930, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 09:27:06,216 INFO L146 ILogger]: Start difference. First operand 377 states and 380 transitions. Second operand 96 states. [2019-05-23 09:27:20,077 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:20,078 INFO L146 ILogger]: Finished difference Result 386 states and 389 transitions. [2019-05-23 09:27:20,078 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-05-23 09:27:20,078 INFO L146 ILogger]: Start accepts. Automaton has 96 states. Word has length 376 [2019-05-23 09:27:20,079 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:20,080 INFO L146 ILogger]: With dead ends: 386 [2019-05-23 09:27:20,080 INFO L146 ILogger]: Without dead ends: 383 [2019-05-23 09:27:20,082 INFO L146 ILogger]: 0 DeclaredPredicates, 467 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4277 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=558, Invalid=34598, Unknown=0, NotChecked=0, Total=35156 [2019-05-23 09:27:20,083 INFO L146 ILogger]: Start minimizeSevpa. Operand 383 states. [2019-05-23 09:27:20,085 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 383 to 381. [2019-05-23 09:27:20,085 INFO L146 ILogger]: Start removeUnreachable. Operand 381 states. [2019-05-23 09:27:20,086 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 381 states to 381 states and 384 transitions. [2019-05-23 09:27:20,086 INFO L146 ILogger]: Start accepts. Automaton has 381 states and 384 transitions. Word has length 376 [2019-05-23 09:27:20,086 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:20,086 INFO L146 ILogger]: Abstraction has 381 states and 384 transitions. [2019-05-23 09:27:20,086 INFO L146 ILogger]: Interpolant automaton has 96 states. [2019-05-23 09:27:20,086 INFO L146 ILogger]: Start isEmpty. Operand 381 states and 384 transitions. [2019-05-23 09:27:20,087 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 381 [2019-05-23 09:27:20,087 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:20,087 INFO L146 ILogger]: trace histogram [47, 47, 47, 47, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:27:20,088 INFO L146 ILogger]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:20,088 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:20,088 INFO L146 ILogger]: Analyzing trace with hash 1125593507, now seen corresponding path program 47 times [2019-05-23 09:27:20,088 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:20,131 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:20,141 INFO L146 ILogger]: Trace formula consists of 570 conjuncts, 194 conjunts are in the unsatisfiable core [2019-05-23 09:27:20,144 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:23,881 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:27:23,881 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:23,882 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:23,882 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:23,883 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:27:24,034 INFO L146 ILogger]: Checked inductivity of 5067 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:27:24,034 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:24,034 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-05-23 09:27:24,035 INFO L146 ILogger]: Interpolant automaton has 98 states [2019-05-23 09:27:24,035 INFO L146 ILogger]: Constructing interpolant automaton starting with 98 interpolants. [2019-05-23 09:27:24,035 INFO L146 ILogger]: CoverageRelationStatistics Valid=194, Invalid=9312, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 09:27:24,035 INFO L146 ILogger]: Start difference. First operand 381 states and 384 transitions. Second operand 98 states. [2019-05-23 09:27:37,966 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:37,967 INFO L146 ILogger]: Finished difference Result 390 states and 393 transitions. [2019-05-23 09:27:37,967 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-05-23 09:27:37,967 INFO L146 ILogger]: Start accepts. Automaton has 98 states. Word has length 380 [2019-05-23 09:27:37,967 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:37,968 INFO L146 ILogger]: With dead ends: 390 [2019-05-23 09:27:37,968 INFO L146 ILogger]: Without dead ends: 387 [2019-05-23 09:27:37,970 INFO L146 ILogger]: 0 DeclaredPredicates, 473 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4464 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=570, Invalid=36102, Unknown=0, NotChecked=0, Total=36672 [2019-05-23 09:27:37,971 INFO L146 ILogger]: Start minimizeSevpa. Operand 387 states. [2019-05-23 09:27:37,974 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 387 to 385. [2019-05-23 09:27:37,974 INFO L146 ILogger]: Start removeUnreachable. Operand 385 states. [2019-05-23 09:27:37,974 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 385 states to 385 states and 388 transitions. [2019-05-23 09:27:37,974 INFO L146 ILogger]: Start accepts. Automaton has 385 states and 388 transitions. Word has length 380 [2019-05-23 09:27:37,974 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:37,974 INFO L146 ILogger]: Abstraction has 385 states and 388 transitions. [2019-05-23 09:27:37,974 INFO L146 ILogger]: Interpolant automaton has 98 states. [2019-05-23 09:27:37,975 INFO L146 ILogger]: Start isEmpty. Operand 385 states and 388 transitions. [2019-05-23 09:27:37,976 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 385 [2019-05-23 09:27:37,976 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:37,976 INFO L146 ILogger]: trace histogram [48, 48, 48, 48, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:27:37,976 INFO L146 ILogger]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:37,976 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:37,976 INFO L146 ILogger]: Analyzing trace with hash -1818547999, now seen corresponding path program 48 times [2019-05-23 09:27:37,977 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:38,015 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:38,022 INFO L146 ILogger]: Trace formula consists of 576 conjuncts, 198 conjunts are in the unsatisfiable core [2019-05-23 09:27:38,025 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:41,861 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:27:41,862 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:41,863 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:41,863 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:41,864 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:27:42,020 INFO L146 ILogger]: Checked inductivity of 5256 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:27:42,020 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:42,020 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-05-23 09:27:42,021 INFO L146 ILogger]: Interpolant automaton has 100 states [2019-05-23 09:27:42,021 INFO L146 ILogger]: Constructing interpolant automaton starting with 100 interpolants. [2019-05-23 09:27:42,021 INFO L146 ILogger]: CoverageRelationStatistics Valid=198, Invalid=9702, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 09:27:42,021 INFO L146 ILogger]: Start difference. First operand 385 states and 388 transitions. Second operand 100 states. [2019-05-23 09:27:56,785 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:56,785 INFO L146 ILogger]: Finished difference Result 394 states and 397 transitions. [2019-05-23 09:27:56,785 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-05-23 09:27:56,785 INFO L146 ILogger]: Start accepts. Automaton has 100 states. Word has length 384 [2019-05-23 09:27:56,786 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:56,787 INFO L146 ILogger]: With dead ends: 394 [2019-05-23 09:27:56,787 INFO L146 ILogger]: Without dead ends: 391 [2019-05-23 09:27:56,788 INFO L146 ILogger]: 0 DeclaredPredicates, 479 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4655 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=582, Invalid=37638, Unknown=0, NotChecked=0, Total=38220 [2019-05-23 09:27:56,788 INFO L146 ILogger]: Start minimizeSevpa. Operand 391 states. [2019-05-23 09:27:56,790 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 391 to 389. [2019-05-23 09:27:56,791 INFO L146 ILogger]: Start removeUnreachable. Operand 389 states. [2019-05-23 09:27:56,791 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 389 states to 389 states and 392 transitions. [2019-05-23 09:27:56,791 INFO L146 ILogger]: Start accepts. Automaton has 389 states and 392 transitions. Word has length 384 [2019-05-23 09:27:56,791 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:56,791 INFO L146 ILogger]: Abstraction has 389 states and 392 transitions. [2019-05-23 09:27:56,791 INFO L146 ILogger]: Interpolant automaton has 100 states. [2019-05-23 09:27:56,791 INFO L146 ILogger]: Start isEmpty. Operand 389 states and 392 transitions. [2019-05-23 09:27:56,793 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 389 [2019-05-23 09:27:56,793 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:56,793 INFO L146 ILogger]: trace histogram [49, 49, 49, 49, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:27:56,793 INFO L146 ILogger]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:56,793 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:56,793 INFO L146 ILogger]: Analyzing trace with hash -2034937569, now seen corresponding path program 49 times [2019-05-23 09:27:56,794 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:56,835 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:56,842 INFO L146 ILogger]: Trace formula consists of 582 conjuncts, 202 conjunts are in the unsatisfiable core [2019-05-23 09:27:56,845 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:00,728 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:28:00,729 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:00,730 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:00,730 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:00,730 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:28:00,876 INFO L146 ILogger]: Checked inductivity of 5449 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:28:00,876 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:00,876 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-05-23 09:28:00,876 INFO L146 ILogger]: Interpolant automaton has 102 states [2019-05-23 09:28:00,877 INFO L146 ILogger]: Constructing interpolant automaton starting with 102 interpolants. [2019-05-23 09:28:00,877 INFO L146 ILogger]: CoverageRelationStatistics Valid=202, Invalid=10100, Unknown=0, NotChecked=0, Total=10302 [2019-05-23 09:28:00,877 INFO L146 ILogger]: Start difference. First operand 389 states and 392 transitions. Second operand 102 states. [2019-05-23 09:28:16,148 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:16,149 INFO L146 ILogger]: Finished difference Result 398 states and 401 transitions. [2019-05-23 09:28:16,149 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-05-23 09:28:16,149 INFO L146 ILogger]: Start accepts. Automaton has 102 states. Word has length 388 [2019-05-23 09:28:16,149 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:16,150 INFO L146 ILogger]: With dead ends: 398 [2019-05-23 09:28:16,150 INFO L146 ILogger]: Without dead ends: 395 [2019-05-23 09:28:16,152 INFO L146 ILogger]: 0 DeclaredPredicates, 485 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4850 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=594, Invalid=39206, Unknown=0, NotChecked=0, Total=39800 [2019-05-23 09:28:16,152 INFO L146 ILogger]: Start minimizeSevpa. Operand 395 states. [2019-05-23 09:28:16,154 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 395 to 393. [2019-05-23 09:28:16,154 INFO L146 ILogger]: Start removeUnreachable. Operand 393 states. [2019-05-23 09:28:16,155 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 393 states to 393 states and 396 transitions. [2019-05-23 09:28:16,155 INFO L146 ILogger]: Start accepts. Automaton has 393 states and 396 transitions. Word has length 388 [2019-05-23 09:28:16,155 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:16,155 INFO L146 ILogger]: Abstraction has 393 states and 396 transitions. [2019-05-23 09:28:16,155 INFO L146 ILogger]: Interpolant automaton has 102 states. [2019-05-23 09:28:16,155 INFO L146 ILogger]: Start isEmpty. Operand 393 states and 396 transitions. [2019-05-23 09:28:16,156 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 393 [2019-05-23 09:28:16,156 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:16,157 INFO L146 ILogger]: trace histogram [50, 50, 50, 50, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:28:16,157 INFO L146 ILogger]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:16,157 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:16,157 INFO L146 ILogger]: Analyzing trace with hash -1813697955, now seen corresponding path program 50 times [2019-05-23 09:28:16,157 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:16,203 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:16,210 INFO L146 ILogger]: Trace formula consists of 588 conjuncts, 206 conjunts are in the unsatisfiable core [2019-05-23 09:28:16,214 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:20,243 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:28:20,244 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:20,245 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:20,246 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:20,246 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:28:20,394 INFO L146 ILogger]: Checked inductivity of 5646 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:28:20,394 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:20,394 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-05-23 09:28:20,394 INFO L146 ILogger]: Interpolant automaton has 104 states [2019-05-23 09:28:20,395 INFO L146 ILogger]: Constructing interpolant automaton starting with 104 interpolants. [2019-05-23 09:28:20,395 INFO L146 ILogger]: CoverageRelationStatistics Valid=206, Invalid=10506, Unknown=0, NotChecked=0, Total=10712 [2019-05-23 09:28:20,395 INFO L146 ILogger]: Start difference. First operand 393 states and 396 transitions. Second operand 104 states. [2019-05-23 09:28:36,167 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:36,167 INFO L146 ILogger]: Finished difference Result 402 states and 405 transitions. [2019-05-23 09:28:36,167 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-05-23 09:28:36,167 INFO L146 ILogger]: Start accepts. Automaton has 104 states. Word has length 392 [2019-05-23 09:28:36,168 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:36,169 INFO L146 ILogger]: With dead ends: 402 [2019-05-23 09:28:36,169 INFO L146 ILogger]: Without dead ends: 399 [2019-05-23 09:28:36,170 INFO L146 ILogger]: 0 DeclaredPredicates, 491 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5049 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=606, Invalid=40806, Unknown=0, NotChecked=0, Total=41412 [2019-05-23 09:28:36,171 INFO L146 ILogger]: Start minimizeSevpa. Operand 399 states. [2019-05-23 09:28:36,173 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 399 to 397. [2019-05-23 09:28:36,173 INFO L146 ILogger]: Start removeUnreachable. Operand 397 states. [2019-05-23 09:28:36,173 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 397 states to 397 states and 400 transitions. [2019-05-23 09:28:36,174 INFO L146 ILogger]: Start accepts. Automaton has 397 states and 400 transitions. Word has length 392 [2019-05-23 09:28:36,174 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:36,174 INFO L146 ILogger]: Abstraction has 397 states and 400 transitions. [2019-05-23 09:28:36,174 INFO L146 ILogger]: Interpolant automaton has 104 states. [2019-05-23 09:28:36,174 INFO L146 ILogger]: Start isEmpty. Operand 397 states and 400 transitions. [2019-05-23 09:28:36,175 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 397 [2019-05-23 09:28:36,175 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:36,176 INFO L146 ILogger]: trace histogram [51, 51, 51, 51, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:28:36,176 INFO L146 ILogger]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:36,176 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:36,176 INFO L146 ILogger]: Analyzing trace with hash 1726624923, now seen corresponding path program 51 times [2019-05-23 09:28:36,176 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:36,219 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:36,227 INFO L146 ILogger]: Trace formula consists of 594 conjuncts, 210 conjunts are in the unsatisfiable core [2019-05-23 09:28:36,231 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:40,507 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:28:40,508 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:40,509 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:40,510 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:40,510 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:28:40,659 INFO L146 ILogger]: Checked inductivity of 5847 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:28:40,659 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:40,659 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-05-23 09:28:40,659 INFO L146 ILogger]: Interpolant automaton has 106 states [2019-05-23 09:28:40,660 INFO L146 ILogger]: Constructing interpolant automaton starting with 106 interpolants. [2019-05-23 09:28:40,660 INFO L146 ILogger]: CoverageRelationStatistics Valid=210, Invalid=10920, Unknown=0, NotChecked=0, Total=11130 [2019-05-23 09:28:40,660 INFO L146 ILogger]: Start difference. First operand 397 states and 400 transitions. Second operand 106 states. [2019-05-23 09:28:57,019 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:57,020 INFO L146 ILogger]: Finished difference Result 406 states and 409 transitions. [2019-05-23 09:28:57,020 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-05-23 09:28:57,020 INFO L146 ILogger]: Start accepts. Automaton has 106 states. Word has length 396 [2019-05-23 09:28:57,020 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:57,021 INFO L146 ILogger]: With dead ends: 406 [2019-05-23 09:28:57,021 INFO L146 ILogger]: Without dead ends: 403 [2019-05-23 09:28:57,023 INFO L146 ILogger]: 0 DeclaredPredicates, 497 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5252 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=618, Invalid=42438, Unknown=0, NotChecked=0, Total=43056 [2019-05-23 09:28:57,024 INFO L146 ILogger]: Start minimizeSevpa. Operand 403 states. [2019-05-23 09:28:57,026 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 403 to 401. [2019-05-23 09:28:57,026 INFO L146 ILogger]: Start removeUnreachable. Operand 401 states. [2019-05-23 09:28:57,026 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 401 states to 401 states and 404 transitions. [2019-05-23 09:28:57,026 INFO L146 ILogger]: Start accepts. Automaton has 401 states and 404 transitions. Word has length 396 [2019-05-23 09:28:57,026 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:57,026 INFO L146 ILogger]: Abstraction has 401 states and 404 transitions. [2019-05-23 09:28:57,027 INFO L146 ILogger]: Interpolant automaton has 106 states. [2019-05-23 09:28:57,027 INFO L146 ILogger]: Start isEmpty. Operand 401 states and 404 transitions. [2019-05-23 09:28:57,028 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 401 [2019-05-23 09:28:57,028 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:57,028 INFO L146 ILogger]: trace histogram [52, 52, 52, 52, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:28:57,028 INFO L146 ILogger]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:57,028 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:57,029 INFO L146 ILogger]: Analyzing trace with hash -1077678119, now seen corresponding path program 52 times [2019-05-23 09:28:57,029 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:57,074 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:57,082 INFO L146 ILogger]: Trace formula consists of 600 conjuncts, 214 conjunts are in the unsatisfiable core [2019-05-23 09:28:57,085 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:01,441 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:29:01,441 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:29:01,443 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:01,443 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:01,443 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:29:01,597 INFO L146 ILogger]: Checked inductivity of 6052 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:29:01,598 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:01,598 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-05-23 09:29:01,598 INFO L146 ILogger]: Interpolant automaton has 108 states [2019-05-23 09:29:01,598 INFO L146 ILogger]: Constructing interpolant automaton starting with 108 interpolants. [2019-05-23 09:29:01,599 INFO L146 ILogger]: CoverageRelationStatistics Valid=214, Invalid=11342, Unknown=0, NotChecked=0, Total=11556 [2019-05-23 09:29:01,599 INFO L146 ILogger]: Start difference. First operand 401 states and 404 transitions. Second operand 108 states. [2019-05-23 09:29:18,629 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:18,629 INFO L146 ILogger]: Finished difference Result 410 states and 413 transitions. [2019-05-23 09:29:18,629 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-05-23 09:29:18,629 INFO L146 ILogger]: Start accepts. Automaton has 108 states. Word has length 400 [2019-05-23 09:29:18,630 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:18,631 INFO L146 ILogger]: With dead ends: 410 [2019-05-23 09:29:18,631 INFO L146 ILogger]: Without dead ends: 407 [2019-05-23 09:29:18,632 INFO L146 ILogger]: 0 DeclaredPredicates, 503 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5459 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=630, Invalid=44102, Unknown=0, NotChecked=0, Total=44732 [2019-05-23 09:29:18,632 INFO L146 ILogger]: Start minimizeSevpa. Operand 407 states. [2019-05-23 09:29:18,635 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 407 to 405. [2019-05-23 09:29:18,635 INFO L146 ILogger]: Start removeUnreachable. Operand 405 states. [2019-05-23 09:29:18,635 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 405 states to 405 states and 408 transitions. [2019-05-23 09:29:18,635 INFO L146 ILogger]: Start accepts. Automaton has 405 states and 408 transitions. Word has length 400 [2019-05-23 09:29:18,635 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:18,635 INFO L146 ILogger]: Abstraction has 405 states and 408 transitions. [2019-05-23 09:29:18,635 INFO L146 ILogger]: Interpolant automaton has 108 states. [2019-05-23 09:29:18,636 INFO L146 ILogger]: Start isEmpty. Operand 405 states and 408 transitions. [2019-05-23 09:29:18,637 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 405 [2019-05-23 09:29:18,637 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:18,637 INFO L146 ILogger]: trace histogram [53, 53, 53, 53, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:29:18,637 INFO L146 ILogger]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:18,637 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:18,638 INFO L146 ILogger]: Analyzing trace with hash 1387387927, now seen corresponding path program 53 times [2019-05-23 09:29:18,638 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:18,682 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:18,693 INFO L146 ILogger]: Trace formula consists of 606 conjuncts, 218 conjunts are in the unsatisfiable core [2019-05-23 09:29:18,697 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:23,345 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:29:23,345 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:29:23,349 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:23,349 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:23,349 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:29:23,520 INFO L146 ILogger]: Checked inductivity of 6261 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:29:23,520 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:23,520 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-05-23 09:29:23,521 INFO L146 ILogger]: Interpolant automaton has 110 states [2019-05-23 09:29:23,521 INFO L146 ILogger]: Constructing interpolant automaton starting with 110 interpolants. [2019-05-23 09:29:23,521 INFO L146 ILogger]: CoverageRelationStatistics Valid=218, Invalid=11772, Unknown=0, NotChecked=0, Total=11990 [2019-05-23 09:29:23,521 INFO L146 ILogger]: Start difference. First operand 405 states and 408 transitions. Second operand 110 states. [2019-05-23 09:29:41,474 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:41,474 INFO L146 ILogger]: Finished difference Result 414 states and 417 transitions. [2019-05-23 09:29:41,475 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-05-23 09:29:41,475 INFO L146 ILogger]: Start accepts. Automaton has 110 states. Word has length 404 [2019-05-23 09:29:41,475 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:41,476 INFO L146 ILogger]: With dead ends: 414 [2019-05-23 09:29:41,476 INFO L146 ILogger]: Without dead ends: 411 [2019-05-23 09:29:41,479 INFO L146 ILogger]: 0 DeclaredPredicates, 509 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=642, Invalid=45798, Unknown=0, NotChecked=0, Total=46440 [2019-05-23 09:29:41,479 INFO L146 ILogger]: Start minimizeSevpa. Operand 411 states. [2019-05-23 09:29:41,481 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 411 to 409. [2019-05-23 09:29:41,481 INFO L146 ILogger]: Start removeUnreachable. Operand 409 states. [2019-05-23 09:29:41,482 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 409 states to 409 states and 412 transitions. [2019-05-23 09:29:41,482 INFO L146 ILogger]: Start accepts. Automaton has 409 states and 412 transitions. Word has length 404 [2019-05-23 09:29:41,482 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:41,482 INFO L146 ILogger]: Abstraction has 409 states and 412 transitions. [2019-05-23 09:29:41,482 INFO L146 ILogger]: Interpolant automaton has 110 states. [2019-05-23 09:29:41,482 INFO L146 ILogger]: Start isEmpty. Operand 409 states and 412 transitions. [2019-05-23 09:29:41,483 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 409 [2019-05-23 09:29:41,483 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:41,483 INFO L146 ILogger]: trace histogram [54, 54, 54, 54, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:29:41,484 INFO L146 ILogger]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:41,484 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:41,484 INFO L146 ILogger]: Analyzing trace with hash -1473021611, now seen corresponding path program 54 times [2019-05-23 09:29:41,484 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:41,533 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:41,541 INFO L146 ILogger]: Trace formula consists of 612 conjuncts, 222 conjunts are in the unsatisfiable core [2019-05-23 09:29:41,544 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:46,053 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:29:46,053 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:29:46,055 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:46,055 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:46,055 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:29:46,228 INFO L146 ILogger]: Checked inductivity of 6474 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:29:46,229 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:46,229 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-05-23 09:29:46,229 INFO L146 ILogger]: Interpolant automaton has 112 states [2019-05-23 09:29:46,229 INFO L146 ILogger]: Constructing interpolant automaton starting with 112 interpolants. [2019-05-23 09:29:46,230 INFO L146 ILogger]: CoverageRelationStatistics Valid=222, Invalid=12210, Unknown=0, NotChecked=0, Total=12432 [2019-05-23 09:29:46,230 INFO L146 ILogger]: Start difference. First operand 409 states and 412 transitions. Second operand 112 states. [2019-05-23 09:30:04,938 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:04,938 INFO L146 ILogger]: Finished difference Result 418 states and 421 transitions. [2019-05-23 09:30:04,938 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-05-23 09:30:04,938 INFO L146 ILogger]: Start accepts. Automaton has 112 states. Word has length 408 [2019-05-23 09:30:04,939 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:04,940 INFO L146 ILogger]: With dead ends: 418 [2019-05-23 09:30:04,940 INFO L146 ILogger]: Without dead ends: 415 [2019-05-23 09:30:04,941 INFO L146 ILogger]: 0 DeclaredPredicates, 515 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5885 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=654, Invalid=47526, Unknown=0, NotChecked=0, Total=48180 [2019-05-23 09:30:04,941 INFO L146 ILogger]: Start minimizeSevpa. Operand 415 states. [2019-05-23 09:30:04,944 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 415 to 413. [2019-05-23 09:30:04,944 INFO L146 ILogger]: Start removeUnreachable. Operand 413 states. [2019-05-23 09:30:04,944 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 413 states to 413 states and 416 transitions. [2019-05-23 09:30:04,944 INFO L146 ILogger]: Start accepts. Automaton has 413 states and 416 transitions. Word has length 408 [2019-05-23 09:30:04,944 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:04,944 INFO L146 ILogger]: Abstraction has 413 states and 416 transitions. [2019-05-23 09:30:04,945 INFO L146 ILogger]: Interpolant automaton has 112 states. [2019-05-23 09:30:04,945 INFO L146 ILogger]: Start isEmpty. Operand 413 states and 416 transitions. [2019-05-23 09:30:04,946 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 413 [2019-05-23 09:30:04,946 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:04,946 INFO L146 ILogger]: trace histogram [55, 55, 55, 55, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:30:04,946 INFO L146 ILogger]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:04,947 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:04,947 INFO L146 ILogger]: Analyzing trace with hash -49789037, now seen corresponding path program 55 times [2019-05-23 09:30:04,947 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:04,996 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:05,007 INFO L146 ILogger]: Trace formula consists of 618 conjuncts, 226 conjunts are in the unsatisfiable core [2019-05-23 09:30:05,011 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:10,104 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:30:10,104 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:30:10,105 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:30:10,105 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:30:10,105 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:30:10,266 INFO L146 ILogger]: Checked inductivity of 6691 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:30:10,266 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:10,266 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-05-23 09:30:10,267 INFO L146 ILogger]: Interpolant automaton has 114 states [2019-05-23 09:30:10,267 INFO L146 ILogger]: Constructing interpolant automaton starting with 114 interpolants. [2019-05-23 09:30:10,267 INFO L146 ILogger]: CoverageRelationStatistics Valid=226, Invalid=12656, Unknown=0, NotChecked=0, Total=12882 [2019-05-23 09:30:10,267 INFO L146 ILogger]: Start difference. First operand 413 states and 416 transitions. Second operand 114 states. [2019-05-23 09:30:29,202 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:29,202 INFO L146 ILogger]: Finished difference Result 422 states and 425 transitions. [2019-05-23 09:30:29,203 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-05-23 09:30:29,203 INFO L146 ILogger]: Start accepts. Automaton has 114 states. Word has length 412 [2019-05-23 09:30:29,203 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:29,205 INFO L146 ILogger]: With dead ends: 422 [2019-05-23 09:30:29,205 INFO L146 ILogger]: Without dead ends: 419 [2019-05-23 09:30:29,208 INFO L146 ILogger]: 0 DeclaredPredicates, 521 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6104 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=666, Invalid=49286, Unknown=0, NotChecked=0, Total=49952 [2019-05-23 09:30:29,208 INFO L146 ILogger]: Start minimizeSevpa. Operand 419 states. [2019-05-23 09:30:29,211 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 419 to 417. [2019-05-23 09:30:29,211 INFO L146 ILogger]: Start removeUnreachable. Operand 417 states. [2019-05-23 09:30:29,211 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 417 states to 417 states and 420 transitions. [2019-05-23 09:30:29,211 INFO L146 ILogger]: Start accepts. Automaton has 417 states and 420 transitions. Word has length 412 [2019-05-23 09:30:29,211 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:29,211 INFO L146 ILogger]: Abstraction has 417 states and 420 transitions. [2019-05-23 09:30:29,211 INFO L146 ILogger]: Interpolant automaton has 114 states. [2019-05-23 09:30:29,211 INFO L146 ILogger]: Start isEmpty. Operand 417 states and 420 transitions. [2019-05-23 09:30:29,213 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 417 [2019-05-23 09:30:29,213 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:29,213 INFO L146 ILogger]: trace histogram [56, 56, 56, 56, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:30:29,213 INFO L146 ILogger]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:29,213 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:29,213 INFO L146 ILogger]: Analyzing trace with hash 573556433, now seen corresponding path program 56 times [2019-05-23 09:30:29,214 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:29,291 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:29,302 INFO L146 ILogger]: Trace formula consists of 624 conjuncts, 230 conjunts are in the unsatisfiable core [2019-05-23 09:30:29,306 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:34,294 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:30:34,294 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:30:34,296 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:30:34,296 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:30:34,296 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:30:34,472 INFO L146 ILogger]: Checked inductivity of 6912 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:30:34,472 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:34,473 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-05-23 09:30:34,473 INFO L146 ILogger]: Interpolant automaton has 116 states [2019-05-23 09:30:34,473 INFO L146 ILogger]: Constructing interpolant automaton starting with 116 interpolants. [2019-05-23 09:30:34,474 INFO L146 ILogger]: CoverageRelationStatistics Valid=230, Invalid=13110, Unknown=0, NotChecked=0, Total=13340 [2019-05-23 09:30:34,475 INFO L146 ILogger]: Start difference. First operand 417 states and 420 transitions. Second operand 116 states. [2019-05-23 09:30:53,957 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:53,958 INFO L146 ILogger]: Finished difference Result 426 states and 429 transitions. [2019-05-23 09:30:53,958 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-05-23 09:30:53,958 INFO L146 ILogger]: Start accepts. Automaton has 116 states. Word has length 416 [2019-05-23 09:30:53,958 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:53,959 INFO L146 ILogger]: With dead ends: 426 [2019-05-23 09:30:53,959 INFO L146 ILogger]: Without dead ends: 423 [2019-05-23 09:30:53,961 INFO L146 ILogger]: 0 DeclaredPredicates, 527 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6327 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=678, Invalid=51078, Unknown=0, NotChecked=0, Total=51756 [2019-05-23 09:30:53,961 INFO L146 ILogger]: Start minimizeSevpa. Operand 423 states. [2019-05-23 09:30:53,964 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 423 to 421. [2019-05-23 09:30:53,964 INFO L146 ILogger]: Start removeUnreachable. Operand 421 states. [2019-05-23 09:30:53,964 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 421 states to 421 states and 424 transitions. [2019-05-23 09:30:53,964 INFO L146 ILogger]: Start accepts. Automaton has 421 states and 424 transitions. Word has length 416 [2019-05-23 09:30:53,965 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:53,965 INFO L146 ILogger]: Abstraction has 421 states and 424 transitions. [2019-05-23 09:30:53,965 INFO L146 ILogger]: Interpolant automaton has 116 states. [2019-05-23 09:30:53,965 INFO L146 ILogger]: Start isEmpty. Operand 421 states and 424 transitions. [2019-05-23 09:30:53,966 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 421 [2019-05-23 09:30:53,966 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:53,966 INFO L146 ILogger]: trace histogram [57, 57, 57, 57, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:30:53,966 INFO L146 ILogger]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:53,967 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:53,967 INFO L146 ILogger]: Analyzing trace with hash 1558804239, now seen corresponding path program 57 times [2019-05-23 09:30:53,967 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:54,016 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:54,024 INFO L146 ILogger]: Trace formula consists of 630 conjuncts, 234 conjunts are in the unsatisfiable core [2019-05-23 09:30:54,027 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:59,077 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:30:59,077 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:30:59,079 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:30:59,079 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:30:59,079 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:30:59,258 INFO L146 ILogger]: Checked inductivity of 7137 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:30:59,258 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:59,258 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-05-23 09:30:59,259 INFO L146 ILogger]: Interpolant automaton has 118 states [2019-05-23 09:30:59,259 INFO L146 ILogger]: Constructing interpolant automaton starting with 118 interpolants. [2019-05-23 09:30:59,260 INFO L146 ILogger]: CoverageRelationStatistics Valid=234, Invalid=13572, Unknown=0, NotChecked=0, Total=13806 [2019-05-23 09:30:59,260 INFO L146 ILogger]: Start difference. First operand 421 states and 424 transitions. Second operand 118 states. [2019-05-23 09:31:19,668 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:19,669 INFO L146 ILogger]: Finished difference Result 430 states and 433 transitions. [2019-05-23 09:31:19,669 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2019-05-23 09:31:19,669 INFO L146 ILogger]: Start accepts. Automaton has 118 states. Word has length 420 [2019-05-23 09:31:19,669 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:19,671 INFO L146 ILogger]: With dead ends: 430 [2019-05-23 09:31:19,671 INFO L146 ILogger]: Without dead ends: 427 [2019-05-23 09:31:19,673 INFO L146 ILogger]: 0 DeclaredPredicates, 533 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6554 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=690, Invalid=52902, Unknown=0, NotChecked=0, Total=53592 [2019-05-23 09:31:19,673 INFO L146 ILogger]: Start minimizeSevpa. Operand 427 states. [2019-05-23 09:31:19,675 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 427 to 425. [2019-05-23 09:31:19,675 INFO L146 ILogger]: Start removeUnreachable. Operand 425 states. [2019-05-23 09:31:19,676 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 425 states to 425 states and 428 transitions. [2019-05-23 09:31:19,676 INFO L146 ILogger]: Start accepts. Automaton has 425 states and 428 transitions. Word has length 420 [2019-05-23 09:31:19,676 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:19,676 INFO L146 ILogger]: Abstraction has 425 states and 428 transitions. [2019-05-23 09:31:19,676 INFO L146 ILogger]: Interpolant automaton has 118 states. [2019-05-23 09:31:19,676 INFO L146 ILogger]: Start isEmpty. Operand 425 states and 428 transitions. [2019-05-23 09:31:19,677 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 425 [2019-05-23 09:31:19,677 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:19,678 INFO L146 ILogger]: trace histogram [58, 58, 58, 58, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:31:19,678 INFO L146 ILogger]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:19,678 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:19,678 INFO L146 ILogger]: Analyzing trace with hash 1186256973, now seen corresponding path program 58 times [2019-05-23 09:31:19,678 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:19,735 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:19,745 INFO L146 ILogger]: Trace formula consists of 636 conjuncts, 238 conjunts are in the unsatisfiable core [2019-05-23 09:31:19,748 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:24,956 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:31:24,956 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:31:24,957 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:31:24,957 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:31:24,958 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:31:25,127 INFO L146 ILogger]: Checked inductivity of 7366 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:31:25,127 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:25,127 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2019-05-23 09:31:25,128 INFO L146 ILogger]: Interpolant automaton has 120 states [2019-05-23 09:31:25,128 INFO L146 ILogger]: Constructing interpolant automaton starting with 120 interpolants. [2019-05-23 09:31:25,128 INFO L146 ILogger]: CoverageRelationStatistics Valid=238, Invalid=14042, Unknown=0, NotChecked=0, Total=14280 [2019-05-23 09:31:25,129 INFO L146 ILogger]: Start difference. First operand 425 states and 428 transitions. Second operand 120 states. [2019-05-23 09:31:46,153 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:46,153 INFO L146 ILogger]: Finished difference Result 434 states and 437 transitions. [2019-05-23 09:31:46,153 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-05-23 09:31:46,153 INFO L146 ILogger]: Start accepts. Automaton has 120 states. Word has length 424 [2019-05-23 09:31:46,154 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:46,155 INFO L146 ILogger]: With dead ends: 434 [2019-05-23 09:31:46,155 INFO L146 ILogger]: Without dead ends: 431 [2019-05-23 09:31:46,157 INFO L146 ILogger]: 0 DeclaredPredicates, 539 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6785 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=702, Invalid=54758, Unknown=0, NotChecked=0, Total=55460 [2019-05-23 09:31:46,157 INFO L146 ILogger]: Start minimizeSevpa. Operand 431 states. [2019-05-23 09:31:46,160 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 431 to 429. [2019-05-23 09:31:46,160 INFO L146 ILogger]: Start removeUnreachable. Operand 429 states. [2019-05-23 09:31:46,160 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 429 states to 429 states and 432 transitions. [2019-05-23 09:31:46,160 INFO L146 ILogger]: Start accepts. Automaton has 429 states and 432 transitions. Word has length 424 [2019-05-23 09:31:46,160 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:46,160 INFO L146 ILogger]: Abstraction has 429 states and 432 transitions. [2019-05-23 09:31:46,161 INFO L146 ILogger]: Interpolant automaton has 120 states. [2019-05-23 09:31:46,161 INFO L146 ILogger]: Start isEmpty. Operand 429 states and 432 transitions. [2019-05-23 09:31:46,162 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 429 [2019-05-23 09:31:46,162 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:46,162 INFO L146 ILogger]: trace histogram [59, 59, 59, 59, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:31:46,162 INFO L146 ILogger]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:46,163 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:46,163 INFO L146 ILogger]: Analyzing trace with hash -1387173237, now seen corresponding path program 59 times [2019-05-23 09:31:46,163 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:46,221 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:46,233 INFO L146 ILogger]: Trace formula consists of 642 conjuncts, 242 conjunts are in the unsatisfiable core [2019-05-23 09:31:46,237 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:51,879 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:31:51,880 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:31:51,881 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:31:51,882 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:31:51,882 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:31:52,063 INFO L146 ILogger]: Checked inductivity of 7599 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:31:52,063 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:52,063 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2019-05-23 09:31:52,064 INFO L146 ILogger]: Interpolant automaton has 122 states [2019-05-23 09:31:52,064 INFO L146 ILogger]: Constructing interpolant automaton starting with 122 interpolants. [2019-05-23 09:31:52,065 INFO L146 ILogger]: CoverageRelationStatistics Valid=242, Invalid=14520, Unknown=0, NotChecked=0, Total=14762 [2019-05-23 09:31:52,065 INFO L146 ILogger]: Start difference. First operand 429 states and 432 transitions. Second operand 122 states. [2019-05-23 09:32:13,613 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:13,614 INFO L146 ILogger]: Finished difference Result 438 states and 441 transitions. [2019-05-23 09:32:13,614 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2019-05-23 09:32:13,614 INFO L146 ILogger]: Start accepts. Automaton has 122 states. Word has length 428 [2019-05-23 09:32:13,614 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:13,615 INFO L146 ILogger]: With dead ends: 438 [2019-05-23 09:32:13,616 INFO L146 ILogger]: Without dead ends: 435 [2019-05-23 09:32:13,618 INFO L146 ILogger]: 0 DeclaredPredicates, 545 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7020 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=714, Invalid=56646, Unknown=0, NotChecked=0, Total=57360 [2019-05-23 09:32:13,618 INFO L146 ILogger]: Start minimizeSevpa. Operand 435 states. [2019-05-23 09:32:13,620 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 435 to 433. [2019-05-23 09:32:13,620 INFO L146 ILogger]: Start removeUnreachable. Operand 433 states. [2019-05-23 09:32:13,621 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 433 states to 433 states and 436 transitions. [2019-05-23 09:32:13,621 INFO L146 ILogger]: Start accepts. Automaton has 433 states and 436 transitions. Word has length 428 [2019-05-23 09:32:13,621 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:13,621 INFO L146 ILogger]: Abstraction has 433 states and 436 transitions. [2019-05-23 09:32:13,621 INFO L146 ILogger]: Interpolant automaton has 122 states. [2019-05-23 09:32:13,621 INFO L146 ILogger]: Start isEmpty. Operand 433 states and 436 transitions. [2019-05-23 09:32:13,623 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 433 [2019-05-23 09:32:13,623 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:13,623 INFO L146 ILogger]: trace histogram [60, 60, 60, 60, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:32:13,623 INFO L146 ILogger]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:13,623 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:13,623 INFO L146 ILogger]: Analyzing trace with hash 1925098953, now seen corresponding path program 60 times [2019-05-23 09:32:13,624 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:13,677 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:13,687 INFO L146 ILogger]: Trace formula consists of 648 conjuncts, 246 conjunts are in the unsatisfiable core [2019-05-23 09:32:13,690 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:19,362 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:32:19,362 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:32:19,363 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:32:19,363 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:32:19,364 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:32:19,567 INFO L146 ILogger]: Checked inductivity of 7836 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:32:19,567 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:19,567 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2019-05-23 09:32:19,568 INFO L146 ILogger]: Interpolant automaton has 124 states [2019-05-23 09:32:19,568 INFO L146 ILogger]: Constructing interpolant automaton starting with 124 interpolants. [2019-05-23 09:32:19,569 INFO L146 ILogger]: CoverageRelationStatistics Valid=246, Invalid=15006, Unknown=0, NotChecked=0, Total=15252 [2019-05-23 09:32:19,569 INFO L146 ILogger]: Start difference. First operand 433 states and 436 transitions. Second operand 124 states. [2019-05-23 09:32:42,124 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:42,125 INFO L146 ILogger]: Finished difference Result 442 states and 445 transitions. [2019-05-23 09:32:42,125 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-05-23 09:32:42,125 INFO L146 ILogger]: Start accepts. Automaton has 124 states. Word has length 432 [2019-05-23 09:32:42,125 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:42,126 INFO L146 ILogger]: With dead ends: 442 [2019-05-23 09:32:42,127 INFO L146 ILogger]: Without dead ends: 439 [2019-05-23 09:32:42,128 INFO L146 ILogger]: 0 DeclaredPredicates, 551 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7259 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=726, Invalid=58566, Unknown=0, NotChecked=0, Total=59292 [2019-05-23 09:32:42,129 INFO L146 ILogger]: Start minimizeSevpa. Operand 439 states. [2019-05-23 09:32:42,131 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 439 to 437. [2019-05-23 09:32:42,131 INFO L146 ILogger]: Start removeUnreachable. Operand 437 states. [2019-05-23 09:32:42,131 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 437 states to 437 states and 440 transitions. [2019-05-23 09:32:42,131 INFO L146 ILogger]: Start accepts. Automaton has 437 states and 440 transitions. Word has length 432 [2019-05-23 09:32:42,131 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:42,131 INFO L146 ILogger]: Abstraction has 437 states and 440 transitions. [2019-05-23 09:32:42,131 INFO L146 ILogger]: Interpolant automaton has 124 states. [2019-05-23 09:32:42,132 INFO L146 ILogger]: Start isEmpty. Operand 437 states and 440 transitions. [2019-05-23 09:32:42,133 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 437 [2019-05-23 09:32:42,133 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:42,133 INFO L146 ILogger]: trace histogram [61, 61, 61, 61, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:32:42,133 INFO L146 ILogger]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:42,133 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:42,133 INFO L146 ILogger]: Analyzing trace with hash 1832657415, now seen corresponding path program 61 times [2019-05-23 09:32:42,134 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:42,188 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:42,197 INFO L146 ILogger]: Trace formula consists of 654 conjuncts, 250 conjunts are in the unsatisfiable core [2019-05-23 09:32:42,200 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:48,017 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:32:48,017 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:32:48,018 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:32:48,018 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:32:48,018 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:32:48,199 INFO L146 ILogger]: Checked inductivity of 8077 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:32:48,200 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:48,200 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2019-05-23 09:32:48,200 INFO L146 ILogger]: Interpolant automaton has 126 states [2019-05-23 09:32:48,201 INFO L146 ILogger]: Constructing interpolant automaton starting with 126 interpolants. [2019-05-23 09:32:48,201 INFO L146 ILogger]: CoverageRelationStatistics Valid=250, Invalid=15500, Unknown=0, NotChecked=0, Total=15750 [2019-05-23 09:32:48,201 INFO L146 ILogger]: Start difference. First operand 437 states and 440 transitions. Second operand 126 states. [2019-05-23 09:33:11,562 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:11,562 INFO L146 ILogger]: Finished difference Result 446 states and 449 transitions. [2019-05-23 09:33:11,562 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2019-05-23 09:33:11,562 INFO L146 ILogger]: Start accepts. Automaton has 126 states. Word has length 436 [2019-05-23 09:33:11,563 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:11,564 INFO L146 ILogger]: With dead ends: 446 [2019-05-23 09:33:11,564 INFO L146 ILogger]: Without dead ends: 443 [2019-05-23 09:33:11,566 INFO L146 ILogger]: 0 DeclaredPredicates, 557 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7502 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=738, Invalid=60518, Unknown=0, NotChecked=0, Total=61256 [2019-05-23 09:33:11,566 INFO L146 ILogger]: Start minimizeSevpa. Operand 443 states. [2019-05-23 09:33:11,568 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 443 to 441. [2019-05-23 09:33:11,569 INFO L146 ILogger]: Start removeUnreachable. Operand 441 states. [2019-05-23 09:33:11,569 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 441 states to 441 states and 444 transitions. [2019-05-23 09:33:11,569 INFO L146 ILogger]: Start accepts. Automaton has 441 states and 444 transitions. Word has length 436 [2019-05-23 09:33:11,569 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:11,569 INFO L146 ILogger]: Abstraction has 441 states and 444 transitions. [2019-05-23 09:33:11,569 INFO L146 ILogger]: Interpolant automaton has 126 states. [2019-05-23 09:33:11,569 INFO L146 ILogger]: Start isEmpty. Operand 441 states and 444 transitions. [2019-05-23 09:33:11,571 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 441 [2019-05-23 09:33:11,571 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:11,571 INFO L146 ILogger]: trace histogram [62, 62, 62, 62, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:33:11,571 INFO L146 ILogger]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:11,571 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:11,572 INFO L146 ILogger]: Analyzing trace with hash 1195984709, now seen corresponding path program 62 times [2019-05-23 09:33:11,572 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:11,661 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:11,675 INFO L146 ILogger]: Trace formula consists of 660 conjuncts, 254 conjunts are in the unsatisfiable core [2019-05-23 09:33:11,680 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:17,814 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:33:17,815 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:33:17,816 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:33:17,816 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:33:17,816 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:33:17,996 INFO L146 ILogger]: Checked inductivity of 8322 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:33:17,996 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:17,997 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2019-05-23 09:33:17,997 INFO L146 ILogger]: Interpolant automaton has 128 states [2019-05-23 09:33:17,997 INFO L146 ILogger]: Constructing interpolant automaton starting with 128 interpolants. [2019-05-23 09:33:17,998 INFO L146 ILogger]: CoverageRelationStatistics Valid=254, Invalid=16002, Unknown=0, NotChecked=0, Total=16256 [2019-05-23 09:33:17,998 INFO L146 ILogger]: Start difference. First operand 441 states and 444 transitions. Second operand 128 states. [2019-05-23 09:33:41,691 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:41,691 INFO L146 ILogger]: Finished difference Result 450 states and 453 transitions. [2019-05-23 09:33:41,692 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2019-05-23 09:33:41,692 INFO L146 ILogger]: Start accepts. Automaton has 128 states. Word has length 440 [2019-05-23 09:33:41,692 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:41,693 INFO L146 ILogger]: With dead ends: 450 [2019-05-23 09:33:41,693 INFO L146 ILogger]: Without dead ends: 447 [2019-05-23 09:33:41,695 INFO L146 ILogger]: 0 DeclaredPredicates, 563 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7749 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=750, Invalid=62502, Unknown=0, NotChecked=0, Total=63252 [2019-05-23 09:33:41,696 INFO L146 ILogger]: Start minimizeSevpa. Operand 447 states. [2019-05-23 09:33:41,698 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 447 to 445. [2019-05-23 09:33:41,698 INFO L146 ILogger]: Start removeUnreachable. Operand 445 states. [2019-05-23 09:33:41,698 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 445 states to 445 states and 448 transitions. [2019-05-23 09:33:41,698 INFO L146 ILogger]: Start accepts. Automaton has 445 states and 448 transitions. Word has length 440 [2019-05-23 09:33:41,698 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:41,699 INFO L146 ILogger]: Abstraction has 445 states and 448 transitions. [2019-05-23 09:33:41,699 INFO L146 ILogger]: Interpolant automaton has 128 states. [2019-05-23 09:33:41,699 INFO L146 ILogger]: Start isEmpty. Operand 445 states and 448 transitions. [2019-05-23 09:33:41,700 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 445 [2019-05-23 09:33:41,700 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:41,700 INFO L146 ILogger]: trace histogram [63, 63, 63, 63, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:33:41,701 INFO L146 ILogger]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:41,701 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:41,701 INFO L146 ILogger]: Analyzing trace with hash 1604689283, now seen corresponding path program 63 times [2019-05-23 09:33:41,701 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:41,765 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:41,776 INFO L146 ILogger]: Trace formula consists of 666 conjuncts, 258 conjunts are in the unsatisfiable core [2019-05-23 09:33:41,779 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:48,272 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:33:48,272 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:33:48,273 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:33:48,273 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:33:48,274 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:33:48,458 INFO L146 ILogger]: Checked inductivity of 8571 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:33:48,458 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:48,458 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2019-05-23 09:33:48,459 INFO L146 ILogger]: Interpolant automaton has 130 states [2019-05-23 09:33:48,459 INFO L146 ILogger]: Constructing interpolant automaton starting with 130 interpolants. [2019-05-23 09:33:48,459 INFO L146 ILogger]: CoverageRelationStatistics Valid=258, Invalid=16512, Unknown=0, NotChecked=0, Total=16770 [2019-05-23 09:33:48,460 INFO L146 ILogger]: Start difference. First operand 445 states and 448 transitions. Second operand 130 states. [2019-05-23 09:34:12,968 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:34:12,968 INFO L146 ILogger]: Finished difference Result 454 states and 457 transitions. [2019-05-23 09:34:12,969 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2019-05-23 09:34:12,969 INFO L146 ILogger]: Start accepts. Automaton has 130 states. Word has length 444 [2019-05-23 09:34:12,969 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:34:12,970 INFO L146 ILogger]: With dead ends: 454 [2019-05-23 09:34:12,970 INFO L146 ILogger]: Without dead ends: 451 [2019-05-23 09:34:12,973 INFO L146 ILogger]: 0 DeclaredPredicates, 569 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8000 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=762, Invalid=64518, Unknown=0, NotChecked=0, Total=65280 [2019-05-23 09:34:12,973 INFO L146 ILogger]: Start minimizeSevpa. Operand 451 states. [2019-05-23 09:34:12,976 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 451 to 449. [2019-05-23 09:34:12,976 INFO L146 ILogger]: Start removeUnreachable. Operand 449 states. [2019-05-23 09:34:12,976 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 449 states to 449 states and 452 transitions. [2019-05-23 09:34:12,976 INFO L146 ILogger]: Start accepts. Automaton has 449 states and 452 transitions. Word has length 444 [2019-05-23 09:34:12,976 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:34:12,976 INFO L146 ILogger]: Abstraction has 449 states and 452 transitions. [2019-05-23 09:34:12,976 INFO L146 ILogger]: Interpolant automaton has 130 states. [2019-05-23 09:34:12,977 INFO L146 ILogger]: Start isEmpty. Operand 449 states and 452 transitions. [2019-05-23 09:34:12,978 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 449 [2019-05-23 09:34:12,978 INFO L146 ILogger]: Found error trace [2019-05-23 09:34:12,978 INFO L146 ILogger]: trace histogram [64, 64, 64, 64, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:34:12,978 INFO L146 ILogger]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:34:12,979 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:34:12,979 INFO L146 ILogger]: Analyzing trace with hash -1454332735, now seen corresponding path program 64 times [2019-05-23 09:34:12,979 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:34:13,079 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:34:13,094 INFO L146 ILogger]: Trace formula consists of 672 conjuncts, 262 conjunts are in the unsatisfiable core [2019-05-23 09:34:13,097 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:34:19,613 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-05-23 09:34:19,613 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:34:19,614 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:34:19,614 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:34:19,614 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-05-23 09:34:19,804 INFO L146 ILogger]: Checked inductivity of 8824 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-05-23 09:34:19,805 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:34:19,805 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2019-05-23 09:34:19,805 INFO L146 ILogger]: Interpolant automaton has 132 states [2019-05-23 09:34:19,806 INFO L146 ILogger]: Constructing interpolant automaton starting with 132 interpolants. [2019-05-23 09:34:19,807 INFO L146 ILogger]: CoverageRelationStatistics Valid=262, Invalid=17030, Unknown=0, NotChecked=0, Total=17292 [2019-05-23 09:34:19,807 INFO L146 ILogger]: Start difference. First operand 449 states and 452 transitions. Second operand 132 states. [2019-05-23 09:34:45,026 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:34:45,027 INFO L146 ILogger]: Finished difference Result 458 states and 461 transitions. [2019-05-23 09:34:45,027 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2019-05-23 09:34:45,027 INFO L146 ILogger]: Start accepts. Automaton has 132 states. Word has length 448 [2019-05-23 09:34:45,027 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:34:45,028 INFO L146 ILogger]: With dead ends: 458 [2019-05-23 09:34:45,029 INFO L146 ILogger]: Without dead ends: 455 [2019-05-23 09:34:45,031 INFO L146 ILogger]: 0 DeclaredPredicates, 575 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8255 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=774, Invalid=66566, Unknown=0, NotChecked=0, Total=67340 [2019-05-23 09:34:45,031 INFO L146 ILogger]: Start minimizeSevpa. Operand 455 states. [2019-05-23 09:34:45,034 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 455 to 453. [2019-05-23 09:34:45,034 INFO L146 ILogger]: Start removeUnreachable. Operand 453 states. [2019-05-23 09:34:45,035 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 453 states to 453 states and 456 transitions. [2019-05-23 09:34:45,035 INFO L146 ILogger]: Start accepts. Automaton has 453 states and 456 transitions. Word has length 448 [2019-05-23 09:34:45,035 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:34:45,035 INFO L146 ILogger]: Abstraction has 453 states and 456 transitions. [2019-05-23 09:34:45,035 INFO L146 ILogger]: Interpolant automaton has 132 states. [2019-05-23 09:34:45,035 INFO L146 ILogger]: Start isEmpty. Operand 453 states and 456 transitions. [2019-05-23 09:34:45,037 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 453 [2019-05-23 09:34:45,037 INFO L146 ILogger]: Found error trace [2019-05-23 09:34:45,038 INFO L146 ILogger]: trace histogram [65, 65, 65, 65, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:34:45,038 INFO L146 ILogger]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:34:45,038 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:34:45,038 INFO L146 ILogger]: Analyzing trace with hash -1953899265, now seen corresponding path program 65 times [2019-05-23 09:34:45,039 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:34:45,138 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:34:45,150 INFO L146 ILogger]: Trace formula consists of 678 conjuncts, 266 conjunts are in the unsatisfiable core [2019-05-23 09:34:45,154 INFO L146 ILogger]: Computing forward predicates...