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-05 10:48:19,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:48:19,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:48:19,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:48:19,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:48:19,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:48:19,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:48:19,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:48:19,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:48:19,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:48:19,514 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:48:19,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:48:19,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:48:19,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:48:19,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:48:19,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:48:19,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:48:19,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:48:19,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:48:19,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:48:19,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:48:19,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:48:19,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:48:19,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:48:19,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:48:19,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:48:19,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:48:19,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:48:19,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:48:19,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:48:19,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:48:19,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:48:19,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:48:19,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:48:19,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:48:19,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:48:19,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:48:19,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:48:19,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:48:19,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:48:19,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:48:19,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:48:19,609 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:48:19,614 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:48:19,615 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:48:19,616 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:48:19,617 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-05 10:48:19,617 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-05 10:48:19,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:48:19,660 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:48:19,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:48:19,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:48:19,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:48:19,679 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 05.08 10:48:19" (1/1) ... [2019-08-05 10:48:19,688 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 05.08 10:48:19" (1/1) ... [2019-08-05 10:48:19,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:48:19,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:48:19,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:48:19,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:48:19,709 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 05.08 10:48:19" (1/1) ... [2019-08-05 10:48:19,709 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 05.08 10:48:19" (1/1) ... [2019-08-05 10:48:19,711 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 05.08 10:48:19" (1/1) ... [2019-08-05 10:48:19,711 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 05.08 10:48:19" (1/1) ... [2019-08-05 10:48:19,715 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 05.08 10:48:19" (1/1) ... [2019-08-05 10:48:19,717 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 05.08 10:48:19" (1/1) ... [2019-08-05 10:48:19,718 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 05.08 10:48:19" (1/1) ... [2019-08-05 10:48:19,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:48:19,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:48:19,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:48:19,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:48:19,722 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 05.08 10:48:19" (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-05 10:48:19,790 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:48:19,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:48:19,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:48:20,110 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:48:20,110 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:48:20,111 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:48:20 BoogieIcfgContainer [2019-08-05 10:48:20,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:48:20,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:48:20,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:48:20,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:48:20,117 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 05.08 10:48:19" (1/2) ... [2019-08-05 10:48:20,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c31341 and model type gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:48:20, skipping insertion in model container [2019-08-05 10:48:20,118 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 05.08 10:48:20" (2/2) ... [2019-08-05 10:48:20,120 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:48:20,129 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:48:20,136 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:48:20,152 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:48:20,178 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:48:20,179 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:48:20,179 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:48:20,179 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:48:20,179 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:48:20,179 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:48:20,180 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:48:20,180 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:48:20,180 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:48:20,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:48:20,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:48:20,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:20,201 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:48:20,204 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:20,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:20,210 INFO L82 PathProgramCache]: Analyzing trace with hash 30023, now seen corresponding path program 1 times [2019-08-05 10:48:20,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:20,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:48:20,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:20,402 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-05 10:48:20,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:48:20,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:48:20,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:48:20,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:48:20,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:48:20,457 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:48:20,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:20,506 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:48:20,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:48:20,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:48:20,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:20,518 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:48:20,518 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:48:20,520 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-05 10:48:20,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:48:20,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:48:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:48:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:48:20,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:48:20,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:20,553 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:48:20,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:48:20,553 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:48:20,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:48:20,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:20,555 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:48:20,556 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:20,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:20,556 INFO L82 PathProgramCache]: Analyzing trace with hash 942973, now seen corresponding path program 1 times [2019-08-05 10:48:20,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:20,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:48:20,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:20,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:20,701 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-05 10:48:20,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:20,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:48:20,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:48:20,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:48:20,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:48:20,705 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:48:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:20,739 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:48:20,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:48:20,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:48:20,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:20,740 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:48:20,740 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:48:20,741 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-05 10:48:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:48:20,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:48:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:48:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:48:20,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:48:20,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:20,743 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:48:20,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:48:20,744 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:48:20,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:48:20,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:20,745 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:48:20,745 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:20,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:20,746 INFO L82 PathProgramCache]: Analyzing trace with hash 29244423, now seen corresponding path program 2 times [2019-08-05 10:48:20,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:20,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:48:20,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:20,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:20,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:20,922 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-05 10:48:20,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:20,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:48:20,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:48:20,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:48:20,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:48:20,924 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:48:20,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:20,965 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:48:20,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:48:20,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:48:20,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:20,966 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:48:20,966 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:48:20,968 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-05 10:48:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:48:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:48:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:48:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:48:20,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:48:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:20,971 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:48:20,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:48:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:48:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:48:20,972 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:20,972 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:48:20,972 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:20,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:20,973 INFO L82 PathProgramCache]: Analyzing trace with hash 906589373, now seen corresponding path program 3 times [2019-08-05 10:48:20,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:20,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:48:20,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:21,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:21,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:21,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:21,304 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-05 10:48:21,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:21,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:48:21,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:48:21,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:48:21,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:48:21,306 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:48:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:21,394 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:48:21,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:48:21,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:48:21,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:21,395 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:48:21,395 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:48:21,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:48:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:48:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:48:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:48:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:48:21,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:48:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:21,398 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:48:21,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:48:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:48:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:48:21,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:21,399 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:48:21,399 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:21,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1960488249, now seen corresponding path program 4 times [2019-08-05 10:48:21,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:21,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:48:21,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:21,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:21,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:21,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:21,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:21,658 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-05 10:48:21,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:21,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:48:21,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:48:21,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:48:21,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:48:21,660 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:48:21,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:21,689 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:48:21,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:48:21,690 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:48:21,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:21,691 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:48:21,691 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:48:21,691 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-05 10:48:21,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:48:21,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:48:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:48:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:48:21,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:48:21,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:21,696 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:48:21,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:48:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:48:21,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:48:21,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:21,697 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:48:21,697 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:21,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:21,698 INFO L82 PathProgramCache]: Analyzing trace with hash -645581315, now seen corresponding path program 5 times [2019-08-05 10:48:21,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:21,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:48:21,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:21,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:21,868 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:48:21,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:21,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:21,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:21,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:22,005 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-05 10:48:22,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:22,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:48:22,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:48:22,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:48:22,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:48:22,007 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:48:22,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:22,098 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:48:22,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:48:22,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:48:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:22,099 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:48:22,099 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:48:22,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:48:22,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:48:22,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:48:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:48:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:48:22,102 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:48:22,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:22,102 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:48:22,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:48:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:48:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:48:22,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:22,103 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:48:22,104 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:22,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:22,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1461827975, now seen corresponding path program 6 times [2019-08-05 10:48:22,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:22,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:48:22,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:22,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:22,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:22,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:22,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:22,489 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:48:22,492 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:22,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:22,585 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-05 10:48:22,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:22,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:48:22,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:48:22,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:48:22,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:48:22,587 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:48:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:22,622 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:48:22,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:48:22,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:48:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:22,624 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:48:22,624 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:48:22,625 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-05 10:48:22,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:48:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:48:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:48:22,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:48:22,627 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:48:22,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:22,627 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:48:22,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:48:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:48:22,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:48:22,628 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:22,628 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:48:22,628 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:22,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:22,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1927960771, now seen corresponding path program 7 times [2019-08-05 10:48:22,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:22,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:48:22,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:22,679 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:22,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:22,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:22,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:22,805 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:22,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:22,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:22,921 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-05 10:48:22,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:22,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:48:22,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:48:22,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:48:22,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:48:22,924 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:48:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:23,000 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:48:23,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:48:23,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:48:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:23,006 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:48:23,006 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:48:23,007 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-05 10:48:23,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:48:23,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:48:23,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:48:23,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:48:23,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:48:23,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:23,010 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:48:23,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:48:23,010 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:48:23,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:48:23,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:23,011 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:48:23,011 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:23,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:23,012 INFO L82 PathProgramCache]: Analyzing trace with hash 362770503, now seen corresponding path program 8 times [2019-08-05 10:48:23,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:23,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:48:23,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:23,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,199 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,364 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-05 10:48:23,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:23,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:48:23,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:48:23,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:48:23,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:48:23,366 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:48:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:23,407 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:48:23,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:48:23,407 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:48:23,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:23,408 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:48:23,408 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:48:23,409 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-05 10:48:23,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:48:23,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:48:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:48:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:48:23,412 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:48:23,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:23,412 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:48:23,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:48:23,412 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:48:23,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:48:23,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:23,413 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:48:23,413 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:23,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:23,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1639004035, now seen corresponding path program 9 times [2019-08-05 10:48:23,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:23,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:48:23,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:23,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,502 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,656 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,743 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-05 10:48:23,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:23,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:48:23,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:48:23,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:48:23,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:48:23,745 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:48:23,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:23,770 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:48:23,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:48:23,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:48:23,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:23,771 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:48:23,772 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:48:23,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:48:23,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:48:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:48:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:48:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:48:23,775 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:48:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:23,775 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:48:23,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:48:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:48:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:48:23,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:23,776 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:48:23,776 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:23,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:23,777 INFO L82 PathProgramCache]: Analyzing trace with hash 730494727, now seen corresponding path program 10 times [2019-08-05 10:48:23,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:23,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:48:23,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:23,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,944 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:24,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:24,035 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-05 10:48:24,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:24,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:48:24,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:48:24,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:48:24,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:48:24,037 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:48:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:24,097 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:48:24,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:48:24,098 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:48:24,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:24,099 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:48:24,099 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:48:24,100 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-05 10:48:24,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:48:24,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:48:24,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:48:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:48:24,103 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:48:24,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:24,103 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:48:24,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:48:24,103 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:48:24,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:48:24,104 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:24,104 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:48:24,104 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:24,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:24,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1170512317, now seen corresponding path program 11 times [2019-08-05 10:48:24,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:24,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:48:24,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:24,149 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:24,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:24,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:24,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:24,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:24,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:24,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:24,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:24,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:24,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:24,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:24,844 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-05 10:48:24,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:24,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:48:24,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:48:24,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:48:24,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:48:24,845 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:48:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:24,871 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:48:24,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:48:24,871 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:48:24,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:24,872 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:48:24,872 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:48:24,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:48:24,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:48:24,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:48:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:48:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:48:24,876 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:48:24,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:24,876 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:48:24,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:48:24,877 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:48:24,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:48:24,877 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:24,877 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:48:24,878 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:24,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:24,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1926155719, now seen corresponding path program 12 times [2019-08-05 10:48:24,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:24,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:48:24,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:24,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:24,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,205 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,238 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,487 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:48:25,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,645 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-05 10:48:25,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:25,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:48:25,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:48:25,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:48:25,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:48:25,647 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:48:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:25,690 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:48:25,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:48:25,691 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:48:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:25,692 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:48:25,692 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:48:25,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:48:25,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:48:25,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:48:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:48:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:48:25,696 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:48:25,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:25,696 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:48:25,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:48:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:48:25,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:48:25,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:25,697 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:48:25,697 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:25,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:25,697 INFO L82 PathProgramCache]: Analyzing trace with hash -418702595, now seen corresponding path program 13 times [2019-08-05 10:48:25,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:25,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:48:25,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:25,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,923 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,942 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,138 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-05 10:48:26,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:26,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:48:26,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:48:26,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:48:26,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:48:26,140 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:48:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:26,163 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:48:26,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:48:26,163 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:48:26,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:26,164 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:48:26,164 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:48:26,165 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-05 10:48:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:48:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:48:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:48:26,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:48:26,168 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:48:26,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:26,168 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:48:26,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:48:26,168 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:48:26,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:48:26,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:26,169 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:48:26,169 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:26,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:26,169 INFO L82 PathProgramCache]: Analyzing trace with hash -94866297, now seen corresponding path program 14 times [2019-08-05 10:48:26,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:26,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:48:26,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:26,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,265 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,305 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,397 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,433 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,637 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-05 10:48:26,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:26,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:48:26,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:48:26,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:48:26,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:48:26,639 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:48:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:26,732 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:48:26,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:48:26,733 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:48:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:26,734 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:48:26,734 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:48:26,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:48:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:48:26,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:48:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:48:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:48:26,739 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:48:26,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:26,740 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:48:26,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:48:26,740 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:48:26,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:48:26,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:26,741 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:48:26,741 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:26,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:26,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1354124349, now seen corresponding path program 15 times [2019-08-05 10:48:26,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:26,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:48:26,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:26,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,071 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,338 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-05 10:48:27,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:27,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:48:27,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:48:27,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:48:27,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:48:27,340 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:48:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:27,378 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:48:27,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:48:27,378 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:48:27,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:27,379 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:48:27,380 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:48:27,380 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-05 10:48:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:48:27,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:48:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:48:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:48:27,383 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:48:27,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:27,384 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:48:27,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:48:27,384 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:48:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:48:27,384 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:27,385 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:48:27,385 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:27,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:27,385 INFO L82 PathProgramCache]: Analyzing trace with hash -971805881, now seen corresponding path program 16 times [2019-08-05 10:48:27,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:27,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:48:27,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:27,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,523 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,711 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-05 10:48:27,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:27,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:48:27,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:48:27,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:48:27,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:48:27,713 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:48:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:27,760 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:48:27,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:48:27,761 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:48:27,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:27,762 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:48:27,762 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:48:27,763 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-05 10:48:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:48:27,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:48:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:48:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:48:27,765 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:48:27,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:27,765 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:48:27,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:48:27,765 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:48:27,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:48:27,766 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:27,766 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:48:27,766 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:27,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:27,766 INFO L82 PathProgramCache]: Analyzing trace with hash -61198979, now seen corresponding path program 17 times [2019-08-05 10:48:27,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:27,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:48:27,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:27,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,843 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,864 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:27,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,196 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,269 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-05 10:48:28,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:28,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:48:28,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:48:28,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:48:28,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:48:28,272 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:48:28,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:28,314 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:48:28,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:48:28,319 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:48:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:28,320 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:48:28,320 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:48:28,321 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-05 10:48:28,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:48:28,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:48:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:48:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:48:28,324 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:48:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:28,325 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:48:28,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:48:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:48:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:48:28,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:28,326 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:48:28,327 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:28,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:28,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1897156089, now seen corresponding path program 18 times [2019-08-05 10:48:28,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:28,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:48:28,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:28,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,325 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:48:29,326 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-05 10:48:29,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:29,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:48:29,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:48:29,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:48:29,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:48:29,328 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:48:29,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:29,448 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:48:29,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:48:29,448 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:48:29,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:29,449 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:48:29,450 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:48:29,451 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-05 10:48:29,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:48:29,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:48:29,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:48:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:48:29,454 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:48:29,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:29,454 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:48:29,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:48:29,454 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:48:29,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:48:29,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:29,455 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:48:29,455 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:29,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:29,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1317715645, now seen corresponding path program 19 times [2019-08-05 10:48:29,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:29,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:48:29,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:29,502 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,630 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,642 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,690 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,914 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-05 10:48:29,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:29,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:48:29,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:48:29,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:48:29,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:48:29,916 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:48:29,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:29,955 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:48:29,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:48:29,956 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:48:29,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:29,957 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:48:29,957 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:48:29,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:48:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:48:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:48:29,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:48:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:48:29,960 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:48:29,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:29,960 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:48:29,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:48:29,961 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:48:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:48:29,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:29,961 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:48:29,962 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:29,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:29,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2100475705, now seen corresponding path program 20 times [2019-08-05 10:48:29,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:29,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:48:29,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:30,040 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,201 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:48:30,202 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,537 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,616 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-05 10:48:30,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:30,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:48:30,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:48:30,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:48:30,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:48:30,618 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:48:30,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:30,647 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:48:30,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:48:30,647 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:48:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:30,648 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:48:30,649 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:48:30,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:48:30,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:48:30,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:48:30,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:48:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:48:30,653 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:48:30,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:30,653 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:48:30,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:48:30,653 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:48:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:48:30,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:30,654 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:48:30,654 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:30,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:30,655 INFO L82 PathProgramCache]: Analyzing trace with hash -690225155, now seen corresponding path program 21 times [2019-08-05 10:48:30,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:30,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:48:30,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:30,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,728 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,232 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-05 10:48:31,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:31,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:48:31,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:48:31,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:48:31,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:48:31,235 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:48:31,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:31,300 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:48:31,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:48:31,303 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:48:31,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:31,303 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:48:31,303 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:48:31,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:48:31,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:48:31,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:48:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:48:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:48:31,307 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:48:31,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:31,307 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:48:31,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:48:31,308 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:48:31,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:48:31,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:31,308 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:48:31,309 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:31,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:31,309 INFO L82 PathProgramCache]: Analyzing trace with hash 77868935, now seen corresponding path program 22 times [2019-08-05 10:48:31,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:31,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:48:31,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:31,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,535 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,571 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,701 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,806 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-05 10:48:31,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:31,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:48:31,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:48:31,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:48:31,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:48:31,808 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:48:31,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:31,879 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:48:31,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:48:31,879 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:48:31,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:31,880 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:48:31,880 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:48:31,881 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-05 10:48:31,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:48:31,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:48:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:48:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:48:31,884 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:48:31,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:31,885 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:48:31,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:48:31,885 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:48:31,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:48:31,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:31,885 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:48:31,886 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:31,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:31,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1881018051, now seen corresponding path program 23 times [2019-08-05 10:48:31,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:31,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:48:31,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:31,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,033 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,158 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,455 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-05 10:48:32,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:32,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:48:32,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:48:32,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:48:32,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:48:32,457 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:48:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:32,519 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:48:32,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:48:32,520 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:48:32,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:32,520 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:48:32,520 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:48:32,521 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-05 10:48:32,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:48:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:48:32,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:48:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:48:32,524 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:48:32,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:32,525 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:48:32,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:48:32,525 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:48:32,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:48:32,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:32,526 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:48:32,527 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:32,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:32,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1817994823, now seen corresponding path program 24 times [2019-08-05 10:48:32,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:32,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:48:32,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:32,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,926 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,942 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,126 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,160 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,610 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-05 10:48:33,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:33,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:48:33,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:48:33,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:48:33,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:48:33,612 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:48:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:33,659 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:48:33,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:48:33,660 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:48:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:33,660 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:48:33,660 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:48:33,661 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-05 10:48:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:48:33,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:48:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:48:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:48:33,665 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:48:33,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:33,665 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:48:33,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:48:33,665 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:48:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:48:33,666 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:33,666 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:48:33,666 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:33,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:33,666 INFO L82 PathProgramCache]: Analyzing trace with hash 523276925, now seen corresponding path program 25 times [2019-08-05 10:48:33,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:33,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:48:33,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:33,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,969 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,074 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,559 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-05 10:48:34,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:34,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:48:34,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:48:34,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:48:34,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:48:34,562 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:48:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:34,617 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:48:34,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:48:34,618 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:48:34,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:34,619 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:48:34,619 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:48:34,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:48:34,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:48:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:48:34,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:48:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:48:34,622 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:48:34,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:34,622 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:48:34,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:48:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:48:34,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:48:34,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:34,623 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:48:34,623 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:34,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:34,623 INFO L82 PathProgramCache]: Analyzing trace with hash -958272249, now seen corresponding path program 26 times [2019-08-05 10:48:34,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:34,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:48:34,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:34,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,733 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,942 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:35,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:35,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:35,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:35,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:35,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:35,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:35,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:35,699 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:35,729 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-05 10:48:35,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:35,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:48:35,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:48:35,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:48:35,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:48:35,731 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:48:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:35,815 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:48:35,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:48:35,816 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:48:35,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:35,816 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:48:35,816 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:48:35,817 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-05 10:48:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:48:35,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:48:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:48:35,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:48:35,819 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:48:35,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:35,821 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:48:35,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:48:35,821 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:48:35,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:48:35,821 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:35,822 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:48:35,822 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:35,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:35,823 INFO L82 PathProgramCache]: Analyzing trace with hash 358343613, now seen corresponding path program 27 times [2019-08-05 10:48:35,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:35,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:48:35,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:35,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:35,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:35,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:35,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:35,940 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:35,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:35,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:35,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,069 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,194 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,443 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,558 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-05 10:48:36,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:36,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:48:36,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:48:36,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:48:36,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:48:36,559 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:48:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:36,620 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:48:36,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:48:36,620 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:48:36,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:36,621 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:48:36,621 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:48:36,622 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-05 10:48:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:48:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:48:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:48:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:48:36,625 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:48:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:36,625 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:48:36,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:48:36,626 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:48:36,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:48:36,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:36,626 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:48:36,627 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:36,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:36,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1776237625, now seen corresponding path program 28 times [2019-08-05 10:48:36,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:36,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:48:36,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:36,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,952 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,042 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,186 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,339 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,401 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-05 10:48:37,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:37,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:48:37,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:48:37,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:48:37,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:48:37,403 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:48:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:37,453 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:48:37,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:48:37,453 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:48:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:37,454 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:48:37,454 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:48:37,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:48:37,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:48:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:48:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:48:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:48:37,458 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:48:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:37,459 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:48:37,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:48:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:48:37,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:48:37,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:37,459 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:48:37,460 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:37,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:37,460 INFO L82 PathProgramCache]: Analyzing trace with hash 771220733, now seen corresponding path program 29 times [2019-08-05 10:48:37,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:37,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:48:37,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:37,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,659 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,733 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,909 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,230 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,262 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-05 10:48:38,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:38,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:48:38,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:48:38,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:48:38,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:48:38,263 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:48:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:38,313 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:48:38,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:48:38,313 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:48:38,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:38,314 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:48:38,314 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:48:38,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:48:38,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:48:38,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:48:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:48:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:48:38,318 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:48:38,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:38,318 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:48:38,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:48:38,319 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:48:38,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:48:38,319 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:38,319 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:48:38,320 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:38,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:38,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1861948793, now seen corresponding path program 30 times [2019-08-05 10:48:38,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:38,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:48:38,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:38,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,458 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,502 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,561 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,595 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,701 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,942 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,969 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:39,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:39,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:39,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:39,096 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-05 10:48:39,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:39,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:48:39,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:48:39,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:48:39,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:48:39,098 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:48:39,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:39,149 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:48:39,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:48:39,150 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:48:39,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:39,150 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:48:39,151 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:48:39,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:48:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:48:39,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:48:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:48:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:48:39,154 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:48:39,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:39,155 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:48:39,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:48:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:48:39,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:48:39,155 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:39,155 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:48:39,155 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:39,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:39,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1885825475, now seen corresponding path program 31 times [2019-08-05 10:48:39,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:39,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:48:39,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:39,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:39,437 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:48:39,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:39,670 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:48:39,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:39,917 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:48:39,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,077 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,147 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,226 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,270 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,721 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,951 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-05 10:48:40,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:40,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:48:40,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:48:40,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:48:40,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:48:40,953 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:48:41,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:41,036 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:48:41,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:48:41,038 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:48:41,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:41,038 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:48:41,039 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:48:41,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:48:41,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:48:41,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:48:41,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:48:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:48:41,041 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:48:41,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:41,042 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:48:41,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:48:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:48:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:48:41,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:41,043 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:48:41,043 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:41,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:41,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1668964679, now seen corresponding path program 32 times [2019-08-05 10:48:41,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:41,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:48:41,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:41,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,151 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,678 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,899 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,966 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-05 10:48:41,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:41,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:48:41,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:48:41,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:48:41,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:48:41,968 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:48:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:42,035 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:48:42,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:48:42,035 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:48:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:42,036 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:48:42,036 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:48:42,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:48:42,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:48:42,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:48:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:48:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:48:42,040 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:48:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:42,040 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:48:42,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:48:42,041 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:48:42,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:48:42,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:42,041 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:48:42,041 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:42,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:42,042 INFO L82 PathProgramCache]: Analyzing trace with hash 198309757, now seen corresponding path program 33 times [2019-08-05 10:48:42,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:42,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:48:42,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:42,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,204 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,231 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,629 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,869 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:42,904 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-05 10:48:42,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:42,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:48:42,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:48:42,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:48:42,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:48:42,906 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:48:42,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:42,952 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:48:42,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:48:42,952 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:48:42,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:42,953 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:48:42,953 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:48:42,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:48:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:48:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:48:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:48:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:48:42,956 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:48:42,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:42,956 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:48:42,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:48:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:48:42,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:48:42,956 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:42,957 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:48:42,957 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:42,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:42,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1852647431, now seen corresponding path program 34 times [2019-08-05 10:48:42,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:42,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:48:42,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:43,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,033 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,204 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,643 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,935 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,973 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-05 10:48:43,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:43,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:48:43,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:48:43,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:48:43,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:48:43,974 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:48:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:44,015 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:48:44,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:48:44,015 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:48:44,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:44,016 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:48:44,016 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:48:44,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:48:44,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:48:44,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:48:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:48:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:48:44,020 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:48:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:44,020 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:48:44,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:48:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:48:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:48:44,021 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:44,021 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:48:44,021 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:44,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1597507773, now seen corresponding path program 35 times [2019-08-05 10:48:44,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:44,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:48:44,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:44,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,123 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,204 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,256 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,425 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,523 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,573 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,940 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,077 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-05 10:48:45,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:45,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:48:45,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:48:45,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:48:45,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:48:45,078 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:48:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:45,141 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:48:45,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:48:45,141 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:48:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:45,142 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:48:45,142 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:48:45,143 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-05 10:48:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:48:45,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:48:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:48:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:48:45,145 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:48:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:45,146 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:48:45,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:48:45,146 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:48:45,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:48:45,146 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:45,146 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:48:45,147 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:45,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:45,147 INFO L82 PathProgramCache]: Analyzing trace with hash -2016854329, now seen corresponding path program 36 times [2019-08-05 10:48:45,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:45,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:48:45,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:45,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,265 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,549 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,669 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:45,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:46,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:46,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:46,089 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:46,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:46,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:46,186 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:46,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:46,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:46,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:46,330 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-05 10:48:46,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:46,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:48:46,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:48:46,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:48:46,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:48:46,332 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:48:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:46,376 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:48:46,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:48:46,377 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:48:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:46,377 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:48:46,377 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:48:46,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:48:46,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:48:46,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:48:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:48:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:48:46,381 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:48:46,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:46,381 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:48:46,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:48:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:48:46,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:48:46,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:46,382 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:48:46,382 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:46,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:46,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1902037501, now seen corresponding path program 37 times [2019-08-05 10:48:46,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:46,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:48:46,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:46,458 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:46,639 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:48:46,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:46,861 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:48:46,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,147 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,204 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,358 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,443 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,837 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,874 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-05 10:48:47,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:47,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:48:47,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:48:47,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:48:47,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:48:47,875 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:48:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:47,944 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:48:47,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:48:47,945 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:48:47,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:47,945 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:48:47,946 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:48:47,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:48:47,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:48:47,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:48:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:48:47,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:48:47,949 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:48:47,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:47,949 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:48:47,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:48:47,950 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:48:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:48:47,950 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:47,950 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:48:47,950 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:47,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:47,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1166367353, now seen corresponding path program 38 times [2019-08-05 10:48:47,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:47,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:48:47,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:48,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,217 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:48:48,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,341 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,434 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,733 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,967 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:49,000 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:49,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:49,074 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:49,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:49,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:49,189 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-05 10:48:49,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:49,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:48:49,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:48:49,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:48:49,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:48:49,190 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:48:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:49,241 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:48:49,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:48:49,242 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:48:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:49,243 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:48:49,243 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:48:49,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:48:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:48:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:48:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:48:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:48:49,247 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:48:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:49,247 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:48:49,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:48:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:48:49,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:48:49,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:49,248 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:48:49,248 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:49,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:49,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1797637315, now seen corresponding path program 39 times [2019-08-05 10:48:49,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:49,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:48:49,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:49,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:49,493 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:48:49,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:49,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:49,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:49,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:49,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:49,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:49,597 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:49,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:49,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:49,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:49,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,126 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,230 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:51,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:51,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:51,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:51,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:51,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:51,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:51,227 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:51,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:51,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:51,340 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:51,386 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-05 10:48:51,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:51,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:48:51,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:48:51,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:48:51,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:48:51,388 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:48:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:51,441 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:48:51,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:48:51,441 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:48:51,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:51,442 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:48:51,442 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:48:51,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:48:51,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:48:51,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:48:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:48:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:48:51,446 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:48:51,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:51,446 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:48:51,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:48:51,446 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:48:51,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:48:51,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:51,446 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:48:51,447 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:51,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:51,447 INFO L82 PathProgramCache]: Analyzing trace with hash 107830343, now seen corresponding path program 40 times [2019-08-05 10:48:51,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:51,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:48:51,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:51,510 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:51,695 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:48:51,696 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:51,914 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:48:51,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,153 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:48:52,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,444 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,549 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,573 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,699 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,260 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-05 10:48:53,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:53,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:48:53,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:48:53,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:48:53,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:48:53,262 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:48:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:53,339 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:48:53,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:48:53,340 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:48:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:53,340 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:48:53,341 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:48:53,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:48:53,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:48:53,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:48:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:48:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:48:53,344 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:48:53,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:53,344 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:48:53,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:48:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:48:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:48:53,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:53,345 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:48:53,345 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:53,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:53,345 INFO L82 PathProgramCache]: Analyzing trace with hash -952214403, now seen corresponding path program 41 times [2019-08-05 10:48:53,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:53,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:48:53,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:53,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,417 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,766 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,843 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:53,990 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,070 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,397 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,437 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-05 10:48:54,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:54,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:48:54,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:48:54,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:48:54,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:48:54,439 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:48:54,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:54,515 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:48:54,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:48:54,516 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:48:54,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:54,516 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:48:54,516 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:48:54,517 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-05 10:48:54,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:48:54,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:48:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:48:54,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:48:54,519 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:48:54,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:54,520 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:48:54,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:48:54,520 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:48:54,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:48:54,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:54,521 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:48:54,521 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:54,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:54,521 INFO L82 PathProgramCache]: Analyzing trace with hash 546136839, now seen corresponding path program 42 times [2019-08-05 10:48:54,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:54,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:48:54,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:54,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,893 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,160 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,577 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,613 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,892 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,940 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,055 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-05 10:48:56,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:56,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:48:56,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:48:56,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:48:56,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:48:56,057 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:48:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:56,109 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:48:56,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:48:56,109 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:48:56,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:56,110 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:48:56,110 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:48:56,112 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-05 10:48:56,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:48:56,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:48:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:48:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:48:56,114 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:48:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:56,115 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:48:56,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:48:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:48:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:48:56,115 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:56,115 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:48:56,115 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:56,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:56,115 INFO L82 PathProgramCache]: Analyzing trace with hash -249614915, now seen corresponding path program 43 times [2019-08-05 10:48:56,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:56,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:48:56,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:56,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,238 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,356 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,448 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,509 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,729 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,361 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-05 10:48:57,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:57,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:48:57,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:48:57,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:48:57,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:48:57,364 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:48:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:57,487 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:48:57,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:48:57,487 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:48:57,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:57,488 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:48:57,488 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:48:57,488 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-05 10:48:57,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:48:57,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:48:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:48:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:48:57,490 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:48:57,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:57,491 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:48:57,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:48:57,491 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:48:57,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:48:57,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:57,492 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:48:57,492 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:57,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:57,492 INFO L82 PathProgramCache]: Analyzing trace with hash 851884487, now seen corresponding path program 44 times [2019-08-05 10:48:57,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:57,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:48:57,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:57,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,805 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,923 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:57,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,126 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,419 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,613 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,798 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-05 10:48:58,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:58,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:48:58,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:48:58,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:48:58,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:48:58,800 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:48:58,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:58,924 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:48:58,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:48:58,925 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:48:58,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:58,926 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:48:58,926 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:48:58,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:48:58,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:48:58,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:48:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:48:58,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:48:58,932 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:48:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:58,932 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:48:58,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:48:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:48:58,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:48:58,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:58,933 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:48:58,933 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:58,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:58,933 INFO L82 PathProgramCache]: Analyzing trace with hash 638627581, now seen corresponding path program 45 times [2019-08-05 10:48:58,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:58,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:48:58,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:58,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,073 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,125 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,443 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,499 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,892 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:59,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,219 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-05 10:49:00,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:00,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:49:00,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:49:00,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:49:00,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:49:00,220 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:49:00,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:00,476 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:49:00,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:49:00,476 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:49:00,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:00,477 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:49:00,477 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:49:00,478 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-05 10:49:00,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:49:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:49:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:49:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:49:00,480 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:49:00,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:00,480 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:49:00,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:49:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:49:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:49:00,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:00,481 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:49:00,481 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:00,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:00,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1677369209, now seen corresponding path program 46 times [2019-08-05 10:49:00,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:00,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:49:00,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:00,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,693 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,417 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,491 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,911 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:01,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,079 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,123 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,226 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-05 10:49:02,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:02,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:49:02,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:49:02,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:49:02,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:49:02,228 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:49:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:02,323 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:49:02,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:49:02,324 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:49:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:02,325 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:49:02,325 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:49:02,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:49:02,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:49:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:49:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:49:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:49:02,328 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:49:02,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:02,329 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:49:02,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:49:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:49:02,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:49:02,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:02,330 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:49:02,330 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:02,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:02,330 INFO L82 PathProgramCache]: Analyzing trace with hash -458825667, now seen corresponding path program 47 times [2019-08-05 10:49:02,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:02,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:49:02,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:02,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,416 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,428 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,499 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,565 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,627 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,669 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,695 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,076 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,147 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,492 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,573 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,699 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,745 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-05 10:49:03,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:03,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:49:03,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:49:03,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:49:03,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:49:03,746 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:49:03,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:03,808 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:49:03,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:49:03,809 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:49:03,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:03,810 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:49:03,810 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:49:03,811 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-05 10:49:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:49:03,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:49:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:49:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:49:03,813 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:49:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:03,813 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:49:03,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:49:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:49:03,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:49:03,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:03,814 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:49:03,814 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:03,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:03,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1338681529, now seen corresponding path program 48 times [2019-08-05 10:49:03,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:03,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:49:03,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:03,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,948 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,970 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:03,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,057 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,074 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,150 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,491 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,693 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,737 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-05 10:49:05,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:05,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:49:05,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:49:05,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:49:05,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:49:05,739 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:49:05,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:05,816 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:49:05,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:49:05,817 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:49:05,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:05,818 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:49:05,818 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:49:05,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:49:05,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:49:05,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:49:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:49:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:49:05,822 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:49:05,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:05,822 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:49:05,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:49:05,822 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:49:05,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:49:05,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:05,823 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:49:05,823 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:05,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:05,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1450557821, now seen corresponding path program 49 times [2019-08-05 10:49:05,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:05,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:49:05,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:05,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:05,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,000 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,225 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,339 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,399 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,419 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,538 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,893 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:06,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,227 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,479 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,626 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-05 10:49:07,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:07,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:49:07,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:49:07,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:49:07,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:49:07,628 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:49:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:07,690 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:49:07,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:49:07,691 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:49:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:07,691 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:49:07,691 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:49:07,692 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-05 10:49:07,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:49:07,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:49:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:49:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:49:07,694 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:49:07,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:07,694 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:49:07,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:49:07,694 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:49:07,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:49:07,695 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:07,695 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:49:07,695 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:07,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:07,696 INFO L82 PathProgramCache]: Analyzing trace with hash 2017631751, now seen corresponding path program 50 times [2019-08-05 10:49:07,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:07,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:49:07,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:07,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,886 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,073 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,194 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,303 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,424 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,578 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,829 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:08,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:09,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:09,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:09,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:09,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:09,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:09,225 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:09,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:09,325 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-05 10:49:09,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:09,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:49:09,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:49:09,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:49:09,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:49:09,327 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:49:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:09,403 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:49:09,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:49:09,404 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:49:09,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:09,405 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:49:09,405 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:49:09,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:49:09,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:49:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:49:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:49:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:49:09,407 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:49:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:09,408 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:49:09,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:49:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:49:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:49:09,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:09,408 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:49:09,409 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:09,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:09,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1877912899, now seen corresponding path program 51 times [2019-08-05 10:49:09,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:09,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:49:09,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:10,605 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-05 10:49:10,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:10,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:49:10,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:49:10,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:49:10,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:49:10,607 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:49:12,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:12,764 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:49:12,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:49:12,765 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:49:12,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:12,766 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:49:12,766 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:49:12,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:49:12,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:49:12,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:49:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:49:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:49:12,768 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:49:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:12,769 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:49:12,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:49:12,769 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:49:12,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:49:12,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:12,769 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:49:12,769 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:12,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:12,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1914254535, now seen corresponding path program 52 times [2019-08-05 10:49:12,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:12,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:49:12,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:14,062 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-05 10:49:14,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:14,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:49:14,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:49:14,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:49:14,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:49:14,064 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:49:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:16,804 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:49:16,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:49:16,804 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:49:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:16,805 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:49:16,805 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:49:16,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:49:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:49:16,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:49:16,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:49:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:49:16,809 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:49:16,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:16,809 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:49:16,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:49:16,809 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:49:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:49:16,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:16,810 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:49:16,810 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:16,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:16,811 INFO L82 PathProgramCache]: Analyzing trace with hash -787639299, now seen corresponding path program 53 times [2019-08-05 10:49:16,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:16,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:49:16,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:18,021 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-05 10:49:18,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:18,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:49:18,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:49:18,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:49:18,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:49:18,022 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:49:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:19,985 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:49:19,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:49:19,985 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:49:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:19,986 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:49:19,986 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:49:19,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:49:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:49:19,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:49:19,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:49:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:49:19,989 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:49:19,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:19,990 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:49:19,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:49:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:49:19,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:49:19,990 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:19,990 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:49:19,991 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:19,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:19,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1352997767, now seen corresponding path program 54 times [2019-08-05 10:49:19,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:20,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:49:20,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:21,176 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-05 10:49:21,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:21,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:49:21,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:49:21,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:49:21,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:49:21,178 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:49:23,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:23,406 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:49:23,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:49:23,407 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:49:23,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:23,408 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:49:23,408 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:49:23,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:49:23,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:49:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:49:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:49:23,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:49:23,410 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:49:23,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:23,411 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:49:23,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:49:23,411 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:49:23,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:49:23,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:23,411 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:49:23,411 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:23,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:23,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1006729923, now seen corresponding path program 55 times [2019-08-05 10:49:23,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:23,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:49:23,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:25,090 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-05 10:49:25,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:25,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:49:25,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:49:25,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:49:25,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:49:25,091 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:49:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:27,402 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:49:27,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:49:27,402 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:49:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:27,403 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:49:27,403 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:49:27,404 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-05 10:49:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:49:27,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:49:27,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:49:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:49:27,406 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:49:27,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:27,407 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:49:27,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:49:27,407 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:49:27,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:49:27,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:27,407 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:49:27,408 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:27,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:27,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1143844281, now seen corresponding path program 56 times [2019-08-05 10:49:27,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:27,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:49:27,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:28,727 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-05 10:49:28,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:28,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:49:28,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:49:28,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:49:28,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:49:28,728 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:49:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:30,919 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:49:30,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:49:30,919 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:49:30,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:30,920 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:49:30,922 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:49:30,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:49:30,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:49:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:49:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:49:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:49:30,924 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:49:30,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:30,924 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:49:30,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:49:30,925 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:49:30,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:49:30,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:30,925 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:49:30,925 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:30,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:30,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1099422083, now seen corresponding path program 57 times [2019-08-05 10:49:30,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:30,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:49:30,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:32,399 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-05 10:49:32,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:32,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:49:32,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:49:32,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:49:32,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:49:32,400 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:49:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:34,637 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:49:34,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:49:34,638 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:49:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:34,639 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:49:34,639 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:49:34,639 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-05 10:49:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:49:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:49:34,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:49:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:49:34,642 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:49:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:34,642 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:49:34,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:49:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:49:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:49:34,643 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:34,643 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:49:34,643 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:34,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash 277666055, now seen corresponding path program 58 times [2019-08-05 10:49:34,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:34,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:49:34,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:36,020 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-05 10:49:36,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:36,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:49:36,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:49:36,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:49:36,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:49:36,021 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:49:38,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:38,532 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:49:38,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:49:38,533 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:49:38,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:38,533 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:49:38,534 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:49:38,534 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-05 10:49:38,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:49:38,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:49:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:49:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:49:38,536 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:49:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:38,537 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:49:38,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:49:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:49:38,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:49:38,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:38,538 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:49:38,538 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:38,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:38,538 INFO L82 PathProgramCache]: Analyzing trace with hash 17725373, now seen corresponding path program 59 times [2019-08-05 10:49:38,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:38,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:49:38,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:40,057 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-05 10:49:40,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:40,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:49:40,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:49:40,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:49:40,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:49:40,059 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:49:42,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:42,527 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:49:42,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:49:42,528 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:49:42,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:42,528 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:49:42,529 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:49:42,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:49:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:49:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:49:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:49:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:49:42,532 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:49:42,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:42,532 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:49:42,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:49:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:49:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:49:42,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:42,533 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:49:42,533 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:42,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:42,533 INFO L82 PathProgramCache]: Analyzing trace with hash 549498823, now seen corresponding path program 60 times [2019-08-05 10:49:42,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:42,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:49:42,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:44,004 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-05 10:49:44,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:44,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:49:44,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:49:44,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:49:44,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:49:44,006 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:49:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:46,491 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:49:46,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:49:46,492 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:49:46,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:46,493 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:49:46,493 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:49:46,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:49:46,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:49:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:49:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:49:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:49:46,495 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:49:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:46,496 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:49:46,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:49:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:49:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:49:46,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:46,497 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:49:46,497 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:46,497 INFO L82 PathProgramCache]: Analyzing trace with hash -145393411, now seen corresponding path program 61 times [2019-08-05 10:49:46,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:46,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:49:46,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:48,256 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-05 10:49:48,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:48,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:49:48,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:49:48,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:49:48,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:49:48,258 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:49:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:50,818 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:49:50,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:49:50,819 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:49:50,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:50,819 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:49:50,820 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:49:50,820 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-05 10:49:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:49:50,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:49:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:49:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:49:50,822 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:49:50,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:50,823 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:49:50,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:49:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:49:50,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:49:50,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:50,823 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:49:50,823 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:50,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:50,824 INFO L82 PathProgramCache]: Analyzing trace with hash -212216185, now seen corresponding path program 62 times [2019-08-05 10:49:50,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:50,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:49:50,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:52,917 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-05 10:49:52,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:52,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:49:52,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:49:52,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:49:52,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:49:52,919 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:49:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:55,554 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:49:55,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:49:55,554 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:49:55,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:55,555 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:49:55,555 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:49:55,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:49:55,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:49:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:49:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:49:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:49:55,559 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:49:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:55,559 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:49:55,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:49:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:49:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:49:55,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:55,560 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:49:55,560 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:55,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:55,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2011245117, now seen corresponding path program 63 times [2019-08-05 10:49:55,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:55,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:49:55,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:57,377 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-05 10:49:57,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:57,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:49:57,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:49:57,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:49:57,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:49:57,379 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:50:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:00,097 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:50:00,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:50:00,098 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:50:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:00,099 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:50:00,099 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:50:00,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:50:00,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:50:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:50:00,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:50:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:50:00,102 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:50:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:00,102 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:50:00,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:50:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:50:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:50:00,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:00,103 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:50:00,103 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:00,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:00,104 INFO L82 PathProgramCache]: Analyzing trace with hash -2075898553, now seen corresponding path program 64 times [2019-08-05 10:50:00,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:00,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:50:00,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:01,904 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-05 10:50:01,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:01,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:50:01,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:50:01,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:50:01,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:50:01,905 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:50:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:04,922 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:50:04,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:50:04,922 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:50:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:04,923 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:50:04,923 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:50:04,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:50:04,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:50:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:50:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:50:04,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:50:04,925 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:50:04,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:04,926 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:50:04,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:50:04,926 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:50:04,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:50:04,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:04,926 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:50:04,927 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:04,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:04,927 INFO L82 PathProgramCache]: Analyzing trace with hash 71666557, now seen corresponding path program 65 times [2019-08-05 10:50:04,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:04,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:50:04,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:06,659 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-05 10:50:06,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:06,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:50:06,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:50:06,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:50:06,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:50:06,660 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:50:09,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:09,781 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:50:09,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:50:09,781 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:50:09,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:09,782 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:50:09,782 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:50:09,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:50:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:50:09,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:50:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:50:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:50:09,785 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:50:09,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:09,785 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:50:09,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:50:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:50:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:50:09,786 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:09,786 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:50:09,786 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:09,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:09,787 INFO L82 PathProgramCache]: Analyzing trace with hash -2073291769, now seen corresponding path program 66 times [2019-08-05 10:50:09,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:09,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:50:09,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:11,519 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-05 10:50:11,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:11,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:50:11,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:50:11,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:50:11,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:50:11,520 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:50:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:14,674 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:50:14,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:50:14,675 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:50:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:14,675 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:50:14,676 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:50:14,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:50:14,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:50:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:50:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:50:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:50:14,678 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:50:14,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:14,678 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:50:14,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:50:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:50:14,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:50:14,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:14,679 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:50:14,679 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:14,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:14,679 INFO L82 PathProgramCache]: Analyzing trace with hash 152476861, now seen corresponding path program 67 times [2019-08-05 10:50:14,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:14,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:50:14,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:16,507 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-05 10:50:16,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:16,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:50:16,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:50:16,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:50:16,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:50:16,508 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:50:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:19,775 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:50:19,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:50:19,776 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:50:19,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:19,776 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:50:19,776 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:50:19,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:50:19,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:50:19,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:50:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:50:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:50:19,778 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:50:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:19,778 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:50:19,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:50:19,778 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:50:19,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:50:19,779 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:19,779 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:50:19,779 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:19,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:19,780 INFO L82 PathProgramCache]: Analyzing trace with hash 431827655, now seen corresponding path program 68 times [2019-08-05 10:50:19,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:19,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:50:19,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:21,818 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-05 10:50:21,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:21,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:50:21,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:50:21,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:50:21,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:50:21,820 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:50:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:25,060 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:50:25,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:50:25,060 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:50:25,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:25,061 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:50:25,061 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:50:25,062 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-05 10:50:25,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:50:25,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:50:25,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:50:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:50:25,063 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:50:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:25,063 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:50:25,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:50:25,064 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:50:25,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:50:25,064 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:25,064 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:50:25,064 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:25,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:25,065 INFO L82 PathProgramCache]: Analyzing trace with hash 501767677, now seen corresponding path program 69 times [2019-08-05 10:50:25,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:25,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:50:25,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:27,058 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-05 10:50:27,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:27,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:50:27,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:50:27,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:50:27,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:50:27,059 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:50:30,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:30,480 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:50:30,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:50:30,481 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:50:30,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:30,482 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:50:30,482 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:50:30,483 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-05 10:50:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:50:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:50:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:50:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:50:30,486 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:50:30,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:30,486 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:50:30,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:50:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:50:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:50:30,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:30,487 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:50:30,487 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:30,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:30,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1625058937, now seen corresponding path program 70 times [2019-08-05 10:50:30,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:30,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:50:30,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:32,475 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-05 10:50:32,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:32,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:50:32,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:50:32,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:50:32,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:50:32,477 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:50:36,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:36,062 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:50:36,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:50:36,062 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:50:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:36,063 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:50:36,064 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:50:36,064 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-05 10:50:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:50:36,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:50:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:50:36,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:50:36,067 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:50:36,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:36,067 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:50:36,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:50:36,067 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:50:36,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:50:36,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:36,068 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:50:36,068 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:36,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:36,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1162792765, now seen corresponding path program 71 times [2019-08-05 10:50:36,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:36,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:50:36,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:38,534 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-05 10:50:38,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:38,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:50:38,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:50:38,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:50:38,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:50:38,536 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:50:41,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:41,990 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:50:41,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:50:41,991 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:50:41,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:41,992 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:50:41,992 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:50:41,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:50:41,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:50:41,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:50:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:50:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:50:41,995 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:50:41,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:41,996 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:50:41,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:50:41,996 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:50:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:50:41,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:41,997 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:50:41,997 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:41,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:41,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1686849607, now seen corresponding path program 72 times [2019-08-05 10:50:41,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:42,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:50:42,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:44,370 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-05 10:50:44,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:44,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:50:44,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:50:44,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:50:44,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:50:44,371 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:50:47,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:47,903 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:50:47,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:50:47,904 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:50:47,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:47,905 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:50:47,905 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:50:47,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:50:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:50:47,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:50:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:50:47,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:50:47,908 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:50:47,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:47,909 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:50:47,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:50:47,909 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:50:47,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:50:47,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:47,909 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:50:47,910 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:47,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:47,910 INFO L82 PathProgramCache]: Analyzing trace with hash 752742525, now seen corresponding path program 73 times [2019-08-05 10:50:47,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:47,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:50:47,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:50,366 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-05 10:50:50,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:50,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:50:50,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:50:50,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:50:50,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:50:50,368 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:50:54,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:54,116 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:50:54,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:50:54,117 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:50:54,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:54,117 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:50:54,117 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:50:54,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:50:54,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:50:54,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:50:54,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:50:54,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:50:54,120 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:50:54,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:54,121 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:50:54,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:50:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:50:54,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:50:54,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:54,122 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:50:54,122 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:54,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:54,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1860194055, now seen corresponding path program 74 times [2019-08-05 10:50:54,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:54,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:50:54,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:56,598 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-05 10:50:56,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:56,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:50:56,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:50:56,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:50:56,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:50:56,599 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:51:00,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:00,503 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:51:00,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:51:00,504 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:51:00,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:00,505 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:51:00,505 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:51:00,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:51:00,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:51:00,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:51:00,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:51:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:51:00,508 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:51:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:00,508 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:51:00,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:51:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:51:00,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:51:00,509 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:00,509 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:51:00,509 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:00,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:00,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1831453117, now seen corresponding path program 75 times [2019-08-05 10:51:00,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:00,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:51:00,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:03,473 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-05 10:51:03,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:03,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:51:03,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:51:03,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:51:03,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:51:03,475 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:51:07,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:07,410 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:51:07,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:51:07,410 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:51:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:07,411 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:51:07,411 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:51:07,412 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-05 10:51:07,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:51:07,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:51:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:51:07,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:51:07,413 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:51:07,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:07,413 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:51:07,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:51:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:51:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:51:07,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:07,414 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:51:07,414 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:07,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:07,415 INFO L82 PathProgramCache]: Analyzing trace with hash 940484039, now seen corresponding path program 76 times [2019-08-05 10:51:07,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:07,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:51:07,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:09,999 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-05 10:51:10,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:10,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:51:10,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:51:10,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:51:10,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:51:10,001 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:51:13,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:13,945 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:51:13,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:51:13,945 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:51:13,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:13,946 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:51:13,946 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:51:13,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:51:13,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:51:13,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:51:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:51:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:51:13,948 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:51:13,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:13,948 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:51:13,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:51:13,948 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:51:13,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:51:13,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:13,949 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:51:13,949 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:13,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:13,949 INFO L82 PathProgramCache]: Analyzing trace with hash -909753603, now seen corresponding path program 77 times [2019-08-05 10:51:13,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:13,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:51:13,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:16,428 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-05 10:51:16,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:16,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:51:16,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:51:16,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:51:16,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:51:16,430 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:51:21,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:21,118 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:51:21,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:51:21,119 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:51:21,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:21,120 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:51:21,120 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:51:21,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:51:21,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:51:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:51:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:51:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:51:21,123 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:51:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:21,123 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:51:21,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:51:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:51:21,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:51:21,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:21,124 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:51:21,124 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:21,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:21,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1862421639, now seen corresponding path program 78 times [2019-08-05 10:51:21,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:21,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:51:21,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:23,480 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-05 10:51:23,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:23,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:51:23,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:51:23,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:51:23,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:51:23,482 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:51:27,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:27,696 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:51:27,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:51:27,697 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:51:27,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:27,698 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:51:27,698 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:51:27,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:51:27,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:51:27,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:51:27,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:51:27,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:51:27,701 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:51:27,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:27,702 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:51:27,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:51:27,702 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:51:27,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:51:27,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:27,702 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:51:27,703 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:27,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:27,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1900508221, now seen corresponding path program 79 times [2019-08-05 10:51:27,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:27,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:51:27,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:30,723 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-05 10:51:30,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:30,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:51:30,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:51:30,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:51:30,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:51:30,724 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:51:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:35,075 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:51:35,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:51:35,075 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:51:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:35,076 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:51:35,077 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:51:35,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:51:35,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:51:35,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:51:35,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:51:35,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:51:35,080 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:51:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:35,080 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:51:35,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:51:35,081 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:51:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:51:35,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:35,081 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:51:35,082 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:35,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:35,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1213775033, now seen corresponding path program 80 times [2019-08-05 10:51:35,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:35,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:51:35,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:37,632 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-05 10:51:37,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:37,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:51:37,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:51:37,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:51:37,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:51:37,633 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:51:42,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:42,154 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:51:42,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:51:42,155 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:51:42,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:42,156 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:51:42,156 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:51:42,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:51:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:51:42,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:51:42,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:51:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:51:42,159 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:51:42,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:42,159 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:51:42,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:51:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:51:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:51:42,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:42,160 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:51:42,160 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:42,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:42,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1027691901, now seen corresponding path program 81 times [2019-08-05 10:51:42,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:42,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:51:42,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:44,941 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-05 10:51:44,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:44,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:51:44,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:51:44,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:51:44,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:51:44,943 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:51:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:49,400 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:51:49,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:51:49,401 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:51:49,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:49,401 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:51:49,401 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:51:49,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:51:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:51:49,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:51:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:51:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:51:49,405 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:51:49,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:49,405 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:51:49,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:51:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:51:49,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:51:49,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:49,406 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:51:49,406 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:49,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1793690119, now seen corresponding path program 82 times [2019-08-05 10:51:49,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:49,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:51:49,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:52,719 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-05 10:51:52,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:52,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:51:52,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:51:52,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:51:52,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:51:52,720 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:51:57,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:57,470 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:51:57,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:51:57,470 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:51:57,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:57,471 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:51:57,471 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:51:57,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:51:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:51:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:51:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:51:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:51:57,474 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:51:57,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:57,474 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:51:57,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:51:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:51:57,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:51:57,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:57,475 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:51:57,476 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:57,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:57,476 INFO L82 PathProgramCache]: Analyzing trace with hash -230168899, now seen corresponding path program 83 times [2019-08-05 10:51:57,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:57,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:51:57,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:00,443 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-05 10:52:00,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:00,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:52:00,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:52:00,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:52:00,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:52:00,445 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 10:52:05,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:05,406 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:52:05,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:52:05,406 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:52:05,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:05,407 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:52:05,407 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:52:05,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:52:05,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:52:05,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:52:05,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:52:05,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:52:05,409 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:52:05,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:05,409 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:52:05,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:52:05,409 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:52:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:52:05,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:05,410 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 10:52:05,410 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:05,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:05,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1454710983, now seen corresponding path program 84 times [2019-08-05 10:52:05,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:05,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:52:05,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:08,193 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-05 10:52:08,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:08,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:52:08,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:52:08,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:52:08,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:52:08,194 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 10:52:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:13,118 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:52:13,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:52:13,119 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 10:52:13,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:13,119 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:52:13,120 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:52:13,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:52:13,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:52:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:52:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:52:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:52:13,122 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:52:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:13,123 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:52:13,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:52:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:52:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:52:13,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:13,124 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 10:52:13,124 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:13,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:13,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2146379773, now seen corresponding path program 85 times [2019-08-05 10:52:13,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:13,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:52:13,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:16,515 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-05 10:52:16,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:16,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:52:16,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:52:16,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:52:16,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:52:16,516 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 10:52:21,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:21,600 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:52:21,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:52:21,601 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:52:21,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:21,601 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:52:21,602 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:52:21,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:52:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:52:21,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:52:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:52:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:52:21,605 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:52:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:21,605 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:52:21,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:52:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:52:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:52:21,606 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:21,606 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 10:52:21,606 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:21,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:21,607 INFO L82 PathProgramCache]: Analyzing trace with hash 2113275783, now seen corresponding path program 86 times [2019-08-05 10:52:21,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:21,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:52:21,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:24,555 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-05 10:52:24,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:24,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:52:24,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:52:24,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:52:24,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:52:24,557 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. Received shutdown request... [2019-08-05 10:52:25,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:52:25,381 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:52:25,387 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:52:25,387 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:52:25 BoogieIcfgContainer [2019-08-05 10:52:25,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:52:25,388 INFO L168 Benchmark]: Toolchain (without parser) took 245728.78 ms. Allocated memory was 134.2 MB in the beginning and 245.4 MB in the end (delta: 111.1 MB). Free memory was 110.5 MB in the beginning and 122.7 MB in the end (delta: -12.2 MB). Peak memory consumption was 98.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:52:25,389 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.2 MB. Free memory was 111.8 MB in the beginning and 111.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:52:25,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.65 ms. Allocated memory is still 134.2 MB. Free memory was 110.3 MB in the beginning and 108.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:52:25,390 INFO L168 Benchmark]: Boogie Preprocessor took 21.33 ms. Allocated memory is still 134.2 MB. Free memory was 108.9 MB in the beginning and 107.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:52:25,391 INFO L168 Benchmark]: RCFGBuilder took 392.32 ms. Allocated memory is still 134.2 MB. Free memory was 107.6 MB in the beginning and 97.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:52:25,392 INFO L168 Benchmark]: TraceAbstraction took 245273.84 ms. Allocated memory was 134.2 MB in the beginning and 245.4 MB in the end (delta: 111.1 MB). Free memory was 97.1 MB in the beginning and 122.7 MB in the end (delta: -25.7 MB). Peak memory consumption was 85.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:52:25,394 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.23 ms. Allocated memory is still 134.2 MB. Free memory was 111.8 MB in the beginning and 111.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.65 ms. Allocated memory is still 134.2 MB. Free memory was 110.3 MB in the beginning and 108.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.33 ms. Allocated memory is still 134.2 MB. Free memory was 108.9 MB in the beginning and 107.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 392.32 ms. Allocated memory is still 134.2 MB. Free memory was 107.6 MB in the beginning and 97.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 245273.84 ms. Allocated memory was 134.2 MB in the beginning and 245.4 MB in the end (delta: 111.1 MB). Free memory was 97.1 MB in the beginning and 122.7 MB in the end (delta: -25.7 MB). Peak memory consumption was 85.5 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 15 states, 89 states before enhancement),while ReachableStatesComputation was computing reachable states (13 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 245.2s OverallTime, 87 OverallIterations, 86 TraceHistogramMax, 122.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 259 SDtfs, 0 SDslu, 2812 SDs, 0 SdLazy, 177939 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 100.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3915 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3828 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 117.3s 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, 120.2s 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