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/20170319-ConjunctivePathPrograms/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:25:42,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:25:42,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:25:42,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:25:42,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:25:42,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:25:42,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:25:42,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:25:42,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:25:42,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:25:42,604 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:25:42,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:25:42,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:25:42,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:25:42,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:25:42,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:25:42,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:25:42,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:25:42,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:25:42,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:25:42,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:25:42,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:25:42,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:25:42,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:25:42,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:25:42,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:25:42,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:25:42,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:25:42,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:25:42,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:25:42,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:25:42,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:25:42,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:25:42,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:25:42,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:25:42,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:25:42,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:25:42,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:25:42,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:25:42,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:25:42,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:25:42,657 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:25:42,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:25:42,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:25:42,684 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:25:42,685 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:25:42,686 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2019-08-04 21:25:42,686 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl' [2019-08-04 21:25:42,725 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:25:42,727 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:25:42,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:25:42,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:25:42,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:25:42,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:42" (1/1) ... [2019-08-04 21:25:42,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:42" (1/1) ... [2019-08-04 21:25:42,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:25:42,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:25:42,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:25:42,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:25:42,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:42" (1/1) ... [2019-08-04 21:25:42,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:42" (1/1) ... [2019-08-04 21:25:42,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:42" (1/1) ... [2019-08-04 21:25:42,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:42" (1/1) ... [2019-08-04 21:25:42,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:42" (1/1) ... [2019-08-04 21:25:42,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:42" (1/1) ... [2019-08-04 21:25:42,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:42" (1/1) ... [2019-08-04 21:25:42,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:25:42,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:25:42,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:25:42,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:25:42,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:42" (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:25:42,860 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-04 21:25:42,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:25:42,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:25:43,065 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:25:43,065 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-04 21:25:43,066 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:25:43 BoogieIcfgContainer [2019-08-04 21:25:43,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:25:43,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:25:43,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:25:43,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:25:43,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:42" (1/2) ... [2019-08-04 21:25:43,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cec280b and model type gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:25:43, skipping insertion in model container [2019-08-04 21:25:43,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:25:43" (2/2) ... [2019-08-04 21:25:43,077 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2019-08-04 21:25:43,092 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:25:43,103 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:25:43,118 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:25:43,147 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:25:43,148 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:25:43,148 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:25:43,149 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:25:43,149 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:25:43,149 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:25:43,149 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:25:43,150 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:25:43,150 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:25:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:25:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:25:43,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:43,171 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:25:43,174 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:43,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:43,179 INFO L82 PathProgramCache]: Analyzing trace with hash 30023, now seen corresponding path program 1 times [2019-08-04 21:25:43,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:43,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:25:43,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:43,332 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:25:43,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:25:43,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:25:43,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:25:43,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:25:43,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:25:43,374 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:25:43,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:43,421 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-04 21:25:43,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:25:43,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:25:43,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:43,434 INFO L225 Difference]: With dead ends: 5 [2019-08-04 21:25:43,434 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:25:43,436 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:25:43,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:25:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:25:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:25:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:25:43,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:25:43,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:43,470 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:25:43,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:25:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:25:43,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:25:43,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:43,471 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:25:43,471 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:43,472 INFO L82 PathProgramCache]: Analyzing trace with hash 942973, now seen corresponding path program 1 times [2019-08-04 21:25:43,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:43,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:25:43,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:43,537 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:43,631 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:25:43,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:43,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:25:43,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:25:43,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:25:43,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:25:43,635 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:25:43,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:43,663 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:25:43,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:25:43,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:25:43,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:43,664 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:25:43,664 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:25:43,665 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:25:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:25:43,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:25:43,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:25:43,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:25:43,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:25:43,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:43,668 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:25:43,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:25:43,668 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:25:43,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:25:43,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:43,669 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:25:43,669 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:43,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:43,670 INFO L82 PathProgramCache]: Analyzing trace with hash 29244423, now seen corresponding path program 2 times [2019-08-04 21:25:43,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:43,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:25:43,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:43,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:43,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:43,832 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:25:43,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:43,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:25:43,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:25:43,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:25:43,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:25:43,835 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:25:43,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:43,905 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:25:43,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:25:43,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:25:43,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:43,907 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:25:43,908 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:25:43,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:25:43,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:25:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:25:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:25:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:25:43,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:25:43,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:43,913 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:25:43,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:25:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:25:43,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:25:43,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:43,914 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:25:43,915 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:43,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:43,915 INFO L82 PathProgramCache]: Analyzing trace with hash 906589373, now seen corresponding path program 3 times [2019-08-04 21:25:43,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:43,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:25:43,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:43,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:44,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:44,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:44,253 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:25:44,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:44,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:25:44,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:25:44,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:25:44,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:25:44,255 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:25:44,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:44,355 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:25:44,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:25:44,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:25:44,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:44,356 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:25:44,357 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:25:44,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:25:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:25:44,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:25:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:25:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:25:44,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:25:44,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:44,360 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:25:44,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:25:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:25:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:25:44,361 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:44,361 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:25:44,361 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:44,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:44,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1960488249, now seen corresponding path program 4 times [2019-08-04 21:25:44,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:44,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:25:44,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:44,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:44,458 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:44,491 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:44,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:44,625 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:25:44,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:44,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:25:44,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:25:44,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:25:44,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:25:44,629 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:25:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:44,667 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:25:44,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:25:44,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:25:44,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:44,669 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:25:44,669 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:25:44,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:25:44,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:25:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:25:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:25:44,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:25:44,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:25:44,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:44,673 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:25:44,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:25:44,673 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:25:44,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:25:44,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:44,674 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:25:44,674 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:44,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:44,675 INFO L82 PathProgramCache]: Analyzing trace with hash -645581315, now seen corresponding path program 5 times [2019-08-04 21:25:44,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:44,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:25:44,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:44,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:44,836 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:25:44,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:44,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:44,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:45,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:45,040 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:25:45,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:45,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:25:45,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:25:45,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:25:45,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:25:45,042 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:25:45,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:45,068 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:25:45,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:25:45,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:25:45,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:45,069 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:25:45,069 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:25:45,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:25:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:25:45,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:25:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:25:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:25:45,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:25:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:45,073 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:25:45,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:25:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:25:45,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:25:45,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:45,074 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:25:45,074 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:45,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:45,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1461827975, now seen corresponding path program 6 times [2019-08-04 21:25:45,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:45,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:25:45,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:45,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:45,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:45,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:45,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:45,482 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:25:45,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:45,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:45,598 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:25:45,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:45,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:25:45,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:25:45,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:25:45,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:25:45,601 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:25:45,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:45,627 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:25:45,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:25:45,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:25:45,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:45,628 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:25:45,628 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:25:45,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:25:45,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:25:45,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:25:45,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:25:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:25:45,632 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:25:45,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:45,632 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:25:45,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:25:45,632 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:25:45,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:25:45,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:45,633 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:25:45,633 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:45,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1927960771, now seen corresponding path program 7 times [2019-08-04 21:25:45,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:45,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:25:45,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:45,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:45,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:45,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:45,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:45,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:45,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:45,923 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:45,961 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:25:45,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:45,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:25:45,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:25:45,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:25:45,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:25:45,963 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:25:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:46,024 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:25:46,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:25:46,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:25:46,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:46,032 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:25:46,032 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:25:46,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:25:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:25:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:25:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:25:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:25:46,036 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:25:46,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:46,037 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:25:46,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:25:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:25:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:25:46,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:46,037 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:25:46,038 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:46,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:46,038 INFO L82 PathProgramCache]: Analyzing trace with hash 362770503, now seen corresponding path program 8 times [2019-08-04 21:25:46,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:46,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:25:46,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:46,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:46,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:46,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:46,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:46,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:46,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:46,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:46,358 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:46,433 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:25:46,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:46,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:25:46,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:25:46,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:25:46,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:25:46,435 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-04 21:25:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:46,479 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:25:46,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:25:46,480 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-04 21:25:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:46,481 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:25:46,481 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:25:46,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:25:46,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:25:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:25:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:25:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:25:46,483 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:25:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:46,484 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:25:46,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:25:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:25:46,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:25:46,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:46,485 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:25:46,485 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:46,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:46,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1639004035, now seen corresponding path program 9 times [2019-08-04 21:25:46,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:46,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:25:46,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:46,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:46,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:46,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:46,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:46,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:46,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:46,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:46,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:46,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:46,888 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:25:46,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:46,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:25:46,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:25:46,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:25:46,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:25:46,890 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-04 21:25:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:46,919 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:25:46,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:25:46,920 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-04 21:25:46,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:46,921 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:25:46,921 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:25:46,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:25:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:25:46,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:25:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:25:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:25:46,925 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-04 21:25:46,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:46,925 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:25:46,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:25:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:25:46,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:25:46,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:46,926 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-04 21:25:46,927 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:46,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash 730494727, now seen corresponding path program 10 times [2019-08-04 21:25:46,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:46,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-04 21:25:46,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:46,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,211 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:25:47,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:47,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:25:47,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:25:47,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:25:47,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:25:47,216 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-04 21:25:47,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:47,252 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:25:47,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:25:47,256 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-04 21:25:47,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:47,256 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:25:47,256 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:25:47,257 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:25:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:25:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:25:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:25:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:25:47,259 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-04 21:25:47,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:47,259 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:25:47,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:25:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:25:47,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:25:47,260 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:47,260 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-04 21:25:47,260 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:47,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:47,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1170512317, now seen corresponding path program 11 times [2019-08-04 21:25:47,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:47,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:25:47,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:47,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,386 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,710 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:25:47,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:47,890 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:25:47,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:47,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:25:47,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:25:47,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:25:47,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:25:47,892 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-04 21:25:47,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:47,916 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:25:47,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:25:47,917 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-04 21:25:47,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:47,918 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:25:47,918 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:25:47,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:25:47,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:25:47,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:25:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:25:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-04 21:25:47,922 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-04 21:25:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:47,923 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-04 21:25:47,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:25:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-04 21:25:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:25:47,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:47,924 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-04 21:25:47,924 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:47,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:47,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1926155719, now seen corresponding path program 12 times [2019-08-04 21:25:47,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:47,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:25:47,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:47,969 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:48,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:48,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:48,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:48,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:48,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:48,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:48,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:48,492 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:48,708 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:25:48,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:48,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:48,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:48,905 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:25:48,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:48,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:25:48,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:25:48,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:25:48,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:25:48,907 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-04 21:25:48,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:48,940 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:25:48,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:25:48,941 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-04 21:25:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:48,944 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:25:48,944 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:25:48,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:25:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:25:48,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:25:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:25:48,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:25:48,947 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-04 21:25:48,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:48,947 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:25:48,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:25:48,947 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:25:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:25:48,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:48,948 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-04 21:25:48,948 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:48,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:48,949 INFO L82 PathProgramCache]: Analyzing trace with hash -418702595, now seen corresponding path program 13 times [2019-08-04 21:25:48,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:48,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:25:48,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:49,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,076 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,090 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,353 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:25:49,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:49,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:25:49,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:25:49,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:25:49,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:25:49,356 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-04 21:25:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:49,378 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:25:49,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:25:49,379 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-04 21:25:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:49,380 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:25:49,380 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:25:49,381 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:25:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:25:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:25:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:25:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-04 21:25:49,384 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-04 21:25:49,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:49,384 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-04 21:25:49,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:25:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-04 21:25:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:25:49,385 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:49,385 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-04 21:25:49,385 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:49,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:49,385 INFO L82 PathProgramCache]: Analyzing trace with hash -94866297, now seen corresponding path program 14 times [2019-08-04 21:25:49,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:49,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-04 21:25:49,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:49,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,584 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:49,812 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:25:49,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:49,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:25:49,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:25:49,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:25:49,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:25:49,814 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-04 21:25:49,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:49,911 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:25:49,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:25:49,912 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-04 21:25:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:49,913 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:25:49,913 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:25:49,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:25:49,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:25:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:25:49,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:25:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:25:49,918 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-04 21:25:49,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:49,919 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:25:49,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:25:49,919 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:25:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:25:49,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:49,920 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-04 21:25:49,920 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:49,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:49,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1354124349, now seen corresponding path program 15 times [2019-08-04 21:25:49,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:49,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:25:49,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:50,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,522 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:25:50,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:50,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:25:50,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:25:50,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:25:50,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:25:50,524 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-04 21:25:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:50,568 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:25:50,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:25:50,568 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-04 21:25:50,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:50,569 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:25:50,570 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:25:50,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:25:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:25:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:25:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:25:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:25:50,573 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-04 21:25:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:50,573 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:25:50,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:25:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:25:50,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:25:50,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:50,574 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-04 21:25:50,574 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:50,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:50,574 INFO L82 PathProgramCache]: Analyzing trace with hash -971805881, now seen corresponding path program 16 times [2019-08-04 21:25:50,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:50,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-04 21:25:50,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:50,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,660 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,728 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,765 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,891 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:50,912 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:25:50,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:50,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:25:50,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:25:50,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:25:50,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:25:50,914 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-04 21:25:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:50,963 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-04 21:25:50,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:25:50,964 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-04 21:25:50,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:50,964 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:25:50,964 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:25:50,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:25:50,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:25:50,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:25:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:25:50,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:25:50,968 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-04 21:25:50,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:50,968 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:25:50,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:25:50,968 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:25:50,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:25:50,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:50,969 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-04 21:25:50,969 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:50,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:50,969 INFO L82 PathProgramCache]: Analyzing trace with hash -61198979, now seen corresponding path program 17 times [2019-08-04 21:25:50,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:50,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:25:50,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:51,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,088 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,180 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,483 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:25:51,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:51,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:25:51,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:25:51,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:25:51,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:25:51,488 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-04 21:25:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:51,516 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-04 21:25:51,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:25:51,523 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-04 21:25:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:51,524 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:25:51,524 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:25:51,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:25:51,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:25:51,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:25:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:25:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-04 21:25:51,527 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-04 21:25:51,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:51,528 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-04 21:25:51,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:25:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-04 21:25:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:25:51,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:51,529 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-04 21:25:51,529 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:51,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:51,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1897156089, now seen corresponding path program 18 times [2019-08-04 21:25:51,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:51,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-04 21:25:51,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:51,577 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:51,940 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:52,564 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:25:52,566 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:25:52,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:52,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:25:52,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:25:52,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:25:52,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:25:52,569 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-04 21:25:52,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:52,882 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-04 21:25:52,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:25:52,883 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-04 21:25:52,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:52,884 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:25:52,884 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:25:52,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:25:52,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:25:52,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:25:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:25:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:25:52,888 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-04 21:25:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:52,889 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:25:52,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:25:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:25:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:25:52,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:52,889 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-04 21:25:52,890 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:52,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:52,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1317715645, now seen corresponding path program 19 times [2019-08-04 21:25:52,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:52,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:25:52,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:52,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,161 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:25:53,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,205 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,248 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,359 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,428 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,653 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,793 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:25:53,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:53,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:25:53,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:25:53,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:25:53,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:25:53,795 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-04 21:25:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:53,832 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-04 21:25:53,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:25:53,833 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-04 21:25:53,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:53,834 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:25:53,834 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:25:53,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:25:53,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:25:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:25:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:25:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-04 21:25:53,838 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-04 21:25:53,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:53,838 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-04 21:25:53,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:25:53,838 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-04 21:25:53,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:25:53,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:53,839 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-04 21:25:53,839 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:53,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:53,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2100475705, now seen corresponding path program 20 times [2019-08-04 21:25:53,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:53,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-04 21:25:53,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:53,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:53,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,070 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,306 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:25:54,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:54,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:25:54,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:25:54,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:25:54,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:25:54,309 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-04 21:25:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:54,341 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-04 21:25:54,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:25:54,341 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-04 21:25:54,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:54,342 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:25:54,342 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:25:54,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:25:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:25:54,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:25:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:25:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:25:54,345 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-04 21:25:54,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:54,345 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:25:54,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:25:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:25:54,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:25:54,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:54,346 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-04 21:25:54,347 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:54,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:54,347 INFO L82 PathProgramCache]: Analyzing trace with hash -690225155, now seen corresponding path program 21 times [2019-08-04 21:25:54,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:54,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:25:54,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:54,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,562 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,631 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,663 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,721 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:54,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,066 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:25:55,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:55,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:25:55,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:25:55,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:25:55,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:25:55,068 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-04 21:25:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:55,109 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:25:55,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:25:55,112 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-04 21:25:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:55,113 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:25:55,113 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:25:55,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:25:55,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:25:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:25:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:25:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-04 21:25:55,119 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-04 21:25:55,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:55,119 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-04 21:25:55,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:25:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-04 21:25:55,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:25:55,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:55,122 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-04 21:25:55,122 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:55,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:55,122 INFO L82 PathProgramCache]: Analyzing trace with hash 77868935, now seen corresponding path program 22 times [2019-08-04 21:25:55,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:55,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-04 21:25:55,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:55,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,205 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,265 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,549 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,571 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,627 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,663 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:25:55,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:55,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:25:55,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:25:55,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:25:55,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:25:55,664 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-04 21:25:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:55,716 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-04 21:25:55,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:25:55,716 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-04 21:25:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:55,717 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:25:55,717 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:25:55,718 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:25:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:25:55,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:25:55,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:25:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-04 21:25:55,721 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-04 21:25:55,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:55,721 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-04 21:25:55,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:25:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-04 21:25:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:25:55,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:55,722 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-04 21:25:55,722 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:55,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:55,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1881018051, now seen corresponding path program 23 times [2019-08-04 21:25:55,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:55,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-04 21:25:55,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:55,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:55,990 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,319 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:25:56,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:56,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:25:56,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:25:56,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:25:56,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:25:56,321 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-04 21:25:56,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:56,392 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-04 21:25:56,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:25:56,393 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-04 21:25:56,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:56,393 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:25:56,393 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:25:56,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:25:56,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:25:56,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:25:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:25:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-04 21:25:56,398 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-04 21:25:56,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:56,399 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-04 21:25:56,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:25:56,399 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-04 21:25:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:25:56,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:56,399 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-04 21:25:56,400 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:56,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:56,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1817994823, now seen corresponding path program 24 times [2019-08-04 21:25:56,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:56,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-04 21:25:56,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:56,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:56,990 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,075 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,150 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,518 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:25:57,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:57,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:25:57,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:25:57,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:25:57,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:25:57,519 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-04 21:25:57,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:57,573 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-04 21:25:57,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:25:57,574 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-04 21:25:57,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:57,574 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:25:57,575 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:25:57,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:25:57,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:25:57,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:25:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:25:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:25:57,578 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-04 21:25:57,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:57,579 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:25:57,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:25:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:25:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:25:57,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:57,580 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-04 21:25:57,580 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:57,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:57,580 INFO L82 PathProgramCache]: Analyzing trace with hash 523276925, now seen corresponding path program 25 times [2019-08-04 21:25:57,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:57,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:25:57,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:57,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,952 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:57,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,543 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:25:58,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:58,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:25:58,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:25:58,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:25:58,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:25:58,544 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-04 21:25:58,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:58,625 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-04 21:25:58,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:25:58,626 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-04 21:25:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:58,626 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:25:58,626 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:25:58,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:25:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:25:58,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:25:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:25:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-04 21:25:58,628 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-04 21:25:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:58,629 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-04 21:25:58,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:25:58,629 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-04 21:25:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:25:58,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:58,629 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-04 21:25:58,630 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:58,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:58,630 INFO L82 PathProgramCache]: Analyzing trace with hash -958272249, now seen corresponding path program 26 times [2019-08-04 21:25:58,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:58,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-04 21:25:58,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:58,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,741 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:58,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,000 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,090 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,703 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:25:59,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:59,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:25:59,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:25:59,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:25:59,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:25:59,705 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-04 21:25:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:59,786 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-04 21:25:59,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:25:59,787 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-04 21:25:59,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:59,787 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:25:59,787 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:25:59,788 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:25:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:25:59,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:25:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:25:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-04 21:25:59,793 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-04 21:25:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:59,793 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-04 21:25:59,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:25:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-04 21:25:59,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:25:59,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:59,794 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-04 21:25:59,794 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:59,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:59,794 INFO L82 PathProgramCache]: Analyzing trace with hash 358343613, now seen corresponding path program 27 times [2019-08-04 21:25:59,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:59,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-04 21:25:59,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:59,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,917 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:25:59,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,042 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,079 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,233 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,460 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:26:00,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:00,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:26:00,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:26:00,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:26:00,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:26:00,462 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-04 21:26:00,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:00,520 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-04 21:26:00,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:26:00,520 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-04 21:26:00,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:00,521 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:26:00,521 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:26:00,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:26:00,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:26:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:26:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:26:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-04 21:26:00,525 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-04 21:26:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:00,526 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-04 21:26:00,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:26:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-04 21:26:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:26:00,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:00,526 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-04 21:26:00,527 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:00,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:00,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1776237625, now seen corresponding path program 28 times [2019-08-04 21:26:00,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:00,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-04 21:26:00,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:00,597 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,743 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:26:00,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,781 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:00,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,069 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,125 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,196 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,265 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,394 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,424 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,485 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:26:01,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:01,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:26:01,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:26:01,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:26:01,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:26:01,487 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-04 21:26:01,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:01,538 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-04 21:26:01,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:26:01,539 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-04 21:26:01,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:01,540 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:26:01,540 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:26:01,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:26:01,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:26:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:26:01,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:26:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-04 21:26:01,544 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-04 21:26:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:01,544 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-04 21:26:01,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:26:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-04 21:26:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:26:01,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:01,545 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-04 21:26:01,545 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:01,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:01,546 INFO L82 PathProgramCache]: Analyzing trace with hash 771220733, now seen corresponding path program 29 times [2019-08-04 21:26:01,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:01,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-04 21:26:01,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:01,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:01,813 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:26:01,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,026 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:26:02,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,194 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,227 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,577 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,630 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,660 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,721 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,754 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:26:02,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:02,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:26:02,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:26:02,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:26:02,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:26:02,756 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-04 21:26:02,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:02,843 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-04 21:26:02,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:26:02,844 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-04 21:26:02,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:02,844 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:26:02,844 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:26:02,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:26:02,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:26:02,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:26:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:26:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-04 21:26:02,849 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-04 21:26:02,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:02,849 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-04 21:26:02,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:26:02,849 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-04 21:26:02,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:26:02,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:02,850 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-04 21:26:02,850 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:02,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:02,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1861948793, now seen corresponding path program 30 times [2019-08-04 21:26:02,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:02,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-04 21:26:02,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:02,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:02,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,077 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,149 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,238 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,562 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:26:03,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:03,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:26:03,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:26:03,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:26:03,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:26:03,563 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-04 21:26:03,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:03,647 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-04 21:26:03,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:26:03,648 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-04 21:26:03,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:03,648 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:26:03,648 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:26:03,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:26:03,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:26:03,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:26:03,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:26:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-04 21:26:03,650 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-04 21:26:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:03,651 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-04 21:26:03,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:26:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-04 21:26:03,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:26:03,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:03,651 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-04 21:26:03,651 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:03,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:03,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1885825475, now seen corresponding path program 31 times [2019-08-04 21:26:03,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:03,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:26:03,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:03,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,907 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:26:03,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:03,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,149 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,201 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,222 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,355 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,644 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,695 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,829 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:26:04,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:04,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:26:04,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:26:04,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:26:04,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:26:04,831 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-04 21:26:04,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:04,885 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-04 21:26:04,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:26:04,886 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-04 21:26:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:04,886 INFO L225 Difference]: With dead ends: 36 [2019-08-04 21:26:04,886 INFO L226 Difference]: Without dead ends: 36 [2019-08-04 21:26:04,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:26:04,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-04 21:26:04,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-04 21:26:04,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:26:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-04 21:26:04,890 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-04 21:26:04,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:04,890 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-04 21:26:04,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:26:04,890 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-04 21:26:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:26:04,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:04,891 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-04 21:26:04,891 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:04,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:04,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1668964679, now seen corresponding path program 32 times [2019-08-04 21:26:04,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:04,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-04 21:26:04,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:04,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,990 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:04,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,033 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,073 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,088 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,576 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,679 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:26:05,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:05,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:26:05,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:26:05,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:26:05,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:26:05,681 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-04 21:26:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:05,747 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-04 21:26:05,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:26:05,748 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-04 21:26:05,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:05,748 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:26:05,748 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:26:05,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:26:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:26:05,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:26:05,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:26:05,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-04 21:26:05,752 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-04 21:26:05,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:05,752 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-04 21:26:05,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:26:05,752 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-04 21:26:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:26:05,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:05,753 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-04 21:26:05,753 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:05,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:05,753 INFO L82 PathProgramCache]: Analyzing trace with hash 198309757, now seen corresponding path program 33 times [2019-08-04 21:26:05,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:05,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-04 21:26:05,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:05,781 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,892 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,908 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:05,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,077 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,234 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,507 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:26:06,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:06,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:26:06,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:26:06,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:26:06,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:26:06,508 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-04 21:26:06,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:06,550 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-04 21:26:06,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:26:06,551 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-04 21:26:06,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:06,551 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:26:06,552 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:26:06,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:26:06,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:26:06,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:26:06,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:26:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-04 21:26:06,556 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-04 21:26:06,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:06,556 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-04 21:26:06,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:26:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-04 21:26:06,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:26:06,557 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:06,557 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-04 21:26:06,557 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:06,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:06,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1852647431, now seen corresponding path program 34 times [2019-08-04 21:26:06,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:06,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-04 21:26:06,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:06,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,641 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,728 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:06,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,073 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,194 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,355 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,450 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:26:07,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:07,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:26:07,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:26:07,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:26:07,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:26:07,452 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-04 21:26:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:07,494 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-04 21:26:07,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:26:07,494 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-04 21:26:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:07,495 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:26:07,495 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:26:07,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:26:07,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:26:07,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:26:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:26:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-04 21:26:07,499 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-04 21:26:07,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:07,500 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-04 21:26:07,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:26:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-04 21:26:07,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:26:07,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:07,501 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-04 21:26:07,501 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:07,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:07,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1597507773, now seen corresponding path program 35 times [2019-08-04 21:26:07,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:07,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:26:07,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:07,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,643 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,696 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,834 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,869 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,945 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:07,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,160 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,341 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,476 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:26:08,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:08,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:26:08,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:26:08,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:26:08,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:26:08,478 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-04 21:26:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:08,546 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-04 21:26:08,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:26:08,547 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-04 21:26:08,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:08,547 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:26:08,548 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:26:08,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:26:08,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:26:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:26:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:26:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-04 21:26:08,551 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-04 21:26:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:08,551 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-04 21:26:08,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:26:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-04 21:26:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:26:08,552 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:08,552 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-04 21:26:08,552 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:08,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:08,552 INFO L82 PathProgramCache]: Analyzing trace with hash -2016854329, now seen corresponding path program 36 times [2019-08-04 21:26:08,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:08,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-04 21:26:08,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:08,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,815 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:26:08,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:08,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,158 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,194 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,231 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,270 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,577 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:09,858 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:26:09,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:09,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:26:09,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:26:09,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:26:09,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:26:09,860 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-04 21:26:09,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:09,903 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-04 21:26:09,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:26:09,904 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-04 21:26:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:09,904 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:26:09,905 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:26:09,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:26:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:26:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:26:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:26:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:26:09,908 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-04 21:26:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:09,908 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:26:09,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:26:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:26:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:26:09,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:09,909 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-04 21:26:09,909 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:09,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:09,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1902037501, now seen corresponding path program 37 times [2019-08-04 21:26:09,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:09,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:26:09,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:09,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,186 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:26:10,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,396 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:26:10,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,619 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:26:10,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,669 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,738 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,786 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,942 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:10,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:11,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:11,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:11,071 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:11,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:11,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:11,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:11,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:11,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:11,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:11,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:11,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:11,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:11,377 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:11,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:11,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:11,486 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:26:11,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:11,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:26:11,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:26:11,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:26:11,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:26:11,487 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-04 21:26:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:11,553 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-04 21:26:11,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:26:11,553 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-04 21:26:11,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:11,554 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:26:11,554 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:26:11,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:26:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:26:11,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:26:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:26:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-04 21:26:11,558 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-04 21:26:11,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:11,558 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-04 21:26:11,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:26:11,559 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-04 21:26:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:26:11,559 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:11,559 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-04 21:26:11,559 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:11,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:11,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1166367353, now seen corresponding path program 38 times [2019-08-04 21:26:11,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:11,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-04 21:26:11,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:11,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:11,862 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:26:11,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,065 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:26:12,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,299 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:26:12,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,479 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,571 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:12,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,380 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:26:13,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:13,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:26:13,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:26:13,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:26:13,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:26:13,381 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-04 21:26:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:13,431 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-04 21:26:13,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:26:13,431 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-04 21:26:13,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:13,432 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:26:13,432 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:26:13,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:26:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:26:13,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:26:13,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:26:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-04 21:26:13,436 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-04 21:26:13,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:13,436 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-04 21:26:13,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:26:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-04 21:26:13,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:26:13,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:13,437 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-04 21:26:13,437 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:13,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:13,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1797637315, now seen corresponding path program 39 times [2019-08-04 21:26:13,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:13,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-04 21:26:13,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:13,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,537 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,578 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:13,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,074 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,578 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,660 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:14,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,040 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,075 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,258 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:26:15,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:15,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:26:15,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:26:15,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:26:15,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:26:15,259 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-04 21:26:15,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:15,312 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-04 21:26:15,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:26:15,313 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-04 21:26:15,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:15,313 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:26:15,313 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:26:15,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:26:15,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:26:15,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-04 21:26:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:26:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-04 21:26:15,316 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-04 21:26:15,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:15,317 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-04 21:26:15,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:26:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-04 21:26:15,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-04 21:26:15,317 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:15,317 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-04 21:26:15,317 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:15,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:15,318 INFO L82 PathProgramCache]: Analyzing trace with hash 107830343, now seen corresponding path program 40 times [2019-08-04 21:26:15,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:15,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-04 21:26:15,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:15,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,499 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,549 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,891 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,923 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:15,981 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,042 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,074 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,256 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,412 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:26:16,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:16,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:26:16,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:26:16,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:26:16,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:26:16,415 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-04 21:26:16,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:16,494 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-04 21:26:16,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:26:16,494 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-04 21:26:16,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:16,495 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:26:16,495 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:26:16,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:26:16,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:26:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:26:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:26:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-04 21:26:16,498 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-04 21:26:16,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:16,498 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-04 21:26:16,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:26:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-04 21:26:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:26:16,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:16,499 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-04 21:26:16,499 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:16,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:16,499 INFO L82 PathProgramCache]: Analyzing trace with hash -952214403, now seen corresponding path program 41 times [2019-08-04 21:26:16,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:16,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-04 21:26:16,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:16,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,571 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,759 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,940 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:16,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,502 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,538 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,576 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,619 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:26:17,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:17,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:26:17,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:26:17,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:26:17,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:26:17,622 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-04 21:26:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:17,680 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-04 21:26:17,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:26:17,680 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-04 21:26:17,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:17,681 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:26:17,681 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:26:17,682 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:26:17,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:26:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:26:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:26:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-04 21:26:17,684 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-04 21:26:17,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:17,685 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-04 21:26:17,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:26:17,685 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-04 21:26:17,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:26:17,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:17,685 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-04 21:26:17,685 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:17,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:17,686 INFO L82 PathProgramCache]: Analyzing trace with hash 546136839, now seen corresponding path program 42 times [2019-08-04 21:26:17,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:17,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:26:17,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:17,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,899 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:17,952 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,200 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,222 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,270 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,510 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,643 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:18,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,210 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:26:19,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:19,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:26:19,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:26:19,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:26:19,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:26:19,212 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-04 21:26:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:19,293 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-04 21:26:19,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:26:19,294 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-04 21:26:19,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:19,294 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:26:19,295 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:26:19,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:26:19,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:26:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:26:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:26:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-04 21:26:19,298 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-04 21:26:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:19,299 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-04 21:26:19,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:26:19,299 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-04 21:26:19,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:26:19,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:19,299 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-04 21:26:19,300 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:19,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:19,300 INFO L82 PathProgramCache]: Analyzing trace with hash -249614915, now seen corresponding path program 43 times [2019-08-04 21:26:19,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:19,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-04 21:26:19,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:19,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,386 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,416 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,428 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,499 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,550 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,631 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,738 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,812 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:19,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,397 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,560 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:26:20,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:20,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:26:20,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:26:20,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:26:20,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:26:20,562 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-04 21:26:20,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:20,692 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-04 21:26:20,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:26:20,692 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-04 21:26:20,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:20,693 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:26:20,693 INFO L226 Difference]: Without dead ends: 48 [2019-08-04 21:26:20,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:26:20,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-04 21:26:20,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-04 21:26:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:26:20,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-04 21:26:20,694 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-04 21:26:20,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:20,695 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-04 21:26:20,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:26:20,695 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-04 21:26:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:26:20,695 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:20,695 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-04 21:26:20,695 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:20,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:20,696 INFO L82 PathProgramCache]: Analyzing trace with hash 851884487, now seen corresponding path program 44 times [2019-08-04 21:26:20,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:20,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-04 21:26:20,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:20,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,738 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,768 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,884 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:20,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,070 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,204 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,233 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,425 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,559 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,595 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,672 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:21,912 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:26:21,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:21,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:26:21,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:26:21,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:26:21,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:26:21,914 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-04 21:26:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:22,040 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-04 21:26:22,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:26:22,041 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-04 21:26:22,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:22,041 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:26:22,042 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:26:22,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:26:22,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:26:22,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:26:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:26:22,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-04 21:26:22,045 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-04 21:26:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:22,045 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-04 21:26:22,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:26:22,046 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-04 21:26:22,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:26:22,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:22,046 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-04 21:26:22,047 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:22,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:22,047 INFO L82 PathProgramCache]: Analyzing trace with hash 638627581, now seen corresponding path program 45 times [2019-08-04 21:26:22,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:22,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-04 21:26:22,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:22,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,200 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,417 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,448 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,643 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,672 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,699 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,782 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,904 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:22,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,077 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,151 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,269 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,356 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,399 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:26:23,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:23,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:26:23,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:26:23,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:26:23,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:26:23,400 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-04 21:26:23,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:23,662 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-04 21:26:23,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:26:23,662 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-04 21:26:23,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:23,663 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:26:23,663 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:26:23,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:26:23,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:26:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:26:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:26:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-04 21:26:23,666 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-04 21:26:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:23,666 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-04 21:26:23,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:26:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-04 21:26:23,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:26:23,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:23,667 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-04 21:26:23,667 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:23,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:23,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1677369209, now seen corresponding path program 46 times [2019-08-04 21:26:23,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:23,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-04 21:26:23,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:23,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:23,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,076 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:24,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,057 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,227 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:26:25,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:25,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:26:25,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:26:25,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:26:25,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:26:25,229 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-04 21:26:25,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:25,304 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-04 21:26:25,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:26:25,305 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-04 21:26:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:25,306 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:26:25,306 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:26:25,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:26:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:26:25,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:26:25,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:26:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-04 21:26:25,309 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-04 21:26:25,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:25,309 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-04 21:26:25,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:26:25,310 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-04 21:26:25,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:26:25,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:25,310 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-04 21:26:25,310 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:25,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:25,311 INFO L82 PathProgramCache]: Analyzing trace with hash -458825667, now seen corresponding path program 47 times [2019-08-04 21:26:25,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:25,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-04 21:26:25,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:25,386 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,434 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,444 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,523 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,779 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,829 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:25,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,201 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,701 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:26:26,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:26,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:26:26,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:26:26,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:26:26,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:26:26,702 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-04 21:26:26,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:26,761 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-04 21:26:26,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:26:26,761 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-04 21:26:26,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:26,762 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:26:26,762 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:26:26,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:26:26,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:26:26,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:26:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:26:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-04 21:26:26,765 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-04 21:26:26,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:26,765 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-04 21:26:26,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:26:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-04 21:26:26,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:26:26,766 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:26,766 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-04 21:26:26,766 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:26,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1338681529, now seen corresponding path program 48 times [2019-08-04 21:26:26,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:26,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-04 21:26:26,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:26,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,837 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,904 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,917 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:26,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,168 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,864 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:27,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,143 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:26:28,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:28,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:26:28,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:26:28,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:26:28,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:26:28,145 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-04 21:26:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:28,232 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-04 21:26:28,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:26:28,232 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-04 21:26:28,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:28,233 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:26:28,233 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:26:28,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:26:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:26:28,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:26:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:26:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:26:28,237 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-04 21:26:28,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:28,237 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:26:28,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:26:28,237 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:26:28,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:26:28,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:28,238 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-04 21:26:28,238 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:28,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:28,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1450557821, now seen corresponding path program 49 times [2019-08-04 21:26:28,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:28,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-04 21:26:28,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:28,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,869 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:28,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,269 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,656 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,944 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:29,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,039 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:26:30,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:30,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:26:30,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:26:30,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:26:30,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:26:30,041 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-04 21:26:30,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:30,098 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-04 21:26:30,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:26:30,099 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-04 21:26:30,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:30,099 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:26:30,099 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:26:30,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:26:30,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:26:30,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:26:30,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:26:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-04 21:26:30,101 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-04 21:26:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:30,101 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-04 21:26:30,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:26:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-04 21:26:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:26:30,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:30,101 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-04 21:26:30,102 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:30,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:30,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2017631751, now seen corresponding path program 50 times [2019-08-04 21:26:30,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:30,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-04 21:26:30,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:30,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,206 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,303 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,538 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,641 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:30,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:31,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:31,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:31,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:31,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:31,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:31,194 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:31,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:31,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:31,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:31,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:31,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:31,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:31,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:31,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:31,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:26:31,641 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:26:31,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:31,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:26:31,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:26:31,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:26:31,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:26:31,643 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-04 21:26:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:31,718 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-04 21:26:31,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:26:31,719 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-04 21:26:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:31,720 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:26:31,721 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:26:31,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:26:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:26:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:26:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:26:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-04 21:26:31,723 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-04 21:26:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:31,723 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-04 21:26:31,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:26:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-04 21:26:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:26:31,724 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:31,724 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-04 21:26:31,724 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:31,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:31,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1877912899, now seen corresponding path program 51 times [2019-08-04 21:26:31,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:31,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-04 21:26:31,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:33,198 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:26:33,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:33,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:26:33,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:26:33,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:26:33,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:26:33,200 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-04 21:26:35,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:35,218 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-04 21:26:35,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:26:35,219 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-04 21:26:35,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:35,219 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:26:35,219 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:26:35,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:26:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:26:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:26:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:26:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-04 21:26:35,223 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-04 21:26:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:35,223 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-04 21:26:35,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:26:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-04 21:26:35,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:26:35,223 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:35,223 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-04 21:26:35,224 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:35,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:35,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1914254535, now seen corresponding path program 52 times [2019-08-04 21:26:35,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:35,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-04 21:26:35,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:36,407 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:26:36,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:36,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:26:36,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:26:36,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:26:36,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:26:36,409 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-04 21:26:39,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:39,037 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-04 21:26:39,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:26:39,037 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-04 21:26:39,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:39,038 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:26:39,038 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:26:39,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:26:39,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:26:39,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:26:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:26:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-04 21:26:39,042 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-04 21:26:39,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:39,042 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-04 21:26:39,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:26:39,042 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-04 21:26:39,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:26:39,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:39,043 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-04 21:26:39,043 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:39,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:39,044 INFO L82 PathProgramCache]: Analyzing trace with hash -787639299, now seen corresponding path program 53 times [2019-08-04 21:26:39,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:39,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-04 21:26:39,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:40,603 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:26:40,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:40,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:26:40,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:26:40,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:26:40,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:26:40,604 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-04 21:26:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:42,538 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-04 21:26:42,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:26:42,539 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-04 21:26:42,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:42,540 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:26:42,540 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:26:42,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:26:42,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:26:42,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:26:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:26:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-04 21:26:42,541 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-04 21:26:42,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:42,542 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-04 21:26:42,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:26:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-04 21:26:42,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:26:42,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:42,542 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-04 21:26:42,542 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:42,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:42,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1352997767, now seen corresponding path program 54 times [2019-08-04 21:26:42,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:42,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-04 21:26:42,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:43,907 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:26:43,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:43,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:26:43,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:26:43,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:26:43,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:26:43,908 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-04 21:26:46,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:46,018 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-04 21:26:46,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:26:46,019 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-04 21:26:46,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:46,019 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:26:46,020 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:26:46,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:26:46,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:26:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:26:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:26:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-04 21:26:46,022 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-04 21:26:46,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:46,022 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-04 21:26:46,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:26:46,023 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-04 21:26:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:26:46,023 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:46,023 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-04 21:26:46,023 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:46,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:46,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1006729923, now seen corresponding path program 55 times [2019-08-04 21:26:46,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:46,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-04 21:26:46,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:47,693 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:26:47,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:47,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:26:47,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:26:47,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:26:47,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:26:47,694 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-04 21:26:49,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:49,788 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-04 21:26:49,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:26:49,789 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-04 21:26:49,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:49,789 INFO L225 Difference]: With dead ends: 60 [2019-08-04 21:26:49,789 INFO L226 Difference]: Without dead ends: 60 [2019-08-04 21:26:49,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:26:49,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-04 21:26:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-04 21:26:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:26:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-04 21:26:49,792 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-04 21:26:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:49,792 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-04 21:26:49,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:26:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-04 21:26:49,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-04 21:26:49,792 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:49,793 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-04 21:26:49,793 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:49,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:49,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1143844281, now seen corresponding path program 56 times [2019-08-04 21:26:49,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:49,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-04 21:26:49,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:51,269 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:26:51,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:51,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:26:51,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:26:51,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:26:51,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:26:51,270 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-04 21:26:53,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:53,411 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-04 21:26:53,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:26:53,412 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-04 21:26:53,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:53,413 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:26:53,413 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:26:53,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:26:53,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:26:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:26:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:26:53,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-04 21:26:53,417 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-04 21:26:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:53,417 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-04 21:26:53,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:26:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-04 21:26:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:26:53,418 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:53,418 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-04 21:26:53,418 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:53,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:53,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1099422083, now seen corresponding path program 57 times [2019-08-04 21:26:53,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:53,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-04 21:26:53,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:54,903 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:26:54,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:54,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:26:54,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:26:54,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:26:54,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:26:54,904 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-04 21:26:57,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:57,281 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-04 21:26:57,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:26:57,281 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-04 21:26:57,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:57,282 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:26:57,282 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:26:57,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:26:57,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:26:57,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-04 21:26:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:26:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-04 21:26:57,285 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-04 21:26:57,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:57,285 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-04 21:26:57,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:26:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-04 21:26:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-04 21:26:57,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:57,286 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-04 21:26:57,286 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:57,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:57,286 INFO L82 PathProgramCache]: Analyzing trace with hash 277666055, now seen corresponding path program 58 times [2019-08-04 21:26:57,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:57,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-04 21:26:57,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:58,664 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:26:58,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:58,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:26:58,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:26:58,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:26:58,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:26:58,665 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-04 21:27:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:01,097 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-04 21:27:01,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:27:01,098 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-04 21:27:01,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:01,098 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:27:01,098 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:27:01,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:27:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:27:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:27:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:27:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-04 21:27:01,101 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-04 21:27:01,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:01,101 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-04 21:27:01,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:27:01,101 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-04 21:27:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:27:01,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:01,102 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-04 21:27:01,102 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:01,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:01,102 INFO L82 PathProgramCache]: Analyzing trace with hash 17725373, now seen corresponding path program 59 times [2019-08-04 21:27:01,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:01,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-04 21:27:01,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:02,513 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:27:02,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:02,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:27:02,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:27:02,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:27:02,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:27:02,514 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-04 21:27:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:04,860 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-04 21:27:04,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:27:04,861 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-04 21:27:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:04,861 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:27:04,862 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:27:04,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:27:04,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:27:04,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-04 21:27:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:27:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-04 21:27:04,864 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-04 21:27:04,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:04,864 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-04 21:27:04,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:27:04,865 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-04 21:27:04,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:27:04,865 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:04,865 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-04 21:27:04,865 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:04,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:04,865 INFO L82 PathProgramCache]: Analyzing trace with hash 549498823, now seen corresponding path program 60 times [2019-08-04 21:27:04,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:04,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-04 21:27:04,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:06,757 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:27:06,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:06,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:27:06,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:27:06,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:27:06,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:27:06,759 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-04 21:27:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:09,194 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-04 21:27:09,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:27:09,194 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-04 21:27:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:09,195 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:27:09,195 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:27:09,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:27:09,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:27:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:27:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:27:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-04 21:27:09,198 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-04 21:27:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:09,198 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-04 21:27:09,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:27:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-04 21:27:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:27:09,199 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:09,199 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-04 21:27:09,199 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:09,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:09,199 INFO L82 PathProgramCache]: Analyzing trace with hash -145393411, now seen corresponding path program 61 times [2019-08-04 21:27:09,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:09,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-04 21:27:09,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:10,982 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:27:10,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:10,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:27:10,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:27:10,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:27:10,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:27:10,983 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-04 21:27:13,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:13,474 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-04 21:27:13,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:27:13,474 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-04 21:27:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:13,475 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:27:13,475 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:27:13,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:27:13,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:27:13,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-04 21:27:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:27:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-04 21:27:13,478 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-04 21:27:13,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:13,478 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-04 21:27:13,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:27:13,479 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-04 21:27:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-04 21:27:13,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:13,479 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-04 21:27:13,480 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:13,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:13,480 INFO L82 PathProgramCache]: Analyzing trace with hash -212216185, now seen corresponding path program 62 times [2019-08-04 21:27:13,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:13,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-04 21:27:13,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:15,083 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:27:15,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:15,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:27:15,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:27:15,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:27:15,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:27:15,084 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-04 21:27:17,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:17,763 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-04 21:27:17,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:27:17,764 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-04 21:27:17,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:17,765 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:27:17,765 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:27:17,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:27:17,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:27:17,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:27:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:27:17,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-04 21:27:17,768 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-04 21:27:17,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:17,769 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-04 21:27:17,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:27:17,769 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-04 21:27:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:27:17,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:17,769 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-04 21:27:17,770 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:17,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:17,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2011245117, now seen corresponding path program 63 times [2019-08-04 21:27:17,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:17,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-04 21:27:17,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:19,386 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:27:19,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:19,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:27:19,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:27:19,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:27:19,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:27:19,388 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-04 21:27:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:22,257 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-04 21:27:22,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:27:22,257 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-04 21:27:22,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:22,258 INFO L225 Difference]: With dead ends: 68 [2019-08-04 21:27:22,258 INFO L226 Difference]: Without dead ends: 68 [2019-08-04 21:27:22,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:27:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-04 21:27:22,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-04 21:27:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-04 21:27:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-04 21:27:22,262 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-04 21:27:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:22,262 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-04 21:27:22,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:27:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-04 21:27:22,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-04 21:27:22,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:22,263 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-04 21:27:22,267 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:22,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:22,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2075898553, now seen corresponding path program 64 times [2019-08-04 21:27:22,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:22,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-04 21:27:22,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:23,936 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:27:23,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:23,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:27:23,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:27:23,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:27:23,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:27:23,937 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-04 21:27:26,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:26,852 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-04 21:27:26,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:27:26,852 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-04 21:27:26,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:26,853 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:27:26,853 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:27:26,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:27:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:27:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:27:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:27:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-04 21:27:26,856 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-04 21:27:26,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:26,856 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-04 21:27:26,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:27:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-04 21:27:26,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:27:26,857 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:26,857 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-04 21:27:26,857 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:26,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:26,857 INFO L82 PathProgramCache]: Analyzing trace with hash 71666557, now seen corresponding path program 65 times [2019-08-04 21:27:26,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:26,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-04 21:27:26,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:28,668 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:27:28,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:28,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:27:28,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:27:28,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:27:28,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:27:28,669 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-04 21:27:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:31,719 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-04 21:27:31,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:27:31,720 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-04 21:27:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:31,721 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:27:31,721 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:27:31,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:27:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:27:31,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-04 21:27:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:27:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-04 21:27:31,723 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-04 21:27:31,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:31,724 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-04 21:27:31,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:27:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-04 21:27:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-04 21:27:31,724 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:31,724 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-04 21:27:31,725 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:31,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:31,725 INFO L82 PathProgramCache]: Analyzing trace with hash -2073291769, now seen corresponding path program 66 times [2019-08-04 21:27:31,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:31,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-04 21:27:31,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:33,558 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:27:33,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:33,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:27:33,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:27:33,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:27:33,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:27:33,559 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-04 21:27:36,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:36,665 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-04 21:27:36,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:27:36,666 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-04 21:27:36,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:36,666 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:27:36,667 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:27:36,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:27:36,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:27:36,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:27:36,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:27:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-04 21:27:36,669 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-04 21:27:36,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:36,669 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-04 21:27:36,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:27:36,670 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-04 21:27:36,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:27:36,670 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:36,670 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-04 21:27:36,670 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:36,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:36,671 INFO L82 PathProgramCache]: Analyzing trace with hash 152476861, now seen corresponding path program 67 times [2019-08-04 21:27:36,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:36,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-04 21:27:36,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:39,543 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:27:39,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:39,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:27:39,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:27:39,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:27:39,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:27:39,544 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-04 21:27:42,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:42,702 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-04 21:27:42,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:27:42,703 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-04 21:27:42,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:42,703 INFO L225 Difference]: With dead ends: 72 [2019-08-04 21:27:42,703 INFO L226 Difference]: Without dead ends: 72 [2019-08-04 21:27:42,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:27:42,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-04 21:27:42,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-04 21:27:42,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-04 21:27:42,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-04 21:27:42,706 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-04 21:27:42,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:42,706 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-04 21:27:42,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:27:42,707 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-04 21:27:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-04 21:27:42,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:42,707 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-04 21:27:42,708 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:42,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:42,708 INFO L82 PathProgramCache]: Analyzing trace with hash 431827655, now seen corresponding path program 68 times [2019-08-04 21:27:42,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:42,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-04 21:27:42,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:44,688 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:27:44,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:44,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:27:44,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:27:44,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:27:44,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:27:44,689 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-04 21:27:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:48,006 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-04 21:27:48,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:27:48,007 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-04 21:27:48,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:48,008 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:27:48,008 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:27:48,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:27:48,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:27:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:27:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:27:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-04 21:27:48,010 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-04 21:27:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:48,010 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-04 21:27:48,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:27:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-04 21:27:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:27:48,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:48,011 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-04 21:27:48,011 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:48,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:48,012 INFO L82 PathProgramCache]: Analyzing trace with hash 501767677, now seen corresponding path program 69 times [2019-08-04 21:27:48,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:48,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-04 21:27:48,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:50,036 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:27:50,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:50,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:27:50,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:27:50,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:27:50,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:27:50,037 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-04 21:27:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:53,446 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-04 21:27:53,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:27:53,447 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-04 21:27:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:53,448 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:27:53,448 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:27:53,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:27:53,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:27:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-04 21:27:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-04 21:27:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-04 21:27:53,451 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-04 21:27:53,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:53,451 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-04 21:27:53,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:27:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-04 21:27:53,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-04 21:27:53,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:53,452 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-04 21:27:53,452 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:53,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:53,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1625058937, now seen corresponding path program 70 times [2019-08-04 21:27:53,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:53,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-04 21:27:53,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:55,435 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:27:55,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:55,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:27:55,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:27:55,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:27:55,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:27:55,437 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-04 21:27:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:58,837 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-04 21:27:58,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:27:58,838 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-04 21:27:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:58,839 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:27:58,839 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:27:58,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:27:58,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:27:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:27:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:27:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-04 21:27:58,842 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-04 21:27:58,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:58,842 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-04 21:27:58,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:27:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-04 21:27:58,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:27:58,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:58,843 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-04 21:27:58,843 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:58,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:58,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1162792765, now seen corresponding path program 71 times [2019-08-04 21:27:58,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:58,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-04 21:27:58,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:00,946 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:28:00,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:00,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:28:00,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:28:00,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:28:00,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:28:00,948 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-04 21:28:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:04,389 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-04 21:28:04,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:28:04,390 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-04 21:28:04,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:04,391 INFO L225 Difference]: With dead ends: 76 [2019-08-04 21:28:04,391 INFO L226 Difference]: Without dead ends: 76 [2019-08-04 21:28:04,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:28:04,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-04 21:28:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-04 21:28:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-04 21:28:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-04 21:28:04,394 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-04 21:28:04,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:04,395 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-04 21:28:04,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:28:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-04 21:28:04,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-04 21:28:04,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:04,395 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-04 21:28:04,396 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:04,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:04,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1686849607, now seen corresponding path program 72 times [2019-08-04 21:28:04,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:04,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-04 21:28:04,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:06,506 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:28:06,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:06,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:28:06,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:28:06,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:28:06,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:28:06,507 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-04 21:28:10,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:10,118 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-04 21:28:10,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:28:10,119 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-04 21:28:10,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:10,120 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:28:10,120 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:28:10,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:28:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:28:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:28:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:28:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-04 21:28:10,123 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-04 21:28:10,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:10,123 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-04 21:28:10,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:28:10,124 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-04 21:28:10,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:28:10,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:10,124 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-04 21:28:10,124 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:10,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:10,125 INFO L82 PathProgramCache]: Analyzing trace with hash 752742525, now seen corresponding path program 73 times [2019-08-04 21:28:10,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:10,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-04 21:28:10,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:12,501 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:28:12,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:12,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:28:12,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:28:12,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:28:12,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:28:12,503 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-04 21:28:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:16,106 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-04 21:28:16,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:28:16,106 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-04 21:28:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:16,107 INFO L225 Difference]: With dead ends: 78 [2019-08-04 21:28:16,107 INFO L226 Difference]: Without dead ends: 78 [2019-08-04 21:28:16,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:28:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-04 21:28:16,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-04 21:28:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-04 21:28:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-04 21:28:16,110 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-04 21:28:16,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:16,111 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-04 21:28:16,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:28:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-04 21:28:16,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-04 21:28:16,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:16,111 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-04 21:28:16,112 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:16,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:16,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1860194055, now seen corresponding path program 74 times [2019-08-04 21:28:16,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:16,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-04 21:28:16,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:18,688 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:28:18,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:18,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:28:18,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:28:18,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:28:18,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:28:18,689 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-04 21:28:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:22,512 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-04 21:28:22,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:28:22,513 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-04 21:28:22,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:22,513 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:28:22,514 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:28:22,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:28:22,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:28:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:28:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:28:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-04 21:28:22,517 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-04 21:28:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:22,517 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-04 21:28:22,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:28:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-04 21:28:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:28:22,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:22,518 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-04 21:28:22,518 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:22,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:22,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1831453117, now seen corresponding path program 75 times [2019-08-04 21:28:22,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:22,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-04 21:28:22,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:25,474 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:28:25,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:25,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:28:25,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:28:25,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:28:25,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:28:25,475 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-04 21:28:29,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:29,379 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-04 21:28:29,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:28:29,380 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-04 21:28:29,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:29,381 INFO L225 Difference]: With dead ends: 80 [2019-08-04 21:28:29,381 INFO L226 Difference]: Without dead ends: 80 [2019-08-04 21:28:29,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:28:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-04 21:28:29,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-04 21:28:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-04 21:28:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-04 21:28:29,383 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-04 21:28:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:29,384 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-04 21:28:29,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:28:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-04 21:28:29,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-04 21:28:29,384 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:29,384 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-04 21:28:29,385 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:29,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:29,385 INFO L82 PathProgramCache]: Analyzing trace with hash 940484039, now seen corresponding path program 76 times [2019-08-04 21:28:29,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:29,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-04 21:28:29,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:31,798 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:28:31,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:31,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-04 21:28:31,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-04 21:28:31,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-04 21:28:31,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:28:31,799 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-04 21:28:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:35,845 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-04 21:28:35,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-04 21:28:35,845 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-04 21:28:35,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:35,846 INFO L225 Difference]: With dead ends: 81 [2019-08-04 21:28:35,846 INFO L226 Difference]: Without dead ends: 81 [2019-08-04 21:28:35,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:28:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-04 21:28:35,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-04 21:28:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:28:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-04 21:28:35,850 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-04 21:28:35,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:35,850 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-04 21:28:35,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-04 21:28:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-04 21:28:35,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:28:35,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:35,851 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-04 21:28:35,851 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:35,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:35,852 INFO L82 PathProgramCache]: Analyzing trace with hash -909753603, now seen corresponding path program 77 times [2019-08-04 21:28:35,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:35,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-04 21:28:35,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:38,653 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:28:38,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:38,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-04 21:28:38,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-04 21:28:38,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-04 21:28:38,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:28:38,655 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-04 21:28:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:43,290 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-04 21:28:43,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-04 21:28:43,291 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-04 21:28:43,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:43,292 INFO L225 Difference]: With dead ends: 82 [2019-08-04 21:28:43,292 INFO L226 Difference]: Without dead ends: 82 [2019-08-04 21:28:43,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:28:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-04 21:28:43,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-04 21:28:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-04 21:28:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-04 21:28:43,295 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-04 21:28:43,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:43,296 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-04 21:28:43,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-04 21:28:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-04 21:28:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-04 21:28:43,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:43,296 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-04 21:28:43,297 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:43,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:43,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1862421639, now seen corresponding path program 78 times [2019-08-04 21:28:43,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:43,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-04 21:28:43,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:45,763 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:28:45,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:45,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-04 21:28:45,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-04 21:28:45,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-04 21:28:45,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:28:45,765 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-04 21:28:49,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:49,980 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-04 21:28:49,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-04 21:28:49,981 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-04 21:28:49,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:49,982 INFO L225 Difference]: With dead ends: 83 [2019-08-04 21:28:49,982 INFO L226 Difference]: Without dead ends: 83 [2019-08-04 21:28:49,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:28:49,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-04 21:28:49,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-04 21:28:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-04 21:28:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-04 21:28:49,985 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-04 21:28:49,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:49,985 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-04 21:28:49,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-04 21:28:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-04 21:28:49,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-04 21:28:49,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:49,986 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-04 21:28:49,986 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:49,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:49,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1900508221, now seen corresponding path program 79 times [2019-08-04 21:28:49,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:50,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-04 21:28:50,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:52,651 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:28:52,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:52,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-04 21:28:52,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-04 21:28:52,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-04 21:28:52,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:28:52,652 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-04 21:28:56,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:56,923 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-04 21:28:56,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-04 21:28:56,924 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-04 21:28:56,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:56,924 INFO L225 Difference]: With dead ends: 84 [2019-08-04 21:28:56,925 INFO L226 Difference]: Without dead ends: 84 [2019-08-04 21:28:56,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:28:56,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-04 21:28:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-04 21:28:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-04 21:28:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-04 21:28:56,927 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-04 21:28:56,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:56,927 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-04 21:28:56,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-04 21:28:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-04 21:28:56,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-04 21:28:56,928 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:56,928 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-04 21:28:56,928 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:56,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:56,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1213775033, now seen corresponding path program 80 times [2019-08-04 21:28:56,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:56,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-04 21:28:56,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:59,795 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:28:59,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:59,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-04 21:28:59,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-04 21:28:59,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-04 21:28:59,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:28:59,797 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-04 21:29:04,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:04,261 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-04 21:29:04,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-04 21:29:04,261 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-04 21:29:04,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:04,262 INFO L225 Difference]: With dead ends: 85 [2019-08-04 21:29:04,262 INFO L226 Difference]: Without dead ends: 85 [2019-08-04 21:29:04,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:29:04,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-04 21:29:04,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-04 21:29:04,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-04 21:29:04,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-04 21:29:04,265 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-04 21:29:04,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:04,265 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-04 21:29:04,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-04 21:29:04,266 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-04 21:29:04,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-04 21:29:04,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:04,266 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-04 21:29:04,266 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:04,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:04,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1027691901, now seen corresponding path program 81 times [2019-08-04 21:29:04,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:04,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-04 21:29:04,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:06,864 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:29:06,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:06,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-04 21:29:06,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-04 21:29:06,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-04 21:29:06,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:29:06,865 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-04 21:29:11,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:11,350 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-04 21:29:11,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-04 21:29:11,350 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-04 21:29:11,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:11,351 INFO L225 Difference]: With dead ends: 86 [2019-08-04 21:29:11,351 INFO L226 Difference]: Without dead ends: 86 [2019-08-04 21:29:11,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:29:11,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-04 21:29:11,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-04 21:29:11,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-04 21:29:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-04 21:29:11,354 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-04 21:29:11,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:11,355 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-04 21:29:11,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-04 21:29:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-04 21:29:11,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-04 21:29:11,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:11,356 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-04 21:29:11,356 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:11,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:11,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1793690119, now seen corresponding path program 82 times [2019-08-04 21:29:11,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:11,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-04 21:29:11,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:14,131 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:29:14,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:14,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-04 21:29:14,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-04 21:29:14,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-04 21:29:14,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:29:14,133 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-04 21:29:18,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:18,870 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-04 21:29:18,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-04 21:29:18,870 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-04 21:29:18,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:18,871 INFO L225 Difference]: With dead ends: 87 [2019-08-04 21:29:18,871 INFO L226 Difference]: Without dead ends: 87 [2019-08-04 21:29:18,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:29:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-04 21:29:18,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-04 21:29:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-04 21:29:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-04 21:29:18,874 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-04 21:29:18,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:18,874 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-04 21:29:18,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-04 21:29:18,874 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-04 21:29:18,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-04 21:29:18,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:18,875 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-04 21:29:18,875 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:18,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:18,876 INFO L82 PathProgramCache]: Analyzing trace with hash -230168899, now seen corresponding path program 83 times [2019-08-04 21:29:18,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:18,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-04 21:29:18,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:21,548 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:29:21,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:21,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-04 21:29:21,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-04 21:29:21,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-04 21:29:21,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:29:21,549 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-04 21:29:26,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:26,479 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-04 21:29:26,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-04 21:29:26,480 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-04 21:29:26,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:26,481 INFO L225 Difference]: With dead ends: 88 [2019-08-04 21:29:26,481 INFO L226 Difference]: Without dead ends: 88 [2019-08-04 21:29:26,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:29:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-04 21:29:26,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-04 21:29:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-04 21:29:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-04 21:29:26,484 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-04 21:29:26,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:26,484 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-04 21:29:26,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-04 21:29:26,484 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-04 21:29:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-04 21:29:26,485 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:26,485 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-04 21:29:26,491 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:26,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:26,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1454710983, now seen corresponding path program 84 times [2019-08-04 21:29:26,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:26,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-04 21:29:26,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:29,445 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:29:29,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:29,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-04 21:29:29,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-04 21:29:29,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-04 21:29:29,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:29:29,447 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-04 21:29:34,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:34,477 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-04 21:29:34,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-04 21:29:34,478 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-04 21:29:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:34,478 INFO L225 Difference]: With dead ends: 89 [2019-08-04 21:29:34,479 INFO L226 Difference]: Without dead ends: 89 [2019-08-04 21:29:34,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:29:34,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-04 21:29:34,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-04 21:29:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-04 21:29:34,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-04 21:29:34,481 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-04 21:29:34,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:34,482 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-04 21:29:34,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-04 21:29:34,482 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-04 21:29:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-04 21:29:34,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:34,483 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-04 21:29:34,483 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:34,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:34,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2146379773, now seen corresponding path program 85 times [2019-08-04 21:29:34,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:34,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-04 21:29:34,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:37,415 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:29:37,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:37,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-04 21:29:37,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-04 21:29:37,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-04 21:29:37,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:29:37,416 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-04 21:29:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:42,498 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-04 21:29:42,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-04 21:29:42,498 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-04 21:29:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:42,499 INFO L225 Difference]: With dead ends: 90 [2019-08-04 21:29:42,499 INFO L226 Difference]: Without dead ends: 90 [2019-08-04 21:29:42,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:29:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-04 21:29:42,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-04 21:29:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-04 21:29:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-04 21:29:42,502 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-04 21:29:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:42,503 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-04 21:29:42,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-04 21:29:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-04 21:29:42,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-04 21:29:42,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:42,504 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-04 21:29:42,504 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:42,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:42,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2113275783, now seen corresponding path program 86 times [2019-08-04 21:29:42,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:42,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-04 21:29:42,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:45,654 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:29:45,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:45,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-04 21:29:45,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-04 21:29:45,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-04 21:29:45,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:29:45,656 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. Received shutdown request... [2019-08-04 21:29:47,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:29:47,819 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:29:47,824 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:29:47,824 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:29:47 BoogieIcfgContainer [2019-08-04 21:29:47,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:29:47,826 INFO L168 Benchmark]: Toolchain (without parser) took 245099.03 ms. Allocated memory was 134.7 MB in the beginning and 244.3 MB in the end (delta: 109.6 MB). Free memory was 111.1 MB in the beginning and 62.2 MB in the end (delta: 48.9 MB). Peak memory consumption was 158.4 MB. Max. memory is 7.1 GB. [2019-08-04 21:29:47,827 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-04 21:29:47,827 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.59 ms. Allocated memory is still 134.7 MB. Free memory was 110.8 MB in the beginning and 109.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:29:47,828 INFO L168 Benchmark]: Boogie Preprocessor took 22.78 ms. Allocated memory is still 134.7 MB. Free memory was 109.4 MB in the beginning and 108.1 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:29:47,828 INFO L168 Benchmark]: RCFGBuilder took 276.05 ms. Allocated memory is still 134.7 MB. Free memory was 108.1 MB in the beginning and 97.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:29:47,829 INFO L168 Benchmark]: TraceAbstraction took 244756.82 ms. Allocated memory was 134.7 MB in the beginning and 244.3 MB in the end (delta: 109.6 MB). Free memory was 97.6 MB in the beginning and 62.2 MB in the end (delta: 35.4 MB). Peak memory consumption was 145.0 MB. Max. memory is 7.1 GB. [2019-08-04 21:29:47,833 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.7 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.59 ms. Allocated memory is still 134.7 MB. Free memory was 110.8 MB in the beginning and 109.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.78 ms. Allocated memory is still 134.7 MB. Free memory was 109.4 MB in the beginning and 108.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 276.05 ms. Allocated memory is still 134.7 MB. Free memory was 108.1 MB in the beginning and 97.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244756.82 ms. Allocated memory was 134.7 MB in the beginning and 244.3 MB in the end (delta: 109.6 MB). Free memory was 97.6 MB in the beginning and 62.2 MB in the end (delta: 35.4 MB). Peak memory consumption was 145.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 43). Cancelled while BasicCegarLoop was constructing difference of abstraction (90states) and FLOYD_HOARE automaton (currently 39 states, 89 states before enhancement),while ReachableStatesComputation was computing reachable states (37 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 244.6s OverallTime, 87 OverallIterations, 86 TraceHistogramMax, 123.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 259 SDtfs, 0 SDslu, 2812 SDs, 0 SdLazy, 180027 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 101.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3915 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3828 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 116.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=86, 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, 86 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 119.5s InterpolantComputationTime, 4002 NumberOfCodeBlocks, 4002 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 3915 ConstructedInterpolants, 0 QuantifiedInterpolants, 685299 SizeOfPredicates, 137 NumberOfNonLiveVariables, 8787 ConjunctsInSsa, 3951 ConjunctsInUnsatCore, 87 InterpolantComputations, 1 PerfectInterpolantSequences, 0/109736 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown