java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_nondet.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:31:03,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:31:03,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:31:03,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:31:03,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:31:03,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:31:03,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:31:03,501 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:31:03,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:31:03,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:31:03,505 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:31:03,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:31:03,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:31:03,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:31:03,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:31:03,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:31:03,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:31:03,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:31:03,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:31:03,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:31:03,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:31:03,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:31:03,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:31:03,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:31:03,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:31:03,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:31:03,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:31:03,524 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:31:03,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:31:03,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:31:03,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:31:03,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:31:03,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:31:03,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:31:03,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:31:03,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:31:03,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:31:03,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:31:03,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:31:03,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:31:03,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:31:03,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:31:03,580 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:31:03,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:31:03,586 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:31:03,587 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:31:03,588 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_nondet.i_3.bpl [2019-08-04 21:31:03,588 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_nondet.i_3.bpl' [2019-08-04 21:31:03,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:31:03,631 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:31:03,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:31:03,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:31:03,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:31:03,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:31:03" (1/1) ... [2019-08-04 21:31:03,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:31:03" (1/1) ... [2019-08-04 21:31:03,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:31:03,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:31:03,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:31:03,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:31:03,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:31:03" (1/1) ... [2019-08-04 21:31:03,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:31:03" (1/1) ... [2019-08-04 21:31:03,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:31:03" (1/1) ... [2019-08-04 21:31:03,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:31:03" (1/1) ... [2019-08-04 21:31:03,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:31:03" (1/1) ... [2019-08-04 21:31:03,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:31:03" (1/1) ... [2019-08-04 21:31:03,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:31:03" (1/1) ... [2019-08-04 21:31:03,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:31:03,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:31:03,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:31:03,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:31:03,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:31:03" (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:1024 -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:1024 -smt2 -in -t:12000 [2019-08-04 21:31:03,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:31:03,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:31:04,026 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:31:04,027 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:31:04,028 INFO L202 PluginConnector]: Adding new model count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:31:04 BoogieIcfgContainer [2019-08-04 21:31:04,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:31:04,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:31:04,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:31:04,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:31:04,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:31:03" (1/2) ... [2019-08-04 21:31:04,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eede043 and model type count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:31:04, skipping insertion in model container [2019-08-04 21:31:04,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:31:04" (2/2) ... [2019-08-04 21:31:04,042 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_nondet.i_3.bpl [2019-08-04 21:31:04,052 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:31:04,060 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:31:04,077 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:31:04,105 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:31:04,105 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:31:04,106 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:31:04,106 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:31:04,106 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:31:04,106 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:31:04,106 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:31:04,107 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:31:04,107 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:31:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:31:04,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:31:04,131 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:04,132 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:31:04,135 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:04,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:04,141 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-04 21:31:04,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:04,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:31:04,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:04,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:31:04,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:31:04,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:31:04,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:31:04,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:31:04,297 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:31:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:04,338 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-04 21:31:04,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:31:04,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:31:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:04,350 INFO L225 Difference]: With dead ends: 5 [2019-08-04 21:31:04,350 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:31:04,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-08-04 21:31:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:31:04,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:31:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:31:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:31:04,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:31:04,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:04,386 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:31:04,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:31:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:31:04,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:31:04,387 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:04,387 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:31:04,388 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:04,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:04,388 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-04 21:31:04,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:04,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:31:04,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:04,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:04,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:31:04,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:31:04,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:31:04,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:31:04,562 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:31:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:04,608 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:31:04,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:31:04,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:31:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:04,610 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:31:04,610 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:31:04,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:31:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:31:04,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:31:04,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:31:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:31:04,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:31:04,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:04,614 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:31:04,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:31:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:31:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:31:04,615 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:04,615 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:31:04,616 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:04,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:04,617 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-04 21:31:04,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:04,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:31:04,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:04,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:04,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:31:04,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:31:04,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:31:04,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:31:04,741 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:31:04,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:04,787 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:31:04,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:31:04,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:31:04,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:04,790 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:31:04,790 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:31:04,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:31:04,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:31:04,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:31:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:31:04,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:31:04,795 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:31:04,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:04,795 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:31:04,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:31:04,796 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:31:04,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:31:04,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:04,796 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:31:04,797 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:04,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:04,799 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-04 21:31:04,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:04,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:31:04,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:04,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:04,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:31:04,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:31:04,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:31:04,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:31:04,946 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:31:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:04,988 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:31:04,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:31:04,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:31:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:05,001 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:31:05,001 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:31:05,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:31:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:31:05,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:31:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:31:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:31:05,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:31:05,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:05,004 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:31:05,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:31:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:31:05,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:31:05,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:05,006 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:31:05,006 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:05,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:05,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-04 21:31:05,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:05,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:31:05,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:05,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:05,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:05,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:31:05,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:31:05,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:31:05,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:31:05,183 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:31:05,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:05,252 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:31:05,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:31:05,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:31:05,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:05,254 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:31:05,254 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:31:05,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:31:05,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:31:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:31:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:31:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:31:05,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:31:05,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:05,257 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:31:05,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:31:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:31:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:31:05,258 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:05,258 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:31:05,258 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:05,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:05,259 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-04 21:31:05,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:05,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:31:05,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:05,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:05,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:31:05,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:31:05,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:31:05,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:31:05,532 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:31:05,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:05,565 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:31:05,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:31:05,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:31:05,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:05,566 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:31:05,566 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:31:05,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:31:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:31:05,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:31:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:31:05,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:31:05,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:31:05,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:05,569 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:31:05,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:31:05,569 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:31:05,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:31:05,570 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:05,570 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:31:05,570 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:05,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:05,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-04 21:31:05,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:05,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:31:05,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:05,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:05,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:31:05,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:31:05,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:31:05,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:31:05,926 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:31:05,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:05,970 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:31:05,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:31:05,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:31:05,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:05,971 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:31:05,972 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:31:05,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:31:05,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:31:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:31:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:31:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:31:05,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:31:05,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:05,976 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:31:05,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:31:05,976 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:31:05,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:31:05,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:05,977 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:31:05,977 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:05,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:05,978 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-04 21:31:05,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:06,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-04 21:31:06,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:06,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:06,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:31:06,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:31:06,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:31:06,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:31:06,127 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:31:06,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:06,158 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:31:06,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:31:06,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:31:06,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:06,159 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:31:06,159 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:31:06,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:31:06,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:31:06,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:31:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:31:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:31:06,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:31:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:06,162 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:31:06,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:31:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:31:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:31:06,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:06,163 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:31:06,163 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:06,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:06,164 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-04 21:31:06,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:06,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:31:06,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:06,610 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:06,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:06,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:31:06,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:31:06,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:31:06,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:31:06,612 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-04 21:31:06,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:06,655 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:31:06,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:31:06,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-04 21:31:06,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:06,657 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:31:06,657 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:31:06,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:31:06,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:31:06,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:31:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:31:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:31:06,659 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:31:06,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:06,660 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:31:06,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:31:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:31:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:31:06,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:06,661 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:31:06,662 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:06,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:06,662 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-04 21:31:06,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:06,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:31:06,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:06,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:06,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:31:06,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:31:06,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:31:06,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:31:06,886 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-04 21:31:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:06,927 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:31:06,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:31:06,928 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-04 21:31:06,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:06,929 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:31:06,929 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:31:06,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:31:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:31:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:31:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:31:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:31:06,933 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-04 21:31:06,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:06,934 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:31:06,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:31:06,934 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:31:06,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:31:06,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:06,935 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-04 21:31:06,935 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:06,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:06,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-04 21:31:06,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:06,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:31:06,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:07,216 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:07,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:07,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:31:07,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:31:07,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:31:07,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:31:07,218 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-04 21:31:07,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:07,258 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:31:07,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:31:07,262 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-04 21:31:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:07,262 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:31:07,262 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:31:07,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:31:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:31:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:31:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:31:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:31:07,265 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-04 21:31:07,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:07,265 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:31:07,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:31:07,265 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:31:07,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:31:07,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:07,266 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-04 21:31:07,266 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:07,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:07,267 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-04 21:31:07,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:07,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-04 21:31:07,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:07,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:07,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:31:07,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:31:07,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:31:07,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:31:07,575 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-04 21:31:07,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:07,611 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:31:07,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:31:07,611 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-04 21:31:07,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:07,612 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:31:07,612 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:31:07,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:31:07,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:31:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:31:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:31:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-04 21:31:07,616 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-04 21:31:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:07,617 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-04 21:31:07,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:31:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-04 21:31:07,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:31:07,618 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:07,618 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-04 21:31:07,618 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:07,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:07,618 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-04 21:31:07,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:07,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:31:07,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:07,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:07,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:31:07,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:31:07,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:31:07,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:31:07,853 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-04 21:31:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:07,892 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:31:07,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:31:07,892 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-04 21:31:07,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:07,895 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:31:07,895 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:31:07,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:31:07,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:31:07,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:31:07,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:31:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:31:07,898 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-04 21:31:07,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:07,899 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:31:07,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:31:07,899 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:31:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:31:07,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:07,899 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-04 21:31:07,900 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:07,900 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-04 21:31:07,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:07,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-04 21:31:07,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:08,267 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:08,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:08,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:31:08,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:31:08,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:31:08,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:31:08,269 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-04 21:31:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:08,312 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:31:08,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:31:08,312 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-04 21:31:08,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:08,313 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:31:08,313 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:31:08,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:31:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:31:08,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:31:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:31:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-04 21:31:08,317 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-04 21:31:08,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:08,317 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-04 21:31:08,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:31:08,317 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-04 21:31:08,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:31:08,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:08,318 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-04 21:31:08,318 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:08,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:08,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-04 21:31:08,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:08,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:31:08,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:08,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:08,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:31:08,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:31:08,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:31:08,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:31:08,568 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-04 21:31:08,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:08,623 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:31:08,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:31:08,632 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-04 21:31:08,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:08,633 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:31:08,633 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:31:08,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:31:08,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:31:08,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:31:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:31:08,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:31:08,636 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-04 21:31:08,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:08,637 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:31:08,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:31:08,637 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:31:08,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:31:08,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:08,637 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-04 21:31:08,638 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:08,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:08,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-04 21:31:08,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:08,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-04 21:31:08,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:09,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:09,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:31:09,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:31:09,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:31:09,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:31:09,080 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-04 21:31:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:09,127 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:31:09,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:31:09,127 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-04 21:31:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:09,128 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:31:09,128 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:31:09,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:31:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:31:09,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:31:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:31:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:31:09,132 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-04 21:31:09,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:09,132 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:31:09,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:31:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:31:09,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:31:09,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:09,133 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-04 21:31:09,134 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:09,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:09,134 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-04 21:31:09,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:09,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:31:09,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:09,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:09,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:31:09,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:31:09,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:31:09,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:31:09,778 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-04 21:31:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:09,853 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-04 21:31:09,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:31:09,854 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-04 21:31:09,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:09,855 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:31:09,855 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:31:09,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:31:09,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:31:09,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:31:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:31:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:31:09,858 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-04 21:31:09,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:09,859 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:31:09,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:31:09,859 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:31:09,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:31:09,859 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:09,859 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-04 21:31:09,860 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:09,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:09,860 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-04 21:31:09,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:09,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-04 21:31:09,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:11,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:11,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:31:11,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:31:11,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:31:11,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:31:11,222 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-04 21:31:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:11,258 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-04 21:31:11,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:31:11,266 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-04 21:31:11,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:11,267 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:31:11,267 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:31:11,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:31:11,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:31:11,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:31:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:31:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-04 21:31:11,271 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-04 21:31:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:11,272 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-04 21:31:11,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:31:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-04 21:31:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:31:11,273 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:11,273 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-04 21:31:11,273 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:11,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:11,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-04 21:31:11,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:11,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:31:11,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:11,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:11,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:31:11,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:31:11,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:31:11,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:31:11,896 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-04 21:31:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:11,926 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-04 21:31:11,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:31:11,927 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-04 21:31:11,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:11,927 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:31:11,927 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:31:11,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:31:11,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:31:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:31:11,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:31:11,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:31:11,932 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-04 21:31:11,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:11,932 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:31:11,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:31:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:31:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:31:11,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:11,933 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-04 21:31:11,934 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:11,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:11,934 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-04 21:31:11,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:11,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-04 21:31:11,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:12,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:12,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:31:12,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:31:12,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:31:12,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:31:12,207 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-04 21:31:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:12,235 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-04 21:31:12,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:31:12,235 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-04 21:31:12,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:12,236 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:31:12,236 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:31:12,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:31:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:31:12,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:31:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:31:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-04 21:31:12,240 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-04 21:31:12,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:12,241 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-04 21:31:12,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:31:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-04 21:31:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:31:12,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:12,242 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-04 21:31:12,242 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:12,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:12,242 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-04 21:31:12,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:12,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-04 21:31:12,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:12,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:12,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:31:12,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:31:12,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:31:12,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:31:12,644 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-04 21:31:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:12,678 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-04 21:31:12,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:31:12,679 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-04 21:31:12,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:12,679 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:31:12,679 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:31:12,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:31:12,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:31:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:31:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:31:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:31:12,683 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-04 21:31:12,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:12,683 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:31:12,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:31:12,684 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:31:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:31:12,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:12,684 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-04 21:31:12,685 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:12,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:12,685 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-04 21:31:12,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:12,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-04 21:31:12,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:13,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:13,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:31:13,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:31:13,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:31:13,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:31:13,213 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-04 21:31:13,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:13,305 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:31:13,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:31:13,308 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-04 21:31:13,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:13,308 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:31:13,309 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:31:13,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:31:13,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:31:13,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:31:13,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:31:13,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-04 21:31:13,313 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-04 21:31:13,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:13,313 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-04 21:31:13,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:31:13,313 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-04 21:31:13,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:31:13,314 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:13,314 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-04 21:31:13,314 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:13,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:13,315 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-04 21:31:13,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:13,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:31:13,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:13,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:13,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:31:13,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:31:13,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:31:13,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:31:13,818 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-04 21:31:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:13,854 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-04 21:31:13,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:31:13,854 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-04 21:31:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:13,855 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:31:13,855 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:31:13,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:31:13,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:31:13,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:31:13,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:31:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-04 21:31:13,859 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-04 21:31:13,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:13,860 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-04 21:31:13,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:31:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-04 21:31:13,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:31:13,860 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:13,861 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-04 21:31:13,861 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:13,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:13,861 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-04 21:31:13,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:13,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-04 21:31:13,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:14,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:14,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:31:14,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:31:14,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:31:14,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:31:14,613 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-04 21:31:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:14,677 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-04 21:31:14,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:31:14,678 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-04 21:31:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:14,678 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:31:14,679 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:31:14,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:31:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:31:14,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:31:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:31:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-04 21:31:14,683 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-04 21:31:14,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:14,683 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-04 21:31:14,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:31:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-04 21:31:14,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:31:14,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:14,684 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-04 21:31:14,685 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:14,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:14,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-04 21:31:14,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:14,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-04 21:31:14,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:15,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:15,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:31:15,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:31:15,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:31:15,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:31:15,497 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-04 21:31:15,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:15,547 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-04 21:31:15,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:31:15,548 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-04 21:31:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:15,548 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:31:15,549 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:31:15,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:31:15,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:31:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:31:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:31:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:31:15,553 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-04 21:31:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:15,553 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:31:15,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:31:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:31:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:31:15,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:15,554 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-04 21:31:15,554 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:15,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:15,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-04 21:31:15,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:15,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-04 21:31:15,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:16,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:16,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:31:16,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:31:16,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:31:16,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:31:16,203 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-04 21:31:16,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:16,273 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-04 21:31:16,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:31:16,274 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-04 21:31:16,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:16,274 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:31:16,275 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:31:16,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:31:16,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:31:16,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:31:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:31:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-04 21:31:16,277 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-04 21:31:16,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:16,277 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-04 21:31:16,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:31:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-04 21:31:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:31:16,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:16,278 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-04 21:31:16,278 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:16,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:16,279 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-04 21:31:16,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:16,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-04 21:31:16,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:17,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:17,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:31:17,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:31:17,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:31:17,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:31:17,323 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-04 21:31:17,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:17,464 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-04 21:31:17,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:31:17,465 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-04 21:31:17,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:17,465 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:31:17,465 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:31:17,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:31:17,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:31:17,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:31:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:31:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-04 21:31:17,468 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-04 21:31:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:17,468 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-04 21:31:17,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:31:17,469 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-04 21:31:17,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:31:17,472 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:17,472 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-04 21:31:17,472 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:17,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:17,473 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-04 21:31:17,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:17,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-04 21:31:17,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:18,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:18,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:31:18,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:31:18,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:31:18,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:31:18,068 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-04 21:31:18,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:18,121 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-04 21:31:18,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:31:18,122 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-04 21:31:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:18,122 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:31:18,122 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:31:18,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:31:18,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:31:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:31:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:31:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-04 21:31:18,126 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-04 21:31:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:18,126 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-04 21:31:18,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:31:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-04 21:31:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:31:18,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:18,127 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-04 21:31:18,127 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:18,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:18,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-04 21:31:18,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:18,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:31:18,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:18,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:18,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:31:18,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:31:18,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:31:18,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:31:18,869 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-04 21:31:18,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:18,927 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-04 21:31:18,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:31:18,928 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-04 21:31:18,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:18,928 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:31:18,928 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:31:18,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:31:18,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:31:18,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:31:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:31:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-04 21:31:18,932 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-04 21:31:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:18,933 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-04 21:31:18,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:31:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-04 21:31:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:31:18,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:18,935 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-04 21:31:18,935 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:18,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:18,935 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-04 21:31:18,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:18,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-04 21:31:18,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:19,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:19,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:31:19,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:31:19,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:31:19,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:31:19,708 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-04 21:31:19,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:19,767 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-04 21:31:19,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:31:19,768 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-04 21:31:19,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:19,769 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:31:19,769 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:31:19,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:31:19,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:31:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:31:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:31:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-04 21:31:19,773 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-04 21:31:19,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:19,773 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-04 21:31:19,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:31:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-04 21:31:19,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:31:19,774 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:19,774 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-04 21:31:19,774 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:19,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:19,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-04 21:31:19,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:19,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-04 21:31:19,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:20,392 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:20,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:20,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:31:20,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:31:20,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:31:20,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:31:20,394 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-04 21:31:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:20,454 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-04 21:31:20,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:31:20,455 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-04 21:31:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:20,455 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:31:20,456 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:31:20,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:31:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:31:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:31:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:31:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-04 21:31:20,460 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-04 21:31:20,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:20,460 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-04 21:31:20,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:31:20,460 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-04 21:31:20,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:31:20,460 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:20,460 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-04 21:31:20,461 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:20,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:20,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-04 21:31:20,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:20,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-04 21:31:20,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:21,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:21,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:31:21,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:31:21,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:31:21,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:31:21,537 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-04 21:31:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:21,589 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-04 21:31:21,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:31:21,589 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-04 21:31:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:21,590 INFO L225 Difference]: With dead ends: 36 [2019-08-04 21:31:21,590 INFO L226 Difference]: Without dead ends: 36 [2019-08-04 21:31:21,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:31:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-04 21:31:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-04 21:31:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:31:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-04 21:31:21,593 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-04 21:31:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:21,593 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-04 21:31:21,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:31:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-04 21:31:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:31:21,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:21,594 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-04 21:31:21,594 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:21,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:21,595 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-04 21:31:21,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:21,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:31:21,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:22,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:22,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:31:22,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:31:22,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:31:22,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:31:22,160 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-04 21:31:22,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:22,206 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-04 21:31:22,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:31:22,206 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-04 21:31:22,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:22,207 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:31:22,207 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:31:22,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:31:22,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:31:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:31:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:31:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-04 21:31:22,211 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-04 21:31:22,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:22,211 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-04 21:31:22,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:31:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-04 21:31:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:31:22,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:22,212 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-04 21:31:22,212 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:22,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:22,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-04 21:31:22,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:22,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-04 21:31:22,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:23,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:23,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:31:23,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:31:23,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:31:23,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:31:23,181 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-04 21:31:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:23,225 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-04 21:31:23,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:31:23,225 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-04 21:31:23,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:23,226 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:31:23,226 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:31:23,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:31:23,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:31:23,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:31:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:31:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-04 21:31:23,230 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-04 21:31:23,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:23,230 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-04 21:31:23,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:31:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-04 21:31:23,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:31:23,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:23,230 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-04 21:31:23,231 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:23,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:23,231 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-04 21:31:23,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:23,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:31:23,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:23,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:23,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:31:23,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:31:23,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:31:23,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:31:23,880 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-04 21:31:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:23,922 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-04 21:31:23,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:31:23,923 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-04 21:31:23,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:23,924 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:31:23,924 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:31:23,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:31:23,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:31:23,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:31:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:31:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-04 21:31:23,927 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-04 21:31:23,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:23,928 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-04 21:31:23,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:31:23,928 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-04 21:31:23,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:31:23,928 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:23,929 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-04 21:31:23,929 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:23,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:23,929 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-04 21:31:23,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:23,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-04 21:31:23,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:25,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:25,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:31:25,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:31:25,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:31:25,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:31:25,638 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-04 21:31:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:25,703 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-04 21:31:25,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:31:25,704 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-04 21:31:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:25,704 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:31:25,705 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:31:25,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:31:25,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:31:25,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:31:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:31:25,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-04 21:31:25,708 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-04 21:31:25,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:25,708 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-04 21:31:25,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:31:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-04 21:31:25,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:31:25,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:25,709 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-04 21:31:25,709 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:25,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:25,710 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-04 21:31:25,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:25,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-04 21:31:25,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:26,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:26,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:31:26,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:31:26,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:31:26,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:31:26,415 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-04 21:31:26,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:26,461 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-04 21:31:26,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:31:26,461 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-04 21:31:26,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:26,462 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:31:26,462 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:31:26,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:31:26,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:31:26,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:31:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:31:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:31:26,466 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-04 21:31:26,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:26,466 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:31:26,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:31:26,466 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:31:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:31:26,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:26,467 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-04 21:31:26,467 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:26,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:26,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-04 21:31:26,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:26,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-04 21:31:26,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:27,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:27,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:31:27,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:31:27,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:31:27,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:31:27,103 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-04 21:31:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:27,180 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-04 21:31:27,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:31:27,180 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-04 21:31:27,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:27,181 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:31:27,181 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:31:27,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:31:27,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:31:27,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:31:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:31:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-04 21:31:27,187 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-04 21:31:27,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:27,187 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-04 21:31:27,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:31:27,189 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-04 21:31:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:31:27,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:27,190 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-04 21:31:27,190 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:27,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:27,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-04 21:31:27,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:27,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-04 21:31:27,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:29,192 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:29,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:29,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:31:29,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:31:29,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:31:29,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:31:29,193 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-04 21:31:29,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:29,256 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-04 21:31:29,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:31:29,256 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-04 21:31:29,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:29,257 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:31:29,257 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:31:29,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:31:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:31:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:31:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:31:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-04 21:31:29,261 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-04 21:31:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:29,261 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-04 21:31:29,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:31:29,262 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-04 21:31:29,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:31:29,262 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:29,262 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-04 21:31:29,262 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:29,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:29,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-04 21:31:29,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:29,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:31:29,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:29,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:29,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:31:29,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:31:29,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:31:29,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:31:29,981 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-04 21:31:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:30,107 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-04 21:31:30,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:31:30,107 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-04 21:31:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:30,108 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:31:30,108 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:31:30,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:31:30,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:31:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-04 21:31:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:31:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-04 21:31:30,110 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-04 21:31:30,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:30,110 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-04 21:31:30,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:31:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-04 21:31:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-04 21:31:30,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:30,111 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-04 21:31:30,111 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:30,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:30,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-04 21:31:30,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:30,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-04 21:31:30,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:30,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:30,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:31:30,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:31:30,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:31:30,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:31:30,880 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-04 21:31:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:30,962 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-04 21:31:30,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:31:30,963 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-04 21:31:30,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:30,963 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:31:30,963 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:31:30,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:31:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:31:30,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:31:30,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:31:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-04 21:31:30,966 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-04 21:31:30,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:30,966 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-04 21:31:30,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:31:30,966 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-04 21:31:30,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:31:30,967 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:30,967 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-04 21:31:30,967 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:30,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:30,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-04 21:31:30,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:30,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-04 21:31:31,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:32,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:32,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:31:32,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:31:32,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:31:32,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:31:32,043 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-04 21:31:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:32,116 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-04 21:31:32,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:31:32,116 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-04 21:31:32,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:32,117 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:31:32,117 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:31:32,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:31:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:31:32,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:31:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:31:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-04 21:31:32,119 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-04 21:31:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:32,119 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-04 21:31:32,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:31:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-04 21:31:32,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:31:32,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:32,120 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-04 21:31:32,120 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:32,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:32,121 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-04 21:31:32,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:32,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-04 21:31:32,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:32,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:32,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:31:32,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:31:32,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:31:32,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:31:32,891 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-04 21:31:32,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:32,948 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-04 21:31:32,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:31:32,948 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-04 21:31:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:32,949 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:31:32,949 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:31:32,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:31:32,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:31:32,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:31:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:31:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-04 21:31:32,952 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-04 21:31:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:32,952 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-04 21:31:32,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:31:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-04 21:31:32,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:31:32,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:32,953 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-04 21:31:32,954 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:32,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:32,954 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-04 21:31:32,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:32,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-04 21:31:32,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:33,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:33,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:31:33,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:31:33,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:31:33,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:31:33,799 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-04 21:31:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:33,880 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-04 21:31:33,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:31:33,881 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-04 21:31:33,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:33,881 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:31:33,881 INFO L226 Difference]: Without dead ends: 48 [2019-08-04 21:31:33,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:31:33,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-04 21:31:33,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-04 21:31:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:31:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-04 21:31:33,883 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-04 21:31:33,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:33,884 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-04 21:31:33,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:31:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-04 21:31:33,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:31:33,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:33,885 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-04 21:31:33,885 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:33,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:33,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-04 21:31:33,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:33,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-04 21:31:33,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:34,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:34,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:31:34,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:31:34,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:31:34,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:31:34,808 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-04 21:31:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:34,886 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-04 21:31:34,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:31:34,886 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-04 21:31:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:34,887 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:31:34,887 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:31:34,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:31:34,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:31:34,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:31:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:31:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-04 21:31:34,891 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-04 21:31:34,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:34,891 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-04 21:31:34,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:31:34,892 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-04 21:31:34,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:31:34,892 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:34,892 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-04 21:31:34,893 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:34,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:34,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-04 21:31:34,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:34,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-04 21:31:34,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:36,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:36,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:36,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:31:36,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:31:36,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:31:36,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:31:36,277 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-04 21:31:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:36,562 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-04 21:31:36,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:31:36,562 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-04 21:31:36,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:36,563 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:31:36,563 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:31:36,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:31:36,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:31:36,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:31:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:31:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-04 21:31:36,566 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-04 21:31:36,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:36,566 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-04 21:31:36,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:31:36,566 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-04 21:31:36,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:31:36,566 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:36,567 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-04 21:31:36,567 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:36,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:36,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-04 21:31:36,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:36,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-04 21:31:36,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:37,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:37,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:31:37,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:31:37,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:31:37,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:31:37,679 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-04 21:31:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:37,748 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-04 21:31:37,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:31:37,749 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-04 21:31:37,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:37,750 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:31:37,750 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:31:37,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:31:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:31:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:31:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:31:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-04 21:31:37,753 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-04 21:31:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:37,753 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-04 21:31:37,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:31:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-04 21:31:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:31:37,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:37,754 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-04 21:31:37,754 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:37,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:37,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-04 21:31:37,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:37,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-04 21:31:37,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:38,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:38,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:31:38,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:31:38,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:31:38,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:31:38,711 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-04 21:31:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:38,770 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-04 21:31:38,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:31:38,771 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-04 21:31:38,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:38,772 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:31:38,772 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:31:38,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:31:38,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:31:38,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:31:38,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:31:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-04 21:31:38,775 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-04 21:31:38,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:38,776 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-04 21:31:38,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:31:38,776 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-04 21:31:38,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:31:38,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:38,776 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-04 21:31:38,777 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:38,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:38,777 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-04 21:31:38,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:38,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-04 21:31:38,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:39,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:39,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:31:39,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:31:39,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:31:39,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:31:39,792 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-04 21:31:39,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:39,873 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-04 21:31:39,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:31:39,873 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-04 21:31:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:39,874 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:31:39,874 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:31:39,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:31:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:31:39,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:31:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:31:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:31:39,878 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-04 21:31:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:39,878 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:31:39,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:31:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:31:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:31:39,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:39,879 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-04 21:31:39,879 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:39,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:39,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-04 21:31:39,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:39,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-04 21:31:39,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:40,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:40,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:31:40,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:31:40,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:31:40,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:31:40,886 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-04 21:31:40,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:40,955 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-04 21:31:40,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:31:40,956 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-04 21:31:40,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:40,957 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:31:40,957 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:31:40,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:31:40,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:31:40,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:31:40,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:31:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-04 21:31:40,960 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-04 21:31:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:40,960 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-04 21:31:40,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:31:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-04 21:31:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:31:40,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:40,961 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-04 21:31:40,961 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:40,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:40,961 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-04 21:31:40,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:40,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-04 21:31:40,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:42,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:42,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:31:42,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:31:42,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:31:42,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:31:42,343 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-04 21:31:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:42,423 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-04 21:31:42,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:31:42,423 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-04 21:31:42,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:42,424 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:31:42,424 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:31:42,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:31:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:31:42,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:31:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:31:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-04 21:31:42,426 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-04 21:31:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:42,426 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-04 21:31:42,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:31:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-04 21:31:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:31:42,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:42,427 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-04 21:31:42,427 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:42,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-04 21:31:42,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:42,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-04 21:31:42,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:43,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:43,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:31:43,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:31:43,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:31:43,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:31:43,487 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-04 21:31:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:43,586 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-04 21:31:43,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:31:43,587 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-04 21:31:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:43,588 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:31:43,588 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:31:43,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:31:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:31:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:31:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:31:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-04 21:31:43,591 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-04 21:31:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:43,591 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-04 21:31:43,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:31:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-04 21:31:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:31:43,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:43,592 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-04 21:31:43,592 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:43,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:43,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-04 21:31:43,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:43,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-04 21:31:43,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:44,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:44,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:31:44,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:31:44,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:31:44,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:31:44,974 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-04 21:31:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:45,052 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-04 21:31:45,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:31:45,052 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-04 21:31:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:45,053 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:31:45,053 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:31:45,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:31:45,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:31:45,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:31:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:31:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-04 21:31:45,056 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-04 21:31:45,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:45,056 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-04 21:31:45,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:31:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-04 21:31:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:31:45,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:45,057 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-04 21:31:45,057 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:45,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:45,058 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-04 21:31:45,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:45,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-04 21:31:45,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:46,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:46,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:31:46,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:31:46,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:31:46,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:31:46,415 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-04 21:31:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:46,482 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-04 21:31:46,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:31:46,483 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-04 21:31:46,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:46,484 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:31:46,484 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:31:46,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:31:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:31:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:31:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:31:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-04 21:31:46,487 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-04 21:31:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:46,487 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-04 21:31:46,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:31:46,487 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-04 21:31:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:31:46,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:46,488 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-04 21:31:46,488 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:46,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:46,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-04 21:31:46,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:46,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-04 21:31:46,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:47,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:47,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:31:47,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:31:47,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:31:47,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:31:47,888 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-04 21:31:47,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:47,970 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-04 21:31:47,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:31:47,970 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-04 21:31:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:47,971 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:31:47,971 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:31:47,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:31:47,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:31:47,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:31:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:31:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-04 21:31:47,973 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-04 21:31:47,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:47,973 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-04 21:31:47,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:31:47,973 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-04 21:31:47,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:31:47,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:47,974 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-04 21:31:47,974 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:47,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:47,974 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-04 21:31:47,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:48,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-04 21:31:48,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:49,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:49,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:31:49,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:31:49,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:31:49,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:31:49,143 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-04 21:31:49,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:49,222 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-04 21:31:49,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:31:49,222 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-04 21:31:49,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:49,223 INFO L225 Difference]: With dead ends: 60 [2019-08-04 21:31:49,223 INFO L226 Difference]: Without dead ends: 60 [2019-08-04 21:31:49,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:31:49,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-04 21:31:49,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-04 21:31:49,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:31:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-04 21:31:49,226 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-04 21:31:49,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:49,227 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-04 21:31:49,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:31:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-04 21:31:49,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-04 21:31:49,227 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:49,227 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-04 21:31:49,228 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:49,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:49,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-04 21:31:49,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:49,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-04 21:31:49,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:50,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:50,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:31:50,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:31:50,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:31:50,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:31:50,505 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-04 21:31:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:50,580 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-04 21:31:50,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:31:50,580 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-04 21:31:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:50,581 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:31:50,581 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:31:50,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:31:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:31:50,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:31:50,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:31:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-04 21:31:50,585 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-04 21:31:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:50,585 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-04 21:31:50,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:31:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-04 21:31:50,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:31:50,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:50,586 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-04 21:31:50,586 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:50,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:50,586 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-04 21:31:50,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:50,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-04 21:31:50,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:53,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:53,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:31:53,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:31:53,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:31:53,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:31:53,137 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-04 21:31:53,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:53,208 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-04 21:31:53,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:31:53,209 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-04 21:31:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:53,209 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:31:53,210 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:31:53,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:31:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:31:53,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-04 21:31:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:31:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-04 21:31:53,213 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-04 21:31:53,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:53,213 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-04 21:31:53,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:31:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-04 21:31:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-04 21:31:53,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:53,214 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-04 21:31:53,214 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:53,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:53,214 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-04 21:31:53,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:53,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-04 21:31:53,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:54,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:54,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:31:54,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:31:54,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:31:54,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:31:54,562 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-04 21:31:54,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:54,635 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-04 21:31:54,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:31:54,635 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-04 21:31:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:54,636 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:31:54,636 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:31:54,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:31:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:31:54,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:31:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:31:54,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-04 21:31:54,639 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-04 21:31:54,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:54,639 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-04 21:31:54,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:31:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-04 21:31:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:31:54,640 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:54,640 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-04 21:31:54,640 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:54,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:54,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-04 21:31:54,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:54,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-04 21:31:54,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:56,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:56,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:31:56,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:31:56,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:31:56,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:31:56,125 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-04 21:31:56,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:56,216 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-04 21:31:56,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:31:56,217 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-04 21:31:56,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:56,218 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:31:56,218 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:31:56,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:31:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:31:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-04 21:31:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:31:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-04 21:31:56,221 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-04 21:31:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:56,221 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-04 21:31:56,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:31:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-04 21:31:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:31:56,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:56,222 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-04 21:31:56,222 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:56,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:56,222 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-04 21:31:56,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:56,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-04 21:31:56,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:57,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:57,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:31:57,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:31:57,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:31:57,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:31:57,995 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-04 21:31:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:58,087 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-04 21:31:58,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:31:58,088 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-04 21:31:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:58,088 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:31:58,088 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:31:58,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:31:58,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:31:58,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:31:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:31:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-04 21:31:58,090 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-04 21:31:58,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:58,090 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-04 21:31:58,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:31:58,091 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-04 21:31:58,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:31:58,091 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:58,091 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-04 21:31:58,091 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:58,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:58,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-04 21:31:58,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:58,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-04 21:31:58,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:31:59,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:59,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:31:59,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:31:59,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:31:59,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:31:59,552 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-04 21:31:59,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:59,682 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-04 21:31:59,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:31:59,682 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-04 21:31:59,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:59,683 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:31:59,683 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:31:59,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:31:59,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:31:59,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-04 21:31:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:31:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-04 21:31:59,686 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-04 21:31:59,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:59,687 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-04 21:31:59,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:31:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-04 21:31:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-04 21:31:59,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:59,688 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-04 21:31:59,688 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:59,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:59,688 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-04 21:31:59,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:59,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-04 21:31:59,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:01,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:01,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:32:01,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:32:01,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:32:01,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:32:01,445 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-04 21:32:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:01,540 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-04 21:32:01,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:32:01,540 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-04 21:32:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:01,541 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:32:01,541 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:32:01,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:32:01,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:32:01,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:32:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:32:01,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-04 21:32:01,547 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-04 21:32:01,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:01,547 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-04 21:32:01,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:32:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-04 21:32:01,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:32:01,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:01,548 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-04 21:32:01,548 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:01,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:01,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-04 21:32:01,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:01,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-04 21:32:01,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:03,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:03,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:32:03,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:32:03,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:32:03,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:32:03,326 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-04 21:32:03,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:03,422 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-04 21:32:03,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:32:03,426 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-04 21:32:03,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:03,427 INFO L225 Difference]: With dead ends: 68 [2019-08-04 21:32:03,427 INFO L226 Difference]: Without dead ends: 68 [2019-08-04 21:32:03,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:32:03,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-04 21:32:03,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-04 21:32:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-04 21:32:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-04 21:32:03,430 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-04 21:32:03,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:03,430 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-04 21:32:03,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:32:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-04 21:32:03,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-04 21:32:03,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:03,431 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-04 21:32:03,431 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:03,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:03,431 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-04 21:32:03,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:03,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-04 21:32:03,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:05,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:05,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:32:05,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:32:05,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:32:05,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:32:05,093 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-04 21:32:05,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:05,181 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-04 21:32:05,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:32:05,181 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-04 21:32:05,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:05,182 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:32:05,182 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:32:05,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:32:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:32:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:32:05,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:32:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-04 21:32:05,185 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-04 21:32:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:05,186 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-04 21:32:05,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:32:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-04 21:32:05,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:32:05,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:05,186 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-04 21:32:05,187 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:05,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:05,187 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-04 21:32:05,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:05,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-04 21:32:05,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:06,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:06,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:32:06,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:32:06,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:32:06,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:32:06,936 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-04 21:32:07,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:07,025 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-04 21:32:07,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:32:07,026 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-04 21:32:07,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:07,027 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:32:07,027 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:32:07,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:32:07,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:32:07,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-04 21:32:07,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:32:07,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-04 21:32:07,029 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-04 21:32:07,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:07,030 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-04 21:32:07,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:32:07,030 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-04 21:32:07,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-04 21:32:07,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:07,030 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-04 21:32:07,030 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:07,031 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-04 21:32:07,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:07,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-04 21:32:07,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:10,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:10,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:32:10,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:32:10,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:32:10,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:32:10,029 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-04 21:32:10,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:10,124 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-04 21:32:10,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:32:10,125 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-04 21:32:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:10,125 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:32:10,126 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:32:10,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:32:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:32:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:32:10,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:32:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-04 21:32:10,128 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-04 21:32:10,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:10,129 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-04 21:32:10,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:32:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-04 21:32:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:32:10,130 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:10,130 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-04 21:32:10,130 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:10,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:10,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-04 21:32:10,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:10,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-04 21:32:10,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:11,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:11,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:32:11,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:32:11,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:32:11,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:32:11,892 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-04 21:32:11,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:11,986 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-04 21:32:11,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:32:11,986 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-04 21:32:11,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:11,987 INFO L225 Difference]: With dead ends: 72 [2019-08-04 21:32:11,987 INFO L226 Difference]: Without dead ends: 72 [2019-08-04 21:32:11,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:32:11,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-04 21:32:11,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-04 21:32:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-04 21:32:11,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-04 21:32:11,990 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-04 21:32:11,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:11,990 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-04 21:32:11,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:32:11,990 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-04 21:32:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-04 21:32:11,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:11,991 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-04 21:32:11,991 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:11,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:11,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-04 21:32:11,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:12,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-04 21:32:12,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:14,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:14,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:32:14,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:32:14,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:32:14,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:32:14,026 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-04 21:32:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:14,138 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-04 21:32:14,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:32:14,138 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-04 21:32:14,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:14,139 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:32:14,139 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:32:14,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:32:14,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:32:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:32:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:32:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-04 21:32:14,142 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-04 21:32:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:14,143 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-04 21:32:14,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:32:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-04 21:32:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:32:14,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:14,143 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-04 21:32:14,144 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:14,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-04 21:32:14,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:14,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-04 21:32:14,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:15,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:15,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:15,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:32:15,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:32:15,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:32:15,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:32:15,942 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-04 21:32:16,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:16,044 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-04 21:32:16,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:32:16,044 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-04 21:32:16,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:16,045 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:32:16,046 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:32:16,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:32:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:32:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-04 21:32:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-04 21:32:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-04 21:32:16,049 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-04 21:32:16,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:16,050 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-04 21:32:16,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:32:16,050 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-04 21:32:16,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-04 21:32:16,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:16,050 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-04 21:32:16,051 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:16,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:16,051 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-04 21:32:16,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:16,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-04 21:32:16,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:18,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:18,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:32:18,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:32:18,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:32:18,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:32:18,187 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-04 21:32:18,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:18,311 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-04 21:32:18,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:32:18,311 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-04 21:32:18,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:18,312 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:32:18,312 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:32:18,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:32:18,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:32:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:32:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:32:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-04 21:32:18,315 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-04 21:32:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:18,315 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-04 21:32:18,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:32:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-04 21:32:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:32:18,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:18,316 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-04 21:32:18,316 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:18,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:18,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-04 21:32:18,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:18,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-04 21:32:18,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:20,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:20,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:20,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:32:20,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:32:20,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:32:20,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:32:20,232 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-04 21:32:20,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:20,327 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-04 21:32:20,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:32:20,328 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-04 21:32:20,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:20,329 INFO L225 Difference]: With dead ends: 76 [2019-08-04 21:32:20,329 INFO L226 Difference]: Without dead ends: 76 [2019-08-04 21:32:20,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:32:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-04 21:32:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-04 21:32:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-04 21:32:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-04 21:32:20,332 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-04 21:32:20,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:20,332 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-04 21:32:20,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:32:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-04 21:32:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-04 21:32:20,333 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:20,333 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-04 21:32:20,333 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:20,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:20,334 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-04 21:32:20,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:20,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-04 21:32:20,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:22,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:22,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:32:22,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:32:22,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:32:22,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:32:22,694 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-04 21:32:22,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:22,841 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-04 21:32:22,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:32:22,841 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-04 21:32:22,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:22,842 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:32:22,842 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:32:22,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:32:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:32:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:32:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:32:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-04 21:32:22,845 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-04 21:32:22,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:22,845 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-04 21:32:22,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:32:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-04 21:32:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:32:22,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:22,846 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-04 21:32:22,846 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:22,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:22,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-04 21:32:22,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:22,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-04 21:32:22,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:24,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:24,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:32:24,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:32:24,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:32:24,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:32:24,843 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-04 21:32:24,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:24,940 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-04 21:32:24,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:32:24,940 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-04 21:32:24,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:24,941 INFO L225 Difference]: With dead ends: 78 [2019-08-04 21:32:24,941 INFO L226 Difference]: Without dead ends: 78 [2019-08-04 21:32:24,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:32:24,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-04 21:32:24,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-04 21:32:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-04 21:32:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-04 21:32:24,944 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-04 21:32:24,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:24,944 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-04 21:32:24,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:32:24,945 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-04 21:32:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-04 21:32:24,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:24,945 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-04 21:32:24,946 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:24,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:24,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-04 21:32:24,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:25,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-04 21:32:25,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:27,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:27,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:32:27,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:32:27,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:32:27,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:32:27,270 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-04 21:32:27,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:27,361 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-04 21:32:27,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:32:27,362 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-04 21:32:27,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:27,363 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:32:27,363 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:32:27,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:32:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:32:27,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:32:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:32:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-04 21:32:27,366 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-04 21:32:27,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:27,366 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-04 21:32:27,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:32:27,367 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-04 21:32:27,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:32:27,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:27,367 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-04 21:32:27,367 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:27,367 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-04 21:32:27,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:27,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-04 21:32:27,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:29,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:29,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:32:29,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:32:29,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:32:29,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:32:29,744 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-04 21:32:29,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:29,847 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-04 21:32:29,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:32:29,847 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-04 21:32:29,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:29,848 INFO L225 Difference]: With dead ends: 80 [2019-08-04 21:32:29,848 INFO L226 Difference]: Without dead ends: 80 [2019-08-04 21:32:29,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:32:29,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-04 21:32:29,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-04 21:32:29,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-04 21:32:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-04 21:32:29,851 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-04 21:32:29,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:29,851 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-04 21:32:29,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:32:29,851 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-04 21:32:29,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-04 21:32:29,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:29,852 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-04 21:32:29,852 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:29,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:29,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-04 21:32:29,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:29,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-04 21:32:29,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:31,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:31,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-04 21:32:31,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-04 21:32:31,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-04 21:32:31,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:32:31,949 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-04 21:32:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:32,067 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-04 21:32:32,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-04 21:32:32,068 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-04 21:32:32,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:32,069 INFO L225 Difference]: With dead ends: 81 [2019-08-04 21:32:32,069 INFO L226 Difference]: Without dead ends: 81 [2019-08-04 21:32:32,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:32:32,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-04 21:32:32,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-04 21:32:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:32:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-04 21:32:32,072 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-04 21:32:32,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:32,072 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-04 21:32:32,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-04 21:32:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-04 21:32:32,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:32:32,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:32,073 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-04 21:32:32,073 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:32,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:32,074 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-04 21:32:32,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:32,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-04 21:32:32,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:34,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:34,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-04 21:32:34,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-04 21:32:34,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-04 21:32:34,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:32:34,564 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-04 21:32:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:34,981 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-04 21:32:34,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-04 21:32:34,981 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-04 21:32:34,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:34,982 INFO L225 Difference]: With dead ends: 82 [2019-08-04 21:32:34,982 INFO L226 Difference]: Without dead ends: 82 [2019-08-04 21:32:34,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:32:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-04 21:32:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-04 21:32:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-04 21:32:34,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-04 21:32:34,985 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-04 21:32:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:34,985 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-04 21:32:34,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-04 21:32:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-04 21:32:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-04 21:32:34,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:34,986 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-04 21:32:34,986 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:34,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:34,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-04 21:32:34,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:35,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-04 21:32:35,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:37,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:37,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:37,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-04 21:32:37,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-04 21:32:37,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-04 21:32:37,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:32:37,298 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-04 21:32:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:37,461 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-04 21:32:37,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-04 21:32:37,461 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-04 21:32:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:37,462 INFO L225 Difference]: With dead ends: 83 [2019-08-04 21:32:37,462 INFO L226 Difference]: Without dead ends: 83 [2019-08-04 21:32:37,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:32:37,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-04 21:32:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-04 21:32:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-04 21:32:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-04 21:32:37,464 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-04 21:32:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:37,464 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-04 21:32:37,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-04 21:32:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-04 21:32:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-04 21:32:37,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:37,466 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-04 21:32:37,466 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:37,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:37,466 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-08-04 21:32:37,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:37,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-04 21:32:37,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:40,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:40,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:40,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-04 21:32:40,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-04 21:32:40,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-04 21:32:40,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:32:40,077 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-04 21:32:40,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:40,186 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-04 21:32:40,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-04 21:32:40,187 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-04 21:32:40,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:40,187 INFO L225 Difference]: With dead ends: 84 [2019-08-04 21:32:40,188 INFO L226 Difference]: Without dead ends: 84 [2019-08-04 21:32:40,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:32:40,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-04 21:32:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-04 21:32:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-04 21:32:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-04 21:32:40,190 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-04 21:32:40,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:40,190 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-04 21:32:40,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-04 21:32:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-04 21:32:40,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-04 21:32:40,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:40,191 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-04 21:32:40,191 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:40,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:40,192 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-08-04 21:32:40,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:40,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-04 21:32:40,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:42,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:42,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-04 21:32:42,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-04 21:32:42,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-04 21:32:42,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:32:42,562 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-04 21:32:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:42,677 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-04 21:32:42,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-04 21:32:42,677 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-04 21:32:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:42,678 INFO L225 Difference]: With dead ends: 85 [2019-08-04 21:32:42,678 INFO L226 Difference]: Without dead ends: 85 [2019-08-04 21:32:42,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:32:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-04 21:32:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-04 21:32:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-04 21:32:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-04 21:32:42,680 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-04 21:32:42,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:42,680 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-04 21:32:42,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-04 21:32:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-04 21:32:42,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-04 21:32:42,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:42,681 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-04 21:32:42,682 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:42,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:42,682 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-08-04 21:32:42,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:42,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-04 21:32:42,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:45,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:45,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-04 21:32:45,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-04 21:32:45,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-04 21:32:45,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:32:45,355 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-04 21:32:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:45,620 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-04 21:32:45,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-04 21:32:45,620 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-04 21:32:45,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:45,621 INFO L225 Difference]: With dead ends: 86 [2019-08-04 21:32:45,621 INFO L226 Difference]: Without dead ends: 86 [2019-08-04 21:32:45,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:32:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-04 21:32:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-04 21:32:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-04 21:32:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-04 21:32:45,624 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-04 21:32:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:45,624 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-04 21:32:45,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-04 21:32:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-04 21:32:45,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-04 21:32:45,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:45,625 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-04 21:32:45,625 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:45,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:45,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-08-04 21:32:45,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:45,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-04 21:32:45,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:48,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:48,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-04 21:32:48,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-04 21:32:48,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-04 21:32:48,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:32:48,574 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-04 21:32:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:48,686 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-04 21:32:48,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-04 21:32:48,687 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-04 21:32:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:48,688 INFO L225 Difference]: With dead ends: 87 [2019-08-04 21:32:48,688 INFO L226 Difference]: Without dead ends: 87 [2019-08-04 21:32:48,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:32:48,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-04 21:32:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-04 21:32:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-04 21:32:48,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-04 21:32:48,690 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-04 21:32:48,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:48,691 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-04 21:32:48,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-04 21:32:48,691 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-04 21:32:48,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-04 21:32:48,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:48,692 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-04 21:32:48,692 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:48,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:48,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-08-04 21:32:48,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:48,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-04 21:32:48,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:51,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:51,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:51,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-04 21:32:51,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-04 21:32:51,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-04 21:32:51,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:32:51,256 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-04 21:32:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:51,499 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-04 21:32:51,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-04 21:32:51,499 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-04 21:32:51,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:51,500 INFO L225 Difference]: With dead ends: 88 [2019-08-04 21:32:51,500 INFO L226 Difference]: Without dead ends: 88 [2019-08-04 21:32:51,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:32:51,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-04 21:32:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-04 21:32:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-04 21:32:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-04 21:32:51,503 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-04 21:32:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:51,504 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-04 21:32:51,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-04 21:32:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-04 21:32:51,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-04 21:32:51,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:51,504 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-04 21:32:51,505 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:51,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:51,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-08-04 21:32:51,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:51,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-04 21:32:51,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:54,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:54,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-04 21:32:54,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-04 21:32:54,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-04 21:32:54,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:32:54,308 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-04 21:32:54,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:54,430 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-04 21:32:54,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-04 21:32:54,431 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-04 21:32:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:54,432 INFO L225 Difference]: With dead ends: 89 [2019-08-04 21:32:54,432 INFO L226 Difference]: Without dead ends: 89 [2019-08-04 21:32:54,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:32:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-04 21:32:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-04 21:32:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-04 21:32:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-04 21:32:54,434 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-04 21:32:54,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:54,434 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-04 21:32:54,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-04 21:32:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-04 21:32:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-04 21:32:54,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:54,436 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-04 21:32:54,436 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:54,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:54,436 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-08-04 21:32:54,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:54,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-04 21:32:54,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:32:57,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:57,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-04 21:32:57,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-04 21:32:57,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-04 21:32:57,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:32:57,086 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-04 21:32:57,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:57,293 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-04 21:32:57,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-04 21:32:57,294 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-04 21:32:57,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:57,295 INFO L225 Difference]: With dead ends: 90 [2019-08-04 21:32:57,295 INFO L226 Difference]: Without dead ends: 90 [2019-08-04 21:32:57,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:32:57,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-04 21:32:57,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-04 21:32:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-04 21:32:57,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-04 21:32:57,298 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-04 21:32:57,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:57,298 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-04 21:32:57,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-04 21:32:57,298 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-04 21:32:57,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-04 21:32:57,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:57,299 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-04 21:32:57,299 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:57,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:57,299 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-08-04 21:32:57,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:57,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-04 21:32:57,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:33:00,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:00,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-04 21:33:00,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-04 21:33:00,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-04 21:33:00,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:33:00,222 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-04 21:33:00,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:00,349 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-04 21:33:00,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-04 21:33:00,349 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-04 21:33:00,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:00,350 INFO L225 Difference]: With dead ends: 91 [2019-08-04 21:33:00,350 INFO L226 Difference]: Without dead ends: 91 [2019-08-04 21:33:00,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:33:00,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-04 21:33:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-04 21:33:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-04 21:33:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-04 21:33:00,352 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-04 21:33:00,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:00,352 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-04 21:33:00,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-04 21:33:00,352 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-04 21:33:00,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-04 21:33:00,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:00,353 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-04 21:33:00,353 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:00,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:00,354 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-08-04 21:33:00,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:00,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-04 21:33:00,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:33:03,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:03,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-04 21:33:03,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-04 21:33:03,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-04 21:33:03,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-04 21:33:03,112 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-04 21:33:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:03,224 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-04 21:33:03,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-04 21:33:03,224 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-04 21:33:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:03,225 INFO L225 Difference]: With dead ends: 92 [2019-08-04 21:33:03,225 INFO L226 Difference]: Without dead ends: 92 [2019-08-04 21:33:03,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-04 21:33:03,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-04 21:33:03,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-04 21:33:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-04 21:33:03,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-04 21:33:03,228 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-04 21:33:03,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:03,228 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-04 21:33:03,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-04 21:33:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-04 21:33:03,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-04 21:33:03,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:03,229 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-04 21:33:03,229 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:03,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:03,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-08-04 21:33:03,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:03,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-04 21:33:03,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:33:06,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:06,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-04 21:33:06,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-04 21:33:06,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-04 21:33:06,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:33:06,434 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-04 21:33:06,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:06,576 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-04 21:33:06,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-04 21:33:06,577 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-04 21:33:06,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:06,577 INFO L225 Difference]: With dead ends: 93 [2019-08-04 21:33:06,577 INFO L226 Difference]: Without dead ends: 93 [2019-08-04 21:33:06,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:33:06,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-04 21:33:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-04 21:33:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-04 21:33:06,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-04 21:33:06,579 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-04 21:33:06,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:06,580 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-04 21:33:06,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-04 21:33:06,580 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-04 21:33:06,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-04 21:33:06,580 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:06,581 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-04 21:33:06,581 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:06,581 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-08-04 21:33:06,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:06,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-04 21:33:06,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:33:09,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:09,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-04 21:33:09,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-04 21:33:09,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-04 21:33:09,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:33:09,705 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-04 21:33:10,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:10,312 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-04 21:33:10,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-04 21:33:10,313 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-04 21:33:10,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:10,313 INFO L225 Difference]: With dead ends: 94 [2019-08-04 21:33:10,313 INFO L226 Difference]: Without dead ends: 94 [2019-08-04 21:33:10,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:33:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-04 21:33:10,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-04 21:33:10,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-04 21:33:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-04 21:33:10,316 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-04 21:33:10,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:10,316 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-04 21:33:10,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-04 21:33:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-04 21:33:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-04 21:33:10,317 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:10,317 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-04 21:33:10,317 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:10,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:10,318 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-08-04 21:33:10,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:10,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-04 21:33:10,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:33:13,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:13,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-04 21:33:13,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-04 21:33:13,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-04 21:33:13,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-04 21:33:13,251 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-04 21:33:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:13,367 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-04 21:33:13,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-04 21:33:13,367 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-04 21:33:13,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:13,368 INFO L225 Difference]: With dead ends: 95 [2019-08-04 21:33:13,368 INFO L226 Difference]: Without dead ends: 95 [2019-08-04 21:33:13,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-04 21:33:13,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-04 21:33:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-04 21:33:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-04 21:33:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-04 21:33:13,372 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-04 21:33:13,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:13,372 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-04 21:33:13,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-04 21:33:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-04 21:33:13,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-04 21:33:13,373 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:13,373 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-04 21:33:13,373 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:13,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:13,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-08-04 21:33:13,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:13,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-04 21:33:13,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:33:16,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:16,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-04 21:33:16,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-04 21:33:16,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-04 21:33:16,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-04 21:33:16,716 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-04 21:33:16,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:16,838 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-04 21:33:16,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-04 21:33:16,839 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-04 21:33:16,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:16,839 INFO L225 Difference]: With dead ends: 96 [2019-08-04 21:33:16,839 INFO L226 Difference]: Without dead ends: 96 [2019-08-04 21:33:16,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-04 21:33:16,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-04 21:33:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-04 21:33:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-04 21:33:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-04 21:33:16,841 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-04 21:33:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:16,842 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-04 21:33:16,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-04 21:33:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-04 21:33:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-04 21:33:16,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:16,843 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-04 21:33:16,843 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:16,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:16,843 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-08-04 21:33:16,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:16,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-04 21:33:16,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:33:20,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:20,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-04 21:33:20,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-04 21:33:20,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-04 21:33:20,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-04 21:33:20,236 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-04 21:33:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:20,365 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-04 21:33:20,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-04 21:33:20,366 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-04 21:33:20,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:20,366 INFO L225 Difference]: With dead ends: 97 [2019-08-04 21:33:20,367 INFO L226 Difference]: Without dead ends: 97 [2019-08-04 21:33:20,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-04 21:33:20,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-04 21:33:20,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-04 21:33:20,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-04 21:33:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-04 21:33:20,368 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-04 21:33:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:20,369 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-04 21:33:20,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-04 21:33:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-04 21:33:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-04 21:33:20,369 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:20,369 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-04 21:33:20,369 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:20,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:20,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-08-04 21:33:20,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:20,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-04 21:33:20,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:33:23,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:23,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-04 21:33:23,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-04 21:33:23,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-04 21:33:23,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-04 21:33:23,553 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-04 21:33:23,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:23,701 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-04 21:33:23,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-04 21:33:23,701 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-04 21:33:23,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:23,702 INFO L225 Difference]: With dead ends: 98 [2019-08-04 21:33:23,702 INFO L226 Difference]: Without dead ends: 98 [2019-08-04 21:33:23,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-04 21:33:23,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-04 21:33:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-04 21:33:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-04 21:33:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-04 21:33:23,705 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-04 21:33:23,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:23,706 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-04 21:33:23,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-04 21:33:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-04 21:33:23,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-04 21:33:23,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:23,707 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-04 21:33:23,707 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:23,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:23,707 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-08-04 21:33:23,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:23,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-04 21:33:23,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:27,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:33:27,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:27,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-04 21:33:27,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-04 21:33:27,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-04 21:33:27,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-04 21:33:27,517 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-04 21:33:27,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:27,663 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-04 21:33:27,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-04 21:33:27,664 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-04 21:33:27,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:27,664 INFO L225 Difference]: With dead ends: 99 [2019-08-04 21:33:27,664 INFO L226 Difference]: Without dead ends: 99 [2019-08-04 21:33:27,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-04 21:33:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-04 21:33:27,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-04 21:33:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-04 21:33:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-04 21:33:27,666 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-04 21:33:27,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:27,666 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-04 21:33:27,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-04 21:33:27,667 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-04 21:33:27,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-04 21:33:27,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:27,667 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-04 21:33:27,667 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:27,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:27,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-08-04 21:33:27,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:27,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-04 21:33:27,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:33:31,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:31,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-04 21:33:31,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-04 21:33:31,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-04 21:33:31,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-04 21:33:31,122 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-04 21:33:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:31,264 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-04 21:33:31,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-04 21:33:31,265 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-04 21:33:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:31,266 INFO L225 Difference]: With dead ends: 100 [2019-08-04 21:33:31,266 INFO L226 Difference]: Without dead ends: 100 [2019-08-04 21:33:31,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-04 21:33:31,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-04 21:33:31,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-04 21:33:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-04 21:33:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-04 21:33:31,269 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-04 21:33:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:31,269 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-04 21:33:31,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-04 21:33:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-04 21:33:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-04 21:33:31,270 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:31,270 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-04 21:33:31,270 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:31,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:31,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-08-04 21:33:31,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:31,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-04 21:33:31,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:33:34,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:34,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-04 21:33:34,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-04 21:33:34,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-04 21:33:34,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-04 21:33:34,823 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-04 21:33:34,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:34,971 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-04 21:33:34,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-04 21:33:34,972 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-04 21:33:34,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:34,973 INFO L225 Difference]: With dead ends: 101 [2019-08-04 21:33:34,973 INFO L226 Difference]: Without dead ends: 101 [2019-08-04 21:33:34,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-04 21:33:34,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-04 21:33:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-04 21:33:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-04 21:33:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-04 21:33:34,976 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-04 21:33:34,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:34,976 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-04 21:33:34,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-04 21:33:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-04 21:33:34,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-04 21:33:34,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:34,977 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-04 21:33:34,977 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:34,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:34,978 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-08-04 21:33:34,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:35,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-04 21:33:35,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:33:38,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:38,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-04 21:33:38,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-04 21:33:38,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-04 21:33:38,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-04 21:33:38,371 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-04 21:33:38,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:38,676 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-04 21:33:38,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-04 21:33:38,676 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-04 21:33:38,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:38,677 INFO L225 Difference]: With dead ends: 102 [2019-08-04 21:33:38,677 INFO L226 Difference]: Without dead ends: 102 [2019-08-04 21:33:38,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-04 21:33:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-04 21:33:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-04 21:33:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-04 21:33:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-04 21:33:38,679 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-04 21:33:38,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:38,679 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-04 21:33:38,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-04 21:33:38,679 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-04 21:33:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-04 21:33:38,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:38,680 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-04 21:33:38,680 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:38,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:38,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-08-04 21:33:38,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:38,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-04 21:33:38,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:33:42,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:42,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-04 21:33:42,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-04 21:33:42,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-04 21:33:42,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-04 21:33:42,529 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-04 21:33:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:42,673 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-04 21:33:42,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-04 21:33:42,673 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-04 21:33:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:42,674 INFO L225 Difference]: With dead ends: 103 [2019-08-04 21:33:42,674 INFO L226 Difference]: Without dead ends: 103 [2019-08-04 21:33:42,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-04 21:33:42,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-04 21:33:42,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-04 21:33:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-04 21:33:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-04 21:33:42,676 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-04 21:33:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:42,677 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-04 21:33:42,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-04 21:33:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-04 21:33:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-04 21:33:42,678 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:42,678 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-04 21:33:42,678 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:42,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:42,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-08-04 21:33:42,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:42,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-04 21:33:42,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:33:46,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:46,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-04 21:33:46,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-04 21:33:46,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-04 21:33:46,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-04 21:33:46,418 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-08-04 21:33:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:46,579 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-04 21:33:46,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-04 21:33:46,579 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-04 21:33:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:46,580 INFO L225 Difference]: With dead ends: 104 [2019-08-04 21:33:46,580 INFO L226 Difference]: Without dead ends: 104 [2019-08-04 21:33:46,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-04 21:33:46,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-04 21:33:46,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-04 21:33:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-04 21:33:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-04 21:33:46,583 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-04 21:33:46,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:46,583 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-04 21:33:46,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-04 21:33:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-04 21:33:46,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-04 21:33:46,584 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:46,584 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-04 21:33:46,585 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:46,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:46,585 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-08-04 21:33:46,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:46,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-04 21:33:46,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:33:50,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:50,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-04 21:33:50,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-04 21:33:50,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-04 21:33:50,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-04 21:33:50,450 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-08-04 21:33:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:50,648 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-04 21:33:50,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-04 21:33:50,648 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-08-04 21:33:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:50,649 INFO L225 Difference]: With dead ends: 105 [2019-08-04 21:33:50,649 INFO L226 Difference]: Without dead ends: 105 [2019-08-04 21:33:50,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-04 21:33:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-04 21:33:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-04 21:33:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-04 21:33:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-04 21:33:50,652 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-04 21:33:50,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:50,652 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-04 21:33:50,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-04 21:33:50,653 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-04 21:33:50,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-04 21:33:50,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:50,653 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-08-04 21:33:50,654 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:50,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:50,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-08-04 21:33:50,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:50,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-04 21:33:50,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:33:54,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:54,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-04 21:33:54,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-04 21:33:54,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-04 21:33:54,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-04 21:33:54,405 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-08-04 21:33:54,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:54,573 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-04 21:33:54,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-04 21:33:54,573 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-08-04 21:33:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:54,574 INFO L225 Difference]: With dead ends: 106 [2019-08-04 21:33:54,574 INFO L226 Difference]: Without dead ends: 106 [2019-08-04 21:33:54,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-04 21:33:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-04 21:33:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-04 21:33:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-04 21:33:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-04 21:33:54,577 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-04 21:33:54,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:54,578 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-04 21:33:54,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-04 21:33:54,578 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-04 21:33:54,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-04 21:33:54,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:54,579 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-08-04 21:33:54,579 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:54,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:54,579 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-08-04 21:33:54,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:54,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-04 21:33:54,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:33:58,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:58,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-04 21:33:58,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-04 21:33:58,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-04 21:33:58,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-04 21:33:58,696 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-08-04 21:33:58,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:58,898 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-04 21:33:58,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-04 21:33:58,898 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-08-04 21:33:58,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:58,899 INFO L225 Difference]: With dead ends: 107 [2019-08-04 21:33:58,899 INFO L226 Difference]: Without dead ends: 107 [2019-08-04 21:33:58,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-04 21:33:58,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-04 21:33:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-04 21:33:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-04 21:33:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-04 21:33:58,901 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-04 21:33:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:58,902 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-04 21:33:58,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-04 21:33:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-04 21:33:58,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-04 21:33:58,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:58,903 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-08-04 21:33:58,903 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:58,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:58,903 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-08-04 21:33:58,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:59,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-04 21:33:59,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:03,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:03,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:03,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-04 21:34:03,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-04 21:34:03,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-04 21:34:03,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-04 21:34:03,068 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-08-04 21:34:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:03,245 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-04 21:34:03,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-04 21:34:03,246 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-08-04 21:34:03,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:03,246 INFO L225 Difference]: With dead ends: 108 [2019-08-04 21:34:03,246 INFO L226 Difference]: Without dead ends: 108 [2019-08-04 21:34:03,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-04 21:34:03,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-04 21:34:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-04 21:34:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-04 21:34:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-04 21:34:03,250 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-04 21:34:03,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:03,251 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-04 21:34:03,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-04 21:34:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-04 21:34:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-04 21:34:03,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:03,252 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-04 21:34:03,252 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:03,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:03,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-08-04 21:34:03,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:03,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 1158 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-04 21:34:03,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:07,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:07,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-04 21:34:07,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-04 21:34:07,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-04 21:34:07,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-04 21:34:07,667 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-04 21:34:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:07,858 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-04 21:34:07,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-04 21:34:07,858 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-04 21:34:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:07,859 INFO L225 Difference]: With dead ends: 109 [2019-08-04 21:34:07,859 INFO L226 Difference]: Without dead ends: 109 [2019-08-04 21:34:07,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-04 21:34:07,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-04 21:34:07,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-04 21:34:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-04 21:34:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-04 21:34:07,861 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-04 21:34:07,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:07,861 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-04 21:34:07,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-04 21:34:07,861 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-04 21:34:07,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-04 21:34:07,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:07,862 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-04 21:34:07,862 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:07,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:07,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-08-04 21:34:07,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:07,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-04 21:34:07,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:12,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:12,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-04 21:34:12,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-04 21:34:12,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-04 21:34:12,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-04 21:34:12,157 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-08-04 21:34:12,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:12,318 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-04 21:34:12,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-04 21:34:12,318 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-04 21:34:12,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:12,319 INFO L225 Difference]: With dead ends: 110 [2019-08-04 21:34:12,319 INFO L226 Difference]: Without dead ends: 110 [2019-08-04 21:34:12,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-04 21:34:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-04 21:34:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-04 21:34:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-04 21:34:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-04 21:34:12,321 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-04 21:34:12,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:12,322 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-04 21:34:12,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-04 21:34:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-04 21:34:12,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-04 21:34:12,322 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:12,323 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-08-04 21:34:12,323 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:12,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:12,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-08-04 21:34:12,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:12,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-04 21:34:12,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:16,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:16,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-04 21:34:16,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-04 21:34:16,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-04 21:34:16,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-04 21:34:16,644 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-08-04 21:34:16,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:16,823 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-04 21:34:16,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-04 21:34:16,823 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-08-04 21:34:16,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:16,824 INFO L225 Difference]: With dead ends: 111 [2019-08-04 21:34:16,824 INFO L226 Difference]: Without dead ends: 111 [2019-08-04 21:34:16,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-04 21:34:16,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-04 21:34:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-04 21:34:16,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-04 21:34:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-04 21:34:16,826 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-04 21:34:16,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:16,827 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-04 21:34:16,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-04 21:34:16,827 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-04 21:34:16,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-04 21:34:16,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:16,828 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-08-04 21:34:16,828 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:16,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:16,828 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-08-04 21:34:16,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:16,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-04 21:34:16,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:20,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:20,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-04 21:34:20,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-04 21:34:20,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-04 21:34:20,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-04 21:34:20,888 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-08-04 21:34:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:21,076 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-04 21:34:21,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-04 21:34:21,077 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-08-04 21:34:21,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:21,077 INFO L225 Difference]: With dead ends: 112 [2019-08-04 21:34:21,077 INFO L226 Difference]: Without dead ends: 112 [2019-08-04 21:34:21,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-04 21:34:21,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-04 21:34:21,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-04 21:34:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-04 21:34:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-04 21:34:21,080 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-04 21:34:21,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:21,080 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-04 21:34:21,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-04 21:34:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-04 21:34:21,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-04 21:34:21,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:21,081 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-08-04 21:34:21,081 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:21,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:21,081 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-08-04 21:34:21,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:21,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 1202 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-04 21:34:21,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:25,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:25,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-04 21:34:25,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-04 21:34:25,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-04 21:34:25,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-04 21:34:25,329 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-08-04 21:34:25,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:25,542 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-04 21:34:25,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-04 21:34:25,542 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-08-04 21:34:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:25,543 INFO L225 Difference]: With dead ends: 113 [2019-08-04 21:34:25,543 INFO L226 Difference]: Without dead ends: 113 [2019-08-04 21:34:25,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-04 21:34:25,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-04 21:34:25,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-04 21:34:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-04 21:34:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-04 21:34:25,544 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-04 21:34:25,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:25,545 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-04 21:34:25,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-04 21:34:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-04 21:34:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-04 21:34:25,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:25,545 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-08-04 21:34:25,545 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:25,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:25,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-08-04 21:34:25,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:25,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-04 21:34:25,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:29,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:29,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-04 21:34:29,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-04 21:34:29,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-04 21:34:29,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-04 21:34:29,822 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-08-04 21:34:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:30,022 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-04 21:34:30,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-04 21:34:30,022 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-08-04 21:34:30,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:30,022 INFO L225 Difference]: With dead ends: 114 [2019-08-04 21:34:30,023 INFO L226 Difference]: Without dead ends: 114 [2019-08-04 21:34:30,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-04 21:34:30,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-04 21:34:30,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-04 21:34:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-04 21:34:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-04 21:34:30,025 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-04 21:34:30,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:30,025 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-04 21:34:30,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-04 21:34:30,025 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-04 21:34:30,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-04 21:34:30,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:30,026 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-08-04 21:34:30,027 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:30,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:30,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-08-04 21:34:30,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:30,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 1224 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-04 21:34:30,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:34,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:34,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-04 21:34:34,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-04 21:34:34,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-04 21:34:34,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-04 21:34:34,647 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-08-04 21:34:34,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:34,832 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-04 21:34:34,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-04 21:34:34,832 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-08-04 21:34:34,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:34,833 INFO L225 Difference]: With dead ends: 115 [2019-08-04 21:34:34,833 INFO L226 Difference]: Without dead ends: 115 [2019-08-04 21:34:34,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-04 21:34:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-04 21:34:34,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-04 21:34:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-04 21:34:34,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-04 21:34:34,836 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-04 21:34:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:34,837 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-04 21:34:34,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-04 21:34:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-04 21:34:34,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-04 21:34:34,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:34,838 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-08-04 21:34:34,838 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:34,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:34,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-08-04 21:34:34,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:34,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 1235 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-04 21:34:34,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:39,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:39,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-04 21:34:39,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-04 21:34:39,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-04 21:34:39,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-04 21:34:39,295 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2019-08-04 21:34:39,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:39,493 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-04 21:34:39,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-04 21:34:39,493 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2019-08-04 21:34:39,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:39,494 INFO L225 Difference]: With dead ends: 116 [2019-08-04 21:34:39,494 INFO L226 Difference]: Without dead ends: 116 [2019-08-04 21:34:39,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-04 21:34:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-04 21:34:39,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-04 21:34:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-04 21:34:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-04 21:34:39,497 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-04 21:34:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:39,497 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-04 21:34:39,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-04 21:34:39,497 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-04 21:34:39,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-04 21:34:39,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:39,498 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-04 21:34:39,499 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:39,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:39,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1991455747, now seen corresponding path program 112 times [2019-08-04 21:34:39,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:39,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 1246 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-04 21:34:39,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:44,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:44,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-04 21:34:44,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-04 21:34:44,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-04 21:34:44,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-04 21:34:44,313 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-04 21:34:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:44,531 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-04 21:34:44,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-04 21:34:44,531 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-04 21:34:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:44,532 INFO L225 Difference]: With dead ends: 117 [2019-08-04 21:34:44,532 INFO L226 Difference]: Without dead ends: 117 [2019-08-04 21:34:44,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-04 21:34:44,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-04 21:34:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-04 21:34:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-04 21:34:44,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-04 21:34:44,535 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-04 21:34:44,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:44,535 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-04 21:34:44,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-04 21:34:44,535 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-04 21:34:44,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-04 21:34:44,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:44,536 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2019-08-04 21:34:44,536 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:44,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:44,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1605587820, now seen corresponding path program 113 times [2019-08-04 21:34:44,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:44,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-04 21:34:44,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:49,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:49,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-04 21:34:49,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-04 21:34:49,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-04 21:34:49,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-04 21:34:49,414 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2019-08-04 21:34:49,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:49,597 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-04 21:34:49,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-04 21:34:49,598 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2019-08-04 21:34:49,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:49,598 INFO L225 Difference]: With dead ends: 118 [2019-08-04 21:34:49,599 INFO L226 Difference]: Without dead ends: 118 [2019-08-04 21:34:49,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-04 21:34:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-04 21:34:49,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-04 21:34:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-04 21:34:49,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-04 21:34:49,601 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-08-04 21:34:49,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:49,601 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-04 21:34:49,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-04 21:34:49,601 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-04 21:34:49,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-04 21:34:49,601 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:49,601 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2019-08-04 21:34:49,602 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:49,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:49,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1766383325, now seen corresponding path program 114 times [2019-08-04 21:34:49,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:49,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-04 21:34:49,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:54,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:54,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-04 21:34:54,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-04 21:34:54,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-04 21:34:54,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-04 21:34:54,510 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2019-08-04 21:34:54,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:54,711 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-04 21:34:54,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-04 21:34:54,712 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2019-08-04 21:34:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:54,712 INFO L225 Difference]: With dead ends: 119 [2019-08-04 21:34:54,713 INFO L226 Difference]: Without dead ends: 119 [2019-08-04 21:34:54,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-04 21:34:54,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-04 21:34:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-04 21:34:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-04 21:34:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-04 21:34:54,716 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-08-04 21:34:54,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:54,716 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-04 21:34:54,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-04 21:34:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-04 21:34:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-04 21:34:54,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:54,717 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2019-08-04 21:34:54,717 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:54,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:54,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1076693580, now seen corresponding path program 115 times [2019-08-04 21:34:54,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:54,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-04 21:34:54,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:59,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:59,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-04 21:34:59,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-04 21:34:59,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-04 21:34:59,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-04 21:34:59,641 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2019-08-04 21:34:59,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:59,857 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-04 21:34:59,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-04 21:34:59,858 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2019-08-04 21:34:59,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:59,858 INFO L225 Difference]: With dead ends: 120 [2019-08-04 21:34:59,858 INFO L226 Difference]: Without dead ends: 120 [2019-08-04 21:34:59,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-04 21:34:59,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-04 21:34:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-04 21:34:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-04 21:34:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-04 21:34:59,861 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-08-04 21:34:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:59,861 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-04 21:34:59,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-04 21:34:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-04 21:34:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-04 21:34:59,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:59,862 INFO L399 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2019-08-04 21:34:59,862 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:59,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:59,862 INFO L82 PathProgramCache]: Analyzing trace with hash -982235581, now seen corresponding path program 116 times [2019-08-04 21:34:59,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:59,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-04 21:34:59,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-04 21:35:01,902 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-04 21:35:01,902 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:35:01,907 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:35:01,908 INFO L202 PluginConnector]: Adding new model count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:35:01 BoogieIcfgContainer [2019-08-04 21:35:01,908 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:35:01,910 INFO L168 Benchmark]: Toolchain (without parser) took 238278.31 ms. Allocated memory was 134.2 MB in the beginning and 482.3 MB in the end (delta: 348.1 MB). Free memory was 110.5 MB in the beginning and 158.1 MB in the end (delta: -47.6 MB). Peak memory consumption was 300.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:35:01,911 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:35:01,911 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.62 ms. Allocated memory is still 134.2 MB. Free memory was 110.1 MB in the beginning and 108.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:35:01,912 INFO L168 Benchmark]: Boogie Preprocessor took 26.37 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 107.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:35:01,912 INFO L168 Benchmark]: RCFGBuilder took 331.20 ms. Allocated memory is still 134.2 MB. Free memory was 107.6 MB in the beginning and 98.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:35:01,913 INFO L168 Benchmark]: TraceAbstraction took 237877.80 ms. Allocated memory was 134.2 MB in the beginning and 482.3 MB in the end (delta: 348.1 MB). Free memory was 97.8 MB in the beginning and 158.1 MB in the end (delta: -60.3 MB). Peak memory consumption was 287.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:35:01,915 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.62 ms. Allocated memory is still 134.2 MB. Free memory was 110.1 MB in the beginning and 108.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.37 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 107.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 331.20 ms. Allocated memory is still 134.2 MB. Free memory was 107.6 MB in the beginning and 98.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237877.80 ms. Allocated memory was 134.2 MB in the beginning and 482.3 MB in the end (delta: 348.1 MB). Free memory was 97.8 MB in the beginning and 158.1 MB in the end (delta: -60.3 MB). Peak memory consumption was 287.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 120 with TraceHistMax 116,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 70 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 237.8s OverallTime, 117 OverallIterations, 116 TraceHistogramMax, 13.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 348 SDtfs, 0 SDslu, 1862 SDs, 0 SdLazy, 8764 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6902 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6786 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 212.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 116 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 5.1s SatisfiabilityAnalysisTime, 216.1s InterpolantComputationTime, 7018 NumberOfCodeBlocks, 7018 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 6902 ConstructedInterpolants, 0 QuantifiedInterpolants, 1608398 SizeOfPredicates, 345 NumberOfNonLiveVariables, 74994 ConjunctsInSsa, 7245 ConjunctsInUnsatCore, 116 InterpolantComputations, 1 PerfectInterpolantSequences, 0/260130 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown