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/abstractInterpretation/unclassified/CountTillBound-Loop-2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:14:31,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:14:31,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:14:31,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:14:31,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:14:31,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:14:31,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:14:31,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:14:31,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:14:31,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:14:31,492 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:14:31,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:14:31,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:14:31,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:14:31,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:14:31,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:14:31,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:14:31,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:14:31,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:14:31,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:14:31,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:14:31,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:14:31,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:14:31,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:14:31,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:14:31,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:14:31,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:14:31,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:14:31,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:14:31,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:14:31,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:14:31,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:14:31,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:14:31,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:14:31,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:14:31,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:14:31,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:14:31,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:14:31,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:14:31,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:14:31,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:14:31,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:14:31,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:14:31,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:14:31,595 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:14:31,596 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:14:31,597 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/CountTillBound-Loop-2.bpl [2019-08-05 11:14:31,597 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/CountTillBound-Loop-2.bpl' [2019-08-05 11:14:31,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:14:31,649 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:14:31,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:31,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:14:31,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:14:31,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CountTillBound-Loop-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:31" (1/1) ... [2019-08-05 11:14:31,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CountTillBound-Loop-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:31" (1/1) ... [2019-08-05 11:14:31,682 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:14:31,683 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:14:31,683 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:14:31,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:31,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:14:31,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:14:31,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:14:31,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CountTillBound-Loop-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:31" (1/1) ... [2019-08-05 11:14:31,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CountTillBound-Loop-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:31" (1/1) ... [2019-08-05 11:14:31,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CountTillBound-Loop-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:31" (1/1) ... [2019-08-05 11:14:31,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CountTillBound-Loop-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:31" (1/1) ... [2019-08-05 11:14:31,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CountTillBound-Loop-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:31" (1/1) ... [2019-08-05 11:14:31,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CountTillBound-Loop-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:31" (1/1) ... [2019-08-05 11:14:31,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CountTillBound-Loop-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:31" (1/1) ... [2019-08-05 11:14:31,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:14:31,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:14:31,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:14:31,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:14:31,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CountTillBound-Loop-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:31" (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 11:14:31,784 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:14:31,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:14:31,785 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:14:32,083 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:14:32,084 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:14:32,085 INFO L202 PluginConnector]: Adding new model CountTillBound-Loop-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:32 BoogieIcfgContainer [2019-08-05 11:14:32,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:14:32,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:14:32,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:14:32,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:14:32,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CountTillBound-Loop-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:31" (1/2) ... [2019-08-05 11:14:32,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da2944c and model type CountTillBound-Loop-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:14:32, skipping insertion in model container [2019-08-05 11:14:32,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CountTillBound-Loop-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:32" (2/2) ... [2019-08-05 11:14:32,099 INFO L109 eAbstractionObserver]: Analyzing ICFG CountTillBound-Loop-2.bpl [2019-08-05 11:14:32,108 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:14:32,114 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:14:32,127 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:14:32,151 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:14:32,152 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:14:32,152 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:14:32,153 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:14:32,153 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:14:32,153 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:14:32,153 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:14:32,153 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:14:32,154 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:14:32,167 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:14:32,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:14:32,176 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:32,176 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:14:32,178 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:32,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:32,183 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2019-08-05 11:14:32,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:32,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:14:32,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:32,308 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 11:14:32,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:32,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:14:32,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:14:32,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:14:32,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:32,328 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 11:14:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:32,394 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 11:14:32,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:14:32,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:14:32,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:32,421 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:14:32,422 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:14:32,427 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 11:14:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:14:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:14:32,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:14:32,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 11:14:32,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 11:14:32,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:32,500 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 11:14:32,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:14:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 11:14:32,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:14:32,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:32,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:14:32,502 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:32,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:32,503 INFO L82 PathProgramCache]: Analyzing trace with hash 28758310, now seen corresponding path program 1 times [2019-08-05 11:14:32,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:32,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:14:32,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:32,586 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 11:14:32,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:32,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:14:32,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:14:32,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:14:32,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:32,590 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-08-05 11:14:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:32,640 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-08-05 11:14:32,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:14:32,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:14:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:32,641 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:14:32,641 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:14:32,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:32,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:14:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:14:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:14:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-08-05 11:14:32,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-08-05 11:14:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:32,646 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-08-05 11:14:32,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:14:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-08-05 11:14:32,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:14:32,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:32,648 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-05 11:14:32,648 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:32,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:32,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1866691308, now seen corresponding path program 2 times [2019-08-05 11:14:32,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:32,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:14:32,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:32,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:32,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:14:32,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:14:32,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:14:32,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:32,790 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2019-08-05 11:14:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:32,859 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-08-05 11:14:32,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:32,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 11:14:32,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:32,860 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:14:32,860 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:14:32,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 11:14:32,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:14:32,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:14:32,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:14:32,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-08-05 11:14:32,865 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2019-08-05 11:14:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:32,866 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-08-05 11:14:32,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:14:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-08-05 11:14:32,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:14:32,867 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:32,867 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2019-08-05 11:14:32,867 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:32,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:32,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1406223566, now seen corresponding path program 3 times [2019-08-05 11:14:32,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:32,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:14:32,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:32,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:32,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:32,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:32,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:32,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:32,948 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 6 states. [2019-08-05 11:14:32,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:32,980 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-08-05 11:14:32,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:14:32,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 11:14:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:32,982 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:14:32,983 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:14:32,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:32,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:14:32,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:14:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:14:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-08-05 11:14:32,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2019-08-05 11:14:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:32,987 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-08-05 11:14:32,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-08-05 11:14:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:14:32,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:32,999 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2019-08-05 11:14:32,999 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:32,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:33,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1533610488, now seen corresponding path program 4 times [2019-08-05 11:14:33,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:33,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:14:33,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:33,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:33,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:14:33,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:33,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:33,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:33,117 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 7 states. [2019-08-05 11:14:33,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:33,231 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-08-05 11:14:33,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:14:33,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 11:14:33,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:33,232 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:14:33,232 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:14:33,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:14:33,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:14:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:14:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-08-05 11:14:33,236 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2019-08-05 11:14:33,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:33,236 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-08-05 11:14:33,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:33,237 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2019-08-05 11:14:33,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:14:33,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:33,237 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1] [2019-08-05 11:14:33,238 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:33,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:33,238 INFO L82 PathProgramCache]: Analyzing trace with hash 625655614, now seen corresponding path program 5 times [2019-08-05 11:14:33,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:33,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:14:33,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:33,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:33,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:33,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:14:33,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:14:33,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:33,614 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 8 states. [2019-08-05 11:14:33,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:33,649 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2019-08-05 11:14:33,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:14:33,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-08-05 11:14:33,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:33,651 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:14:33,651 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:14:33,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:33,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:14:33,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:14:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:14:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-08-05 11:14:33,655 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2019-08-05 11:14:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:33,655 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-08-05 11:14:33,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:14:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2019-08-05 11:14:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:14:33,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:33,656 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1] [2019-08-05 11:14:33,657 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:33,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:33,657 INFO L82 PathProgramCache]: Analyzing trace with hash -40617212, now seen corresponding path program 6 times [2019-08-05 11:14:33,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:33,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:33,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:33,876 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 11:14:33,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:33,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:14:33,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:33,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:33,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:33,878 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 9 states. [2019-08-05 11:14:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:33,919 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2019-08-05 11:14:33,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:14:33,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 11:14:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:33,921 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:14:33,922 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:14:33,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:33,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:14:33,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:14:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:14:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-08-05 11:14:33,926 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 15 [2019-08-05 11:14:33,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:33,927 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-08-05 11:14:33,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2019-08-05 11:14:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:14:33,928 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:33,928 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1] [2019-08-05 11:14:33,928 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:33,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:33,929 INFO L82 PathProgramCache]: Analyzing trace with hash -378675894, now seen corresponding path program 7 times [2019-08-05 11:14:33,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:33,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:14:33,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:34,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:34,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:14:34,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:14:34,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:14:34,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:34,067 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 10 states. [2019-08-05 11:14:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:34,129 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2019-08-05 11:14:34,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:14:34,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-08-05 11:14:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:34,130 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:14:34,130 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:14:34,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:34,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:14:34,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:14:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:14:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-08-05 11:14:34,135 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2019-08-05 11:14:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:34,135 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-08-05 11:14:34,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:14:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2019-08-05 11:14:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:14:34,136 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:34,136 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1] [2019-08-05 11:14:34,137 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:34,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:34,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1164445200, now seen corresponding path program 8 times [2019-08-05 11:14:34,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:34,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:14:34,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:34,539 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:34,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:34,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:14:34,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:14:34,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:14:34,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:34,541 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 11 states. [2019-08-05 11:14:34,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:34,592 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2019-08-05 11:14:34,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:14:34,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 11:14:34,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:34,593 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:14:34,594 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:14:34,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 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 11:14:34,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:14:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:14:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:14:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-08-05 11:14:34,599 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 19 [2019-08-05 11:14:34,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:34,599 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-08-05 11:14:34,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:14:34,599 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2019-08-05 11:14:34,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:14:34,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:34,600 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1] [2019-08-05 11:14:34,601 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:34,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:34,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1954867882, now seen corresponding path program 9 times [2019-08-05 11:14:34,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:34,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:14:34,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:34,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:34,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:14:34,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:14:34,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:14:34,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:34,764 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 12 states. [2019-08-05 11:14:34,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:34,807 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2019-08-05 11:14:34,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:14:34,808 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-08-05 11:14:34,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:34,809 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:14:34,809 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:14:34,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:34,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:14:34,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:14:34,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:14:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-08-05 11:14:34,813 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 21 [2019-08-05 11:14:34,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:34,813 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-08-05 11:14:34,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:14:34,814 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2019-08-05 11:14:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:14:34,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:34,815 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1] [2019-08-05 11:14:34,815 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:34,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:34,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1727567076, now seen corresponding path program 10 times [2019-08-05 11:14:34,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:34,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:14:34,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:35,001 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:35,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:35,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:14:35,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:14:35,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:14:35,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:14:35,003 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 13 states. [2019-08-05 11:14:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:35,269 INFO L93 Difference]: Finished difference Result 26 states and 37 transitions. [2019-08-05 11:14:35,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:14:35,270 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-08-05 11:14:35,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:35,271 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:14:35,271 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:14:35,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:14:35,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:14:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 11:14:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:14:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2019-08-05 11:14:35,279 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 23 [2019-08-05 11:14:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:35,280 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-08-05 11:14:35,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:14:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2019-08-05 11:14:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:14:35,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:35,281 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1] [2019-08-05 11:14:35,283 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:35,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:35,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1960142690, now seen corresponding path program 11 times [2019-08-05 11:14:35,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:35,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:14:35,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:35,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:35,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:14:35,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:14:35,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:14:35,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:14:35,625 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 14 states. [2019-08-05 11:14:35,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:35,889 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-08-05 11:14:35,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:14:35,890 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-08-05 11:14:35,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:35,891 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:14:35,891 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:14:35,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:14:35,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:14:35,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 11:14:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:14:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2019-08-05 11:14:35,897 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 25 [2019-08-05 11:14:35,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:35,898 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-08-05 11:14:35,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:14:35,900 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-08-05 11:14:35,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:14:35,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:35,901 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1] [2019-08-05 11:14:35,902 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:35,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:35,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1793758680, now seen corresponding path program 12 times [2019-08-05 11:14:35,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:35,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:14:35,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:36,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:36,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:14:36,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:14:36,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:14:36,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:14:36,092 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 15 states. [2019-08-05 11:14:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:36,158 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2019-08-05 11:14:36,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:14:36,159 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-08-05 11:14:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:36,160 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:14:36,160 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:14:36,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:14:36,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:14:36,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:14:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:14:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-08-05 11:14:36,164 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 27 [2019-08-05 11:14:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:36,164 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-08-05 11:14:36,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:14:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-08-05 11:14:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:14:36,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:36,165 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1] [2019-08-05 11:14:36,166 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:36,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:36,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1520446610, now seen corresponding path program 13 times [2019-08-05 11:14:36,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:36,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:14:36,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:36,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:36,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:14:36,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:14:36,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:14:36,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:14:36,515 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 16 states. [2019-08-05 11:14:36,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:36,554 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2019-08-05 11:14:36,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:14:36,555 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-08-05 11:14:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:36,556 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:14:36,556 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:14:36,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 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 11:14:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:14:36,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:14:36,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:14:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-08-05 11:14:36,561 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 29 [2019-08-05 11:14:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:36,561 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-08-05 11:14:36,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:14:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-08-05 11:14:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:14:36,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:36,562 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1] [2019-08-05 11:14:36,563 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:36,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:36,563 INFO L82 PathProgramCache]: Analyzing trace with hash -860552396, now seen corresponding path program 14 times [2019-08-05 11:14:36,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:36,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:14:36,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:36,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:36,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:14:36,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:14:36,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:14:36,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:14:36,836 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 17 states. [2019-08-05 11:14:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:36,876 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2019-08-05 11:14:36,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:14:36,877 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-08-05 11:14:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:36,878 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:14:36,878 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:14:36,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:14:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:14:36,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 11:14:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:14:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-08-05 11:14:36,884 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 31 [2019-08-05 11:14:36,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:36,884 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-08-05 11:14:36,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:14:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2019-08-05 11:14:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:14:36,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:36,885 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1] [2019-08-05 11:14:36,885 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:36,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:36,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1937594746, now seen corresponding path program 15 times [2019-08-05 11:14:36,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:36,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:14:36,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:37,115 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:37,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:37,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:14:37,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:14:37,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:14:37,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:14:37,117 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 18 states. [2019-08-05 11:14:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:37,187 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2019-08-05 11:14:37,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:14:37,187 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-08-05 11:14:37,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:37,188 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:14:37,189 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:14:37,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:14:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:14:37,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:14:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:14:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-08-05 11:14:37,193 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 33 [2019-08-05 11:14:37,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:37,193 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2019-08-05 11:14:37,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:14:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-08-05 11:14:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:14:37,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:37,194 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1] [2019-08-05 11:14:37,195 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:37,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:37,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1987496384, now seen corresponding path program 16 times [2019-08-05 11:14:37,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:37,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:14:37,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:37,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:37,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:14:37,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:14:37,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:14:37,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:14:37,397 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-08-05 11:14:37,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:37,426 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2019-08-05 11:14:37,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:14:37,426 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-08-05 11:14:37,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:37,427 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:14:37,427 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:14:37,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:14:37,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:14:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 11:14:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:14:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 11:14:37,432 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 35 [2019-08-05 11:14:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:37,433 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 11:14:37,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:14:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 11:14:37,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:14:37,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:37,434 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1] [2019-08-05 11:14:37,434 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:37,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:37,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1276180870, now seen corresponding path program 17 times [2019-08-05 11:14:37,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:37,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:14:37,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:38,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:38,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:14:38,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:14:38,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:14:38,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:14:38,087 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 11:14:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:38,181 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2019-08-05 11:14:38,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:14:38,181 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-08-05 11:14:38,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:38,182 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:14:38,182 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:14:38,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:14:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:14:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 11:14:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:14:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 11:14:38,186 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 37 [2019-08-05 11:14:38,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:38,186 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 11:14:38,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:14:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 11:14:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:14:38,187 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:38,187 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1] [2019-08-05 11:14:38,187 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:38,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:38,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1951071412, now seen corresponding path program 18 times [2019-08-05 11:14:38,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:38,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:14:38,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:38,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:38,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:14:38,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:14:38,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:14:38,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:14:38,736 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 11:14:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:38,792 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2019-08-05 11:14:38,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:14:38,792 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-08-05 11:14:38,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:38,793 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:14:38,794 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:14:38,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:14:38,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:14:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 11:14:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:14:38,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 11:14:38,798 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 39 [2019-08-05 11:14:38,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:38,798 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 11:14:38,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:14:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 11:14:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:14:38,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:38,799 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1] [2019-08-05 11:14:38,800 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:38,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:38,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1920840594, now seen corresponding path program 19 times [2019-08-05 11:14:38,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:38,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:14:38,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:39,158 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:39,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:39,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:14:39,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:14:39,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:14:39,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:14:39,160 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 11:14:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:39,205 INFO L93 Difference]: Finished difference Result 44 states and 64 transitions. [2019-08-05 11:14:39,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:14:39,205 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2019-08-05 11:14:39,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:39,206 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:14:39,206 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:14:39,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:14:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:14:39,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 11:14:39,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:14:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 11:14:39,211 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 41 [2019-08-05 11:14:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:39,211 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 11:14:39,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:14:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 11:14:39,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:14:39,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:39,212 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1] [2019-08-05 11:14:39,212 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:39,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:39,213 INFO L82 PathProgramCache]: Analyzing trace with hash -908367272, now seen corresponding path program 20 times [2019-08-05 11:14:39,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:39,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:14:39,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:39,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:39,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:14:39,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:14:39,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:14:39,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:14:39,540 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 11:14:39,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:39,604 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2019-08-05 11:14:39,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:14:39,605 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-08-05 11:14:39,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:39,605 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:14:39,605 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:14:39,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:14:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:14:39,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:14:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:14:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 11:14:39,609 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 43 [2019-08-05 11:14:39,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:39,609 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 11:14:39,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:14:39,610 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 11:14:39,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:14:39,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:39,611 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1] [2019-08-05 11:14:39,611 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:39,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:39,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1062828130, now seen corresponding path program 21 times [2019-08-05 11:14:39,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:39,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:14:39,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:39,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:39,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:14:39,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:14:39,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:14:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:14:39,916 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 11:14:39,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:39,957 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2019-08-05 11:14:39,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:14:39,959 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-08-05 11:14:39,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:39,960 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:14:39,960 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:14:39,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:14:39,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:14:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 11:14:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:14:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 11:14:39,963 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 45 [2019-08-05 11:14:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:39,964 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 11:14:39,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:14:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 11:14:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:14:39,965 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:39,965 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1] [2019-08-05 11:14:39,965 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:39,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:39,965 INFO L82 PathProgramCache]: Analyzing trace with hash 824142692, now seen corresponding path program 22 times [2019-08-05 11:14:39,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:39,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:14:39,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:40,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:40,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:14:40,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:14:40,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:14:40,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:14:40,289 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 11:14:40,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:40,329 INFO L93 Difference]: Finished difference Result 50 states and 73 transitions. [2019-08-05 11:14:40,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:14:40,330 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-08-05 11:14:40,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:40,331 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:14:40,331 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:14:40,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:14:40,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:14:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 11:14:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:14:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 11:14:40,335 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 47 [2019-08-05 11:14:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:40,336 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 11:14:40,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:14:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 11:14:40,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:14:40,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:40,337 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1] [2019-08-05 11:14:40,337 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:40,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:40,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1726903722, now seen corresponding path program 23 times [2019-08-05 11:14:40,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:40,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:40,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:40,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:40,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:14:40,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:14:40,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:14:40,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:14:40,802 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 11:14:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:40,846 INFO L93 Difference]: Finished difference Result 52 states and 76 transitions. [2019-08-05 11:14:40,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:14:40,847 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2019-08-05 11:14:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:40,848 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:14:40,848 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:14:40,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:14:40,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:14:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 11:14:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:14:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 11:14:40,852 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 49 [2019-08-05 11:14:40,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:40,853 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 11:14:40,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:14:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 11:14:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:14:40,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:40,854 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1] [2019-08-05 11:14:40,854 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:40,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:40,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1696859760, now seen corresponding path program 24 times [2019-08-05 11:14:40,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:40,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:14:40,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:41,882 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:41,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:41,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:14:41,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:41,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:41,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:41,884 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 11:14:41,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:41,947 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-08-05 11:14:41,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:41,948 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-08-05 11:14:41,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:41,949 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:14:41,949 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:14:41,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 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 11:14:41,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:14:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 11:14:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:14:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2019-08-05 11:14:41,952 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 51 [2019-08-05 11:14:41,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:41,952 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2019-08-05 11:14:41,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:41,952 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2019-08-05 11:14:41,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:14:41,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:41,953 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1] [2019-08-05 11:14:41,953 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:41,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:41,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1405583946, now seen corresponding path program 25 times [2019-08-05 11:14:41,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:41,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:41,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:42,763 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:42,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:42,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:42,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:14:42,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:14:42,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:14:42,765 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand 28 states. [2019-08-05 11:14:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:42,809 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2019-08-05 11:14:42,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:14:42,809 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-08-05 11:14:42,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:42,810 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:14:42,810 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:14:42,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:14:42,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:14:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 11:14:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:14:42,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2019-08-05 11:14:42,814 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 53 [2019-08-05 11:14:42,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:42,815 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2019-08-05 11:14:42,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:14:42,815 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2019-08-05 11:14:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:14:42,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:42,816 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1] [2019-08-05 11:14:42,816 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:42,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:42,816 INFO L82 PathProgramCache]: Analyzing trace with hash -2146681988, now seen corresponding path program 26 times [2019-08-05 11:14:42,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:42,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:14:42,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:43,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:43,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:14:43,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:14:43,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:14:43,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:14:43,944 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand 29 states. [2019-08-05 11:14:43,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:43,991 INFO L93 Difference]: Finished difference Result 58 states and 85 transitions. [2019-08-05 11:14:43,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:14:43,992 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-08-05 11:14:43,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:43,992 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:14:43,993 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:14:43,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:14:43,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:14:43,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 11:14:43,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:14:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2019-08-05 11:14:43,997 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 55 [2019-08-05 11:14:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:43,997 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2019-08-05 11:14:43,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:14:43,998 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2019-08-05 11:14:43,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:14:43,998 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:43,998 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1] [2019-08-05 11:14:43,999 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:43,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:43,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1377329214, now seen corresponding path program 27 times [2019-08-05 11:14:44,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:44,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:44,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:44,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:44,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:14:44,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:14:44,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:14:44,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:14:44,389 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand 30 states. [2019-08-05 11:14:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:44,438 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2019-08-05 11:14:44,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:14:44,439 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2019-08-05 11:14:44,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:44,440 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:14:44,440 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:14:44,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:14:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:14:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 11:14:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:14:44,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2019-08-05 11:14:44,444 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 57 [2019-08-05 11:14:44,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:44,445 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 88 transitions. [2019-08-05 11:14:44,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:14:44,445 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2019-08-05 11:14:44,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:14:44,445 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:44,446 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1] [2019-08-05 11:14:44,446 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:44,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:44,446 INFO L82 PathProgramCache]: Analyzing trace with hash -763688312, now seen corresponding path program 28 times [2019-08-05 11:14:44,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:44,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:14:44,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:44,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:44,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:14:44,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:14:44,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:14:44,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:14:44,869 INFO L87 Difference]: Start difference. First operand 60 states and 88 transitions. Second operand 31 states. [2019-08-05 11:14:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:44,920 INFO L93 Difference]: Finished difference Result 62 states and 91 transitions. [2019-08-05 11:14:44,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:14:44,920 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-08-05 11:14:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:44,921 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:14:44,921 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:14:44,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:14:44,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:14:44,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 11:14:44,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:14:44,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2019-08-05 11:14:44,926 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 59 [2019-08-05 11:14:44,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:44,926 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2019-08-05 11:14:44,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:14:44,926 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2019-08-05 11:14:44,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:14:44,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:44,927 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1] [2019-08-05 11:14:44,927 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:44,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:44,928 INFO L82 PathProgramCache]: Analyzing trace with hash 534698958, now seen corresponding path program 29 times [2019-08-05 11:14:44,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:44,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:14:44,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:45,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:45,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:14:45,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:14:45,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:14:45,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:14:45,393 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand 32 states. [2019-08-05 11:14:45,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:45,505 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. [2019-08-05 11:14:45,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:14:45,506 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2019-08-05 11:14:45,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:45,506 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:14:45,507 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:14:45,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:14:45,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:14:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 11:14:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:14:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2019-08-05 11:14:45,510 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 61 [2019-08-05 11:14:45,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:45,510 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2019-08-05 11:14:45,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:14:45,511 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2019-08-05 11:14:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:14:45,511 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:45,511 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1] [2019-08-05 11:14:45,512 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:45,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:45,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1550617708, now seen corresponding path program 30 times [2019-08-05 11:14:45,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:45,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:14:45,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:45,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:45,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:14:45,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:14:45,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:14:45,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:14:45,948 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand 33 states. [2019-08-05 11:14:46,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:46,121 INFO L93 Difference]: Finished difference Result 66 states and 97 transitions. [2019-08-05 11:14:46,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:14:46,122 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-08-05 11:14:46,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:46,122 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:14:46,123 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:14:46,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:14:46,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:14:46,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 11:14:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:14:46,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2019-08-05 11:14:46,126 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 63 [2019-08-05 11:14:46,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:46,127 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2019-08-05 11:14:46,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:14:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2019-08-05 11:14:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:14:46,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:46,128 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1] [2019-08-05 11:14:46,128 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:46,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:46,128 INFO L82 PathProgramCache]: Analyzing trace with hash 209793498, now seen corresponding path program 31 times [2019-08-05 11:14:46,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:46,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:14:46,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:46,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:46,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:14:46,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:14:46,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:14:46,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:14:46,590 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand 34 states. [2019-08-05 11:14:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:46,645 INFO L93 Difference]: Finished difference Result 68 states and 100 transitions. [2019-08-05 11:14:46,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:14:46,646 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2019-08-05 11:14:46,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:46,647 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:14:46,647 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:14:46,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:14:46,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:14:46,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 11:14:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:14:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2019-08-05 11:14:46,651 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 65 [2019-08-05 11:14:46,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:46,651 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2019-08-05 11:14:46,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:14:46,651 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2019-08-05 11:14:46,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:14:46,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:46,652 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1] [2019-08-05 11:14:46,652 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:46,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:46,652 INFO L82 PathProgramCache]: Analyzing trace with hash -252152160, now seen corresponding path program 32 times [2019-08-05 11:14:46,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:46,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:14:46,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:47,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:47,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:47,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:14:47,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:14:47,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:14:47,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:14:47,277 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand 35 states. [2019-08-05 11:14:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:47,325 INFO L93 Difference]: Finished difference Result 70 states and 103 transitions. [2019-08-05 11:14:47,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:14:47,326 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-08-05 11:14:47,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:47,327 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:14:47,327 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:14:47,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:14:47,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:14:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 11:14:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:14:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 103 transitions. [2019-08-05 11:14:47,331 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 103 transitions. Word has length 67 [2019-08-05 11:14:47,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:47,331 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 103 transitions. [2019-08-05 11:14:47,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:14:47,331 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 103 transitions. [2019-08-05 11:14:47,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:14:47,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:47,332 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1] [2019-08-05 11:14:47,332 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:47,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:47,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1800298010, now seen corresponding path program 33 times [2019-08-05 11:14:47,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:47,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:14:47,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:48,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:48,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:14:48,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:14:48,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:14:48,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:14:48,814 INFO L87 Difference]: Start difference. First operand 70 states and 103 transitions. Second operand 36 states. [2019-08-05 11:14:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:48,865 INFO L93 Difference]: Finished difference Result 72 states and 106 transitions. [2019-08-05 11:14:48,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:14:48,866 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2019-08-05 11:14:48,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:48,867 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:14:48,867 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:14:48,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:14:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:14:48,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 11:14:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:14:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 106 transitions. [2019-08-05 11:14:48,870 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 106 transitions. Word has length 69 [2019-08-05 11:14:48,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:48,870 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 106 transitions. [2019-08-05 11:14:48,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:14:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 106 transitions. [2019-08-05 11:14:48,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:14:48,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:48,870 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1] [2019-08-05 11:14:48,871 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:48,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:48,871 INFO L82 PathProgramCache]: Analyzing trace with hash 785191852, now seen corresponding path program 34 times [2019-08-05 11:14:48,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:48,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:14:48,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:49,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:49,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:14:49,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:14:49,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:14:49,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:14:49,568 INFO L87 Difference]: Start difference. First operand 72 states and 106 transitions. Second operand 37 states. [2019-08-05 11:14:49,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:49,637 INFO L93 Difference]: Finished difference Result 74 states and 109 transitions. [2019-08-05 11:14:49,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:14:49,637 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-08-05 11:14:49,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:49,638 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:14:49,638 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:14:49,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:14:49,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:14:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 11:14:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:14:49,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2019-08-05 11:14:49,642 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 71 [2019-08-05 11:14:49,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:49,642 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2019-08-05 11:14:49,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:14:49,643 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2019-08-05 11:14:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:14:49,643 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:49,643 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1] [2019-08-05 11:14:49,644 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:49,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:49,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1345115150, now seen corresponding path program 35 times [2019-08-05 11:14:49,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:49,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:14:49,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:50,515 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 11:14:50,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:50,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:14:50,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:14:50,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:14:50,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:50,518 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand 38 states. [2019-08-05 11:14:50,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:50,605 INFO L93 Difference]: Finished difference Result 76 states and 112 transitions. [2019-08-05 11:14:50,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:14:50,605 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2019-08-05 11:14:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:50,606 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:14:50,606 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:14:50,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:50,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:14:50,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 11:14:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:14:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 112 transitions. [2019-08-05 11:14:50,612 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 112 transitions. Word has length 73 [2019-08-05 11:14:50,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:50,612 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 112 transitions. [2019-08-05 11:14:50,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:14:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 112 transitions. [2019-08-05 11:14:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:14:50,613 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:50,613 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1] [2019-08-05 11:14:50,613 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:50,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:50,613 INFO L82 PathProgramCache]: Analyzing trace with hash 129256120, now seen corresponding path program 36 times [2019-08-05 11:14:50,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:50,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:14:50,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:51,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:51,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:14:51,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:14:51,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:14:51,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:14:51,231 INFO L87 Difference]: Start difference. First operand 76 states and 112 transitions. Second operand 39 states. [2019-08-05 11:14:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:51,299 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. [2019-08-05 11:14:51,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:14:51,300 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-08-05 11:14:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:51,301 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:14:51,301 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:14:51,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:14:51,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:14:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 11:14:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:14:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 115 transitions. [2019-08-05 11:14:51,305 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 115 transitions. Word has length 75 [2019-08-05 11:14:51,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:51,305 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 115 transitions. [2019-08-05 11:14:51,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:14:51,305 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2019-08-05 11:14:51,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:14:51,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:51,306 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1] [2019-08-05 11:14:51,306 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:51,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:51,306 INFO L82 PathProgramCache]: Analyzing trace with hash -339161090, now seen corresponding path program 37 times [2019-08-05 11:14:51,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:51,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:14:51,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:52,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:52,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:14:52,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:14:52,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:14:52,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:14:52,030 INFO L87 Difference]: Start difference. First operand 78 states and 115 transitions. Second operand 40 states. [2019-08-05 11:14:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:52,093 INFO L93 Difference]: Finished difference Result 80 states and 118 transitions. [2019-08-05 11:14:52,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:14:52,093 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2019-08-05 11:14:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:52,094 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:14:52,095 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:14:52,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:14:52,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:14:52,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 11:14:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:14:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2019-08-05 11:14:52,098 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 77 [2019-08-05 11:14:52,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:52,098 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2019-08-05 11:14:52,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:14:52,099 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2019-08-05 11:14:52,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:14:52,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:52,099 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1] [2019-08-05 11:14:52,099 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:52,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:52,099 INFO L82 PathProgramCache]: Analyzing trace with hash 483466180, now seen corresponding path program 38 times [2019-08-05 11:14:52,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:52,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:14:52,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:52,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:52,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:14:52,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:14:52,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:14:52,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:14:52,719 INFO L87 Difference]: Start difference. First operand 80 states and 118 transitions. Second operand 41 states. [2019-08-05 11:14:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:52,778 INFO L93 Difference]: Finished difference Result 82 states and 121 transitions. [2019-08-05 11:14:52,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:14:52,779 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-08-05 11:14:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:52,780 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:14:52,780 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:14:52,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:14:52,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:14:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 11:14:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:14:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 121 transitions. [2019-08-05 11:14:52,784 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 121 transitions. Word has length 79 [2019-08-05 11:14:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:52,784 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 121 transitions. [2019-08-05 11:14:52,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:14:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 121 transitions. [2019-08-05 11:14:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:14:52,785 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:52,785 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1] [2019-08-05 11:14:52,785 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:52,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:52,786 INFO L82 PathProgramCache]: Analyzing trace with hash 754290186, now seen corresponding path program 39 times [2019-08-05 11:14:52,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:52,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:14:52,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:53,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:53,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:14:53,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:14:53,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:14:53,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:14:53,771 INFO L87 Difference]: Start difference. First operand 82 states and 121 transitions. Second operand 42 states. [2019-08-05 11:14:53,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:53,851 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2019-08-05 11:14:53,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:14:53,852 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 81 [2019-08-05 11:14:53,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:53,853 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:14:53,853 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:14:53,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:14:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:14:53,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 11:14:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:14:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2019-08-05 11:14:53,856 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 81 [2019-08-05 11:14:53,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:53,857 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2019-08-05 11:14:53,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:14:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2019-08-05 11:14:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:14:53,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:53,858 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1] [2019-08-05 11:14:53,858 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:53,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:53,858 INFO L82 PathProgramCache]: Analyzing trace with hash -976845104, now seen corresponding path program 40 times [2019-08-05 11:14:53,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:53,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:14:53,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:54,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:54,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:14:54,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:14:54,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:14:54,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:14:54,509 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand 43 states. [2019-08-05 11:14:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:54,579 INFO L93 Difference]: Finished difference Result 86 states and 127 transitions. [2019-08-05 11:14:54,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:14:54,579 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-08-05 11:14:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:54,580 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:14:54,581 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:14:54,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:14:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:14:54,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 11:14:54,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:14:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 127 transitions. [2019-08-05 11:14:54,584 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 127 transitions. Word has length 83 [2019-08-05 11:14:54,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:54,585 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 127 transitions. [2019-08-05 11:14:54,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:14:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 127 transitions. [2019-08-05 11:14:54,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:14:54,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:54,586 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1] [2019-08-05 11:14:54,586 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:54,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:54,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1849452054, now seen corresponding path program 41 times [2019-08-05 11:14:54,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:54,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:14:54,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:55,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:55,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:14:55,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:14:55,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:14:55,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:14:55,250 INFO L87 Difference]: Start difference. First operand 86 states and 127 transitions. Second operand 44 states. [2019-08-05 11:14:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:55,410 INFO L93 Difference]: Finished difference Result 88 states and 130 transitions. [2019-08-05 11:14:55,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:14:55,410 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2019-08-05 11:14:55,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:55,411 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:14:55,411 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:14:55,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:14:55,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:14:55,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 11:14:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:14:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2019-08-05 11:14:55,416 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 85 [2019-08-05 11:14:55,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:55,416 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2019-08-05 11:14:55,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:14:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2019-08-05 11:14:55,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:14:55,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:55,417 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1] [2019-08-05 11:14:55,417 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:55,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:55,418 INFO L82 PathProgramCache]: Analyzing trace with hash -793277476, now seen corresponding path program 42 times [2019-08-05 11:14:55,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:55,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:14:55,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:56,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:56,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:14:56,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:14:56,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:14:56,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:14:56,291 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand 45 states. [2019-08-05 11:14:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:56,365 INFO L93 Difference]: Finished difference Result 90 states and 133 transitions. [2019-08-05 11:14:56,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:14:56,366 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-08-05 11:14:56,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:56,367 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:14:56,367 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:14:56,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:14:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:14:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 11:14:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:14:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 133 transitions. [2019-08-05 11:14:56,371 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 133 transitions. Word has length 87 [2019-08-05 11:14:56,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:56,371 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 133 transitions. [2019-08-05 11:14:56,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:14:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 133 transitions. [2019-08-05 11:14:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:14:56,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:56,372 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1] [2019-08-05 11:14:56,373 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:56,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:56,373 INFO L82 PathProgramCache]: Analyzing trace with hash -2130683870, now seen corresponding path program 43 times [2019-08-05 11:14:56,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:56,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:14:56,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:57,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:57,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:14:57,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:14:57,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:14:57,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:14:57,146 INFO L87 Difference]: Start difference. First operand 90 states and 133 transitions. Second operand 46 states. [2019-08-05 11:14:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:57,209 INFO L93 Difference]: Finished difference Result 92 states and 136 transitions. [2019-08-05 11:14:57,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:14:57,209 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 89 [2019-08-05 11:14:57,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:57,210 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:14:57,211 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:14:57,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:14:57,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:14:57,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 11:14:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:14:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2019-08-05 11:14:57,214 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 89 [2019-08-05 11:14:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:57,214 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2019-08-05 11:14:57,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:14:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2019-08-05 11:14:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:14:57,214 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:57,215 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1] [2019-08-05 11:14:57,215 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:57,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:57,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1111960296, now seen corresponding path program 44 times [2019-08-05 11:14:57,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:57,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:14:57,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:57,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:57,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:14:57,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:14:57,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:14:57,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:14:57,993 INFO L87 Difference]: Start difference. First operand 92 states and 136 transitions. Second operand 47 states. [2019-08-05 11:14:58,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:58,219 INFO L93 Difference]: Finished difference Result 94 states and 139 transitions. [2019-08-05 11:14:58,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:14:58,220 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-08-05 11:14:58,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:58,221 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:14:58,221 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:14:58,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:14:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:14:58,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 11:14:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:14:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 139 transitions. [2019-08-05 11:14:58,224 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 139 transitions. Word has length 91 [2019-08-05 11:14:58,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:58,224 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 139 transitions. [2019-08-05 11:14:58,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:14:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 139 transitions. [2019-08-05 11:14:58,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:58,225 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:58,225 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1] [2019-08-05 11:14:58,226 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:58,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:58,226 INFO L82 PathProgramCache]: Analyzing trace with hash -853253074, now seen corresponding path program 45 times [2019-08-05 11:14:58,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:58,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:14:58,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:59,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:59,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:14:59,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:14:59,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:14:59,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:14:59,423 INFO L87 Difference]: Start difference. First operand 94 states and 139 transitions. Second operand 48 states. [2019-08-05 11:14:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:59,500 INFO L93 Difference]: Finished difference Result 96 states and 142 transitions. [2019-08-05 11:14:59,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:14:59,500 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2019-08-05 11:14:59,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:59,501 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:14:59,502 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:14:59,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:14:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:14:59,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 11:14:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:14:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 142 transitions. [2019-08-05 11:14:59,505 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 142 transitions. Word has length 93 [2019-08-05 11:14:59,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:59,505 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 142 transitions. [2019-08-05 11:14:59,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:14:59,505 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 142 transitions. [2019-08-05 11:14:59,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 11:14:59,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:59,506 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1] [2019-08-05 11:14:59,506 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:59,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:59,507 INFO L82 PathProgramCache]: Analyzing trace with hash 362308596, now seen corresponding path program 46 times [2019-08-05 11:14:59,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:59,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:14:59,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:00,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:00,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:00,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:15:00,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:15:00,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:15:00,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:15:00,593 INFO L87 Difference]: Start difference. First operand 96 states and 142 transitions. Second operand 49 states. [2019-08-05 11:15:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:00,883 INFO L93 Difference]: Finished difference Result 98 states and 145 transitions. [2019-08-05 11:15:00,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:15:00,883 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-08-05 11:15:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:00,884 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:15:00,884 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:15:00,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:15:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:15:00,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 11:15:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:15:00,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 145 transitions. [2019-08-05 11:15:00,888 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 145 transitions. Word has length 95 [2019-08-05 11:15:00,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:00,888 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 145 transitions. [2019-08-05 11:15:00,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:15:00,888 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 145 transitions. [2019-08-05 11:15:00,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:15:00,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:00,889 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1] [2019-08-05 11:15:00,889 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:00,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:00,889 INFO L82 PathProgramCache]: Analyzing trace with hash 285968954, now seen corresponding path program 47 times [2019-08-05 11:15:00,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:00,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:15:00,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:01,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:01,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:15:01,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:15:01,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:15:01,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:15:01,814 INFO L87 Difference]: Start difference. First operand 98 states and 145 transitions. Second operand 50 states. [2019-08-05 11:15:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:01,895 INFO L93 Difference]: Finished difference Result 100 states and 148 transitions. [2019-08-05 11:15:01,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:15:01,895 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2019-08-05 11:15:01,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:01,896 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:15:01,897 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:15:01,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:15:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:15:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 11:15:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:15:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 148 transitions. [2019-08-05 11:15:01,901 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 148 transitions. Word has length 97 [2019-08-05 11:15:01,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:01,901 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 148 transitions. [2019-08-05 11:15:01,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:15:01,902 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 148 transitions. [2019-08-05 11:15:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:15:01,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:01,902 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1] [2019-08-05 11:15:01,902 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:01,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:01,903 INFO L82 PathProgramCache]: Analyzing trace with hash -61982976, now seen corresponding path program 48 times [2019-08-05 11:15:01,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:01,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:15:01,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:02,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:02,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:15:02,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:15:02,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:15:02,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:15:02,856 INFO L87 Difference]: Start difference. First operand 100 states and 148 transitions. Second operand 51 states. [2019-08-05 11:15:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:02,952 INFO L93 Difference]: Finished difference Result 102 states and 151 transitions. [2019-08-05 11:15:02,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:15:02,952 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-08-05 11:15:02,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:02,953 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:15:02,954 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:15:02,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:15:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:15:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 11:15:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:15:02,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2019-08-05 11:15:02,959 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 99 [2019-08-05 11:15:02,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:02,959 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2019-08-05 11:15:02,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:15:02,960 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2019-08-05 11:15:02,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:15:02,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:02,960 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1] [2019-08-05 11:15:02,961 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:02,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:02,961 INFO L82 PathProgramCache]: Analyzing trace with hash 563661382, now seen corresponding path program 49 times [2019-08-05 11:15:02,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:02,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:15:02,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:04,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:04,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:15:04,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:15:04,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:15:04,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:15:04,128 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand 52 states. [2019-08-05 11:15:04,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:04,249 INFO L93 Difference]: Finished difference Result 104 states and 154 transitions. [2019-08-05 11:15:04,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:15:04,249 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 101 [2019-08-05 11:15:04,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:04,251 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:15:04,251 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:15:04,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:15:04,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:15:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 11:15:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:15:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-08-05 11:15:04,254 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 101 [2019-08-05 11:15:04,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:04,255 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-08-05 11:15:04,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:15:04,255 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-08-05 11:15:04,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:15:04,255 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:04,256 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1] [2019-08-05 11:15:04,256 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:04,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:04,256 INFO L82 PathProgramCache]: Analyzing trace with hash 512467980, now seen corresponding path program 50 times [2019-08-05 11:15:04,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:04,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:15:04,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:05,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:05,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:15:05,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:15:05,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:15:05,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:15:05,316 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 53 states. [2019-08-05 11:15:05,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:05,446 INFO L93 Difference]: Finished difference Result 106 states and 157 transitions. [2019-08-05 11:15:05,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:15:05,447 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-08-05 11:15:05,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:05,448 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:15:05,448 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:15:05,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:15:05,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:15:05,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 11:15:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:15:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 157 transitions. [2019-08-05 11:15:05,452 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 157 transitions. Word has length 103 [2019-08-05 11:15:05,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:05,453 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 157 transitions. [2019-08-05 11:15:05,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:15:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 157 transitions. [2019-08-05 11:15:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:15:05,453 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:05,454 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1] [2019-08-05 11:15:05,454 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:05,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:05,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1439751086, now seen corresponding path program 51 times [2019-08-05 11:15:05,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:05,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:15:05,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:06,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:06,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:06,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:15:06,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:15:06,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:15:06,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:15:06,911 INFO L87 Difference]: Start difference. First operand 106 states and 157 transitions. Second operand 54 states. [2019-08-05 11:15:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:06,999 INFO L93 Difference]: Finished difference Result 108 states and 160 transitions. [2019-08-05 11:15:07,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:15:07,000 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 105 [2019-08-05 11:15:07,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:07,001 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:15:07,001 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:15:07,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:15:07,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:15:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 11:15:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:15:07,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2019-08-05 11:15:07,005 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 105 [2019-08-05 11:15:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:07,006 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2019-08-05 11:15:07,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:15:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2019-08-05 11:15:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:15:07,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:07,007 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1] [2019-08-05 11:15:07,007 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:07,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:07,007 INFO L82 PathProgramCache]: Analyzing trace with hash -621565160, now seen corresponding path program 52 times [2019-08-05 11:15:07,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:07,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:15:07,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:08,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:08,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:15:08,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:15:08,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:15:08,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:15:08,122 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand 55 states. [2019-08-05 11:15:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:08,231 INFO L93 Difference]: Finished difference Result 110 states and 163 transitions. [2019-08-05 11:15:08,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:15:08,232 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2019-08-05 11:15:08,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:08,233 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:15:08,233 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:15:08,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:15:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:15:08,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 11:15:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 11:15:08,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 163 transitions. [2019-08-05 11:15:08,237 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 163 transitions. Word has length 107 [2019-08-05 11:15:08,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:08,238 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 163 transitions. [2019-08-05 11:15:08,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:15:08,238 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 163 transitions. [2019-08-05 11:15:08,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:15:08,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:08,239 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1] [2019-08-05 11:15:08,239 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:08,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:08,239 INFO L82 PathProgramCache]: Analyzing trace with hash -323905442, now seen corresponding path program 53 times [2019-08-05 11:15:08,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:08,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:15:08,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:09,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:09,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:15:09,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:15:09,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:15:09,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:15:09,855 INFO L87 Difference]: Start difference. First operand 110 states and 163 transitions. Second operand 56 states. [2019-08-05 11:15:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:09,968 INFO L93 Difference]: Finished difference Result 112 states and 166 transitions. [2019-08-05 11:15:09,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:15:09,969 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 109 [2019-08-05 11:15:09,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:09,969 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:15:09,970 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:15:09,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:15:09,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:15:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 11:15:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:15:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 166 transitions. [2019-08-05 11:15:09,973 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 166 transitions. Word has length 109 [2019-08-05 11:15:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:09,973 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 166 transitions. [2019-08-05 11:15:09,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:15:09,973 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 166 transitions. [2019-08-05 11:15:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:15:09,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:09,974 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1] [2019-08-05 11:15:09,974 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:09,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:09,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2035725276, now seen corresponding path program 54 times [2019-08-05 11:15:09,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:09,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:15:09,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:11,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:11,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:15:11,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:15:11,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:15:11,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:15:11,082 INFO L87 Difference]: Start difference. First operand 112 states and 166 transitions. Second operand 57 states. [2019-08-05 11:15:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:11,245 INFO L93 Difference]: Finished difference Result 114 states and 169 transitions. [2019-08-05 11:15:11,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:15:11,245 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 111 [2019-08-05 11:15:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:11,247 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:15:11,247 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:15:11,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:15:11,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:15:11,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 11:15:11,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:15:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2019-08-05 11:15:11,251 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 111 [2019-08-05 11:15:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:11,251 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2019-08-05 11:15:11,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:15:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2019-08-05 11:15:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 11:15:11,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:11,252 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1] [2019-08-05 11:15:11,252 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:11,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:11,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2122111382, now seen corresponding path program 55 times [2019-08-05 11:15:11,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:11,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:15:11,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:12,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:12,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:15:12,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:15:12,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:15:12,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:15:12,710 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand 58 states. [2019-08-05 11:15:13,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:13,063 INFO L93 Difference]: Finished difference Result 116 states and 172 transitions. [2019-08-05 11:15:13,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:15:13,064 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 113 [2019-08-05 11:15:13,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:13,065 INFO L225 Difference]: With dead ends: 116 [2019-08-05 11:15:13,065 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 11:15:13,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:15:13,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 11:15:13,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 11:15:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 11:15:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2019-08-05 11:15:13,068 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 113 [2019-08-05 11:15:13,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:13,068 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2019-08-05 11:15:13,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:15:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2019-08-05 11:15:13,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 11:15:13,069 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:13,069 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1] [2019-08-05 11:15:13,069 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:13,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:13,070 INFO L82 PathProgramCache]: Analyzing trace with hash 760186672, now seen corresponding path program 56 times [2019-08-05 11:15:13,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:13,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:15:13,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:14,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:14,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:15:14,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:15:14,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:15:14,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:15:14,598 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand 59 states. [2019-08-05 11:15:14,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:14,696 INFO L93 Difference]: Finished difference Result 118 states and 175 transitions. [2019-08-05 11:15:14,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:15:14,697 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 115 [2019-08-05 11:15:14,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:14,698 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:15:14,698 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:15:14,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:15:14,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:15:14,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 11:15:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 11:15:14,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 175 transitions. [2019-08-05 11:15:14,702 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 175 transitions. Word has length 115 [2019-08-05 11:15:14,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:14,702 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 175 transitions. [2019-08-05 11:15:14,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:15:14,702 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 175 transitions. [2019-08-05 11:15:14,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:15:14,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:14,702 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1] [2019-08-05 11:15:14,703 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:14,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:14,703 INFO L82 PathProgramCache]: Analyzing trace with hash 394710646, now seen corresponding path program 57 times [2019-08-05 11:15:14,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:14,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:15:14,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:16,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:16,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:15:16,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:15:16,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:15:16,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:15:16,152 INFO L87 Difference]: Start difference. First operand 118 states and 175 transitions. Second operand 60 states. [2019-08-05 11:15:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:16,276 INFO L93 Difference]: Finished difference Result 120 states and 178 transitions. [2019-08-05 11:15:16,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:15:16,277 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 117 [2019-08-05 11:15:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:16,278 INFO L225 Difference]: With dead ends: 120 [2019-08-05 11:15:16,278 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 11:15:16,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:15:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 11:15:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 11:15:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 11:15:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2019-08-05 11:15:16,281 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 117 [2019-08-05 11:15:16,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:16,281 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2019-08-05 11:15:16,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:15:16,282 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2019-08-05 11:15:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 11:15:16,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:16,282 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1] [2019-08-05 11:15:16,282 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:16,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:16,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1359567932, now seen corresponding path program 58 times [2019-08-05 11:15:16,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:16,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:15:16,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:18,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:18,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:15:18,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:15:18,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:15:18,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:15:18,056 INFO L87 Difference]: Start difference. First operand 120 states and 178 transitions. Second operand 61 states. [2019-08-05 11:15:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:18,165 INFO L93 Difference]: Finished difference Result 122 states and 181 transitions. [2019-08-05 11:15:18,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:15:18,166 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 119 [2019-08-05 11:15:18,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:18,167 INFO L225 Difference]: With dead ends: 122 [2019-08-05 11:15:18,167 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 11:15:18,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:15:18,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 11:15:18,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 11:15:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 11:15:18,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2019-08-05 11:15:18,171 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 181 transitions. Word has length 119 [2019-08-05 11:15:18,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:18,171 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 181 transitions. [2019-08-05 11:15:18,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:15:18,171 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 181 transitions. [2019-08-05 11:15:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 11:15:18,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:18,172 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1] [2019-08-05 11:15:18,172 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash 874483842, now seen corresponding path program 59 times [2019-08-05 11:15:18,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:18,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:15:18,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:19,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:19,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:15:19,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:15:19,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:15:19,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:15:19,718 INFO L87 Difference]: Start difference. First operand 122 states and 181 transitions. Second operand 62 states. [2019-08-05 11:15:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:19,820 INFO L93 Difference]: Finished difference Result 124 states and 184 transitions. [2019-08-05 11:15:19,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:15:19,820 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 121 [2019-08-05 11:15:19,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:19,821 INFO L225 Difference]: With dead ends: 124 [2019-08-05 11:15:19,821 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 11:15:19,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:15:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 11:15:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-08-05 11:15:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 11:15:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2019-08-05 11:15:19,825 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 121 [2019-08-05 11:15:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:19,825 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2019-08-05 11:15:19,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:15:19,826 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2019-08-05 11:15:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 11:15:19,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:19,826 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1] [2019-08-05 11:15:19,827 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:19,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:19,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1434858680, now seen corresponding path program 60 times [2019-08-05 11:15:19,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:19,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:15:19,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:21,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:21,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:15:21,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:15:21,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:15:21,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:15:21,230 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand 63 states. [2019-08-05 11:15:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:21,346 INFO L93 Difference]: Finished difference Result 126 states and 187 transitions. [2019-08-05 11:15:21,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:15:21,346 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 123 [2019-08-05 11:15:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:21,347 INFO L225 Difference]: With dead ends: 126 [2019-08-05 11:15:21,347 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 11:15:21,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:15:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 11:15:21,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-08-05 11:15:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 11:15:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 187 transitions. [2019-08-05 11:15:21,351 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 187 transitions. Word has length 123 [2019-08-05 11:15:21,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:21,351 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 187 transitions. [2019-08-05 11:15:21,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:15:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 187 transitions. [2019-08-05 11:15:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 11:15:21,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:21,352 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1] [2019-08-05 11:15:21,352 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:21,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:21,352 INFO L82 PathProgramCache]: Analyzing trace with hash -214930290, now seen corresponding path program 61 times [2019-08-05 11:15:21,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:21,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:15:21,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:22,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:22,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:15:22,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:15:22,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:15:22,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:15:22,792 INFO L87 Difference]: Start difference. First operand 126 states and 187 transitions. Second operand 64 states. [2019-08-05 11:15:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:22,927 INFO L93 Difference]: Finished difference Result 128 states and 190 transitions. [2019-08-05 11:15:22,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:15:22,927 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 125 [2019-08-05 11:15:22,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:22,928 INFO L225 Difference]: With dead ends: 128 [2019-08-05 11:15:22,928 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 11:15:22,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:15:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 11:15:22,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-08-05 11:15:22,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 11:15:22,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2019-08-05 11:15:22,932 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 125 [2019-08-05 11:15:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:22,932 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2019-08-05 11:15:22,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:15:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2019-08-05 11:15:22,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 11:15:22,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:22,933 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1] [2019-08-05 11:15:22,933 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:22,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:22,933 INFO L82 PathProgramCache]: Analyzing trace with hash -389819308, now seen corresponding path program 62 times [2019-08-05 11:15:22,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:22,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:15:22,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:24,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:24,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:15:24,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:15:24,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:15:24,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:15:24,678 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand 65 states. [2019-08-05 11:15:24,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:24,814 INFO L93 Difference]: Finished difference Result 130 states and 193 transitions. [2019-08-05 11:15:24,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:15:24,814 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 127 [2019-08-05 11:15:24,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:24,815 INFO L225 Difference]: With dead ends: 130 [2019-08-05 11:15:24,816 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 11:15:24,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:15:24,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 11:15:24,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-08-05 11:15:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 11:15:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 193 transitions. [2019-08-05 11:15:24,819 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 193 transitions. Word has length 127 [2019-08-05 11:15:24,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:24,819 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 193 transitions. [2019-08-05 11:15:24,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:15:24,819 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 193 transitions. [2019-08-05 11:15:24,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 11:15:24,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:24,820 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1] [2019-08-05 11:15:24,820 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:24,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:24,820 INFO L82 PathProgramCache]: Analyzing trace with hash -954441062, now seen corresponding path program 63 times [2019-08-05 11:15:24,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:24,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:15:24,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:26,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:26,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:15:26,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:15:26,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:15:26,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:15:26,303 INFO L87 Difference]: Start difference. First operand 130 states and 193 transitions. Second operand 66 states. [2019-08-05 11:15:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:26,461 INFO L93 Difference]: Finished difference Result 132 states and 196 transitions. [2019-08-05 11:15:26,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:15:26,461 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 129 [2019-08-05 11:15:26,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:26,462 INFO L225 Difference]: With dead ends: 132 [2019-08-05 11:15:26,462 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 11:15:26,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:15:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 11:15:26,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-08-05 11:15:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 11:15:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 196 transitions. [2019-08-05 11:15:26,466 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 196 transitions. Word has length 129 [2019-08-05 11:15:26,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:26,466 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 196 transitions. [2019-08-05 11:15:26,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:15:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 196 transitions. [2019-08-05 11:15:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 11:15:26,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:26,467 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1] [2019-08-05 11:15:26,468 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:26,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:26,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1904899936, now seen corresponding path program 64 times [2019-08-05 11:15:26,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:26,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:15:26,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:27,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:27,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:15:27,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:15:27,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:15:27,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:15:27,977 INFO L87 Difference]: Start difference. First operand 132 states and 196 transitions. Second operand 67 states. [2019-08-05 11:15:28,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:28,123 INFO L93 Difference]: Finished difference Result 134 states and 199 transitions. [2019-08-05 11:15:28,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:15:28,124 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 131 [2019-08-05 11:15:28,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:28,125 INFO L225 Difference]: With dead ends: 134 [2019-08-05 11:15:28,125 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 11:15:28,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:15:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 11:15:28,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-08-05 11:15:28,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 11:15:28,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 199 transitions. [2019-08-05 11:15:28,129 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 199 transitions. Word has length 131 [2019-08-05 11:15:28,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:28,130 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 199 transitions. [2019-08-05 11:15:28,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:15:28,130 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 199 transitions. [2019-08-05 11:15:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 11:15:28,130 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:28,131 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1] [2019-08-05 11:15:28,131 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:28,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:28,131 INFO L82 PathProgramCache]: Analyzing trace with hash 952529574, now seen corresponding path program 65 times [2019-08-05 11:15:28,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:28,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:15:28,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:30,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:30,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:15:30,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:15:30,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:15:30,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:15:30,113 INFO L87 Difference]: Start difference. First operand 134 states and 199 transitions. Second operand 68 states. [2019-08-05 11:15:30,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:30,263 INFO L93 Difference]: Finished difference Result 136 states and 202 transitions. [2019-08-05 11:15:30,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:15:30,263 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 133 [2019-08-05 11:15:30,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:30,264 INFO L225 Difference]: With dead ends: 136 [2019-08-05 11:15:30,264 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 11:15:30,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:15:30,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 11:15:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-08-05 11:15:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 11:15:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 202 transitions. [2019-08-05 11:15:30,268 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 202 transitions. Word has length 133 [2019-08-05 11:15:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:30,268 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 202 transitions. [2019-08-05 11:15:30,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:15:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 202 transitions. [2019-08-05 11:15:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 11:15:30,268 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:30,269 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1] [2019-08-05 11:15:30,269 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:30,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:30,269 INFO L82 PathProgramCache]: Analyzing trace with hash 552645740, now seen corresponding path program 66 times [2019-08-05 11:15:30,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:30,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:15:30,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:34,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:34,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:15:34,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:15:34,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:15:34,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:15:34,464 INFO L87 Difference]: Start difference. First operand 136 states and 202 transitions. Second operand 69 states. [2019-08-05 11:15:34,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:34,693 INFO L93 Difference]: Finished difference Result 138 states and 205 transitions. [2019-08-05 11:15:34,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:15:34,694 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 135 [2019-08-05 11:15:34,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:34,695 INFO L225 Difference]: With dead ends: 138 [2019-08-05 11:15:34,695 INFO L226 Difference]: Without dead ends: 138 [2019-08-05 11:15:34,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:15:34,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-08-05 11:15:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-08-05 11:15:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 11:15:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 205 transitions. [2019-08-05 11:15:34,698 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 205 transitions. Word has length 135 [2019-08-05 11:15:34,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:34,698 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 205 transitions. [2019-08-05 11:15:34,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:15:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 205 transitions. [2019-08-05 11:15:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 11:15:34,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:34,700 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1] [2019-08-05 11:15:34,700 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:34,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:34,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1483629390, now seen corresponding path program 67 times [2019-08-05 11:15:34,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:34,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:15:34,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:36,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:36,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:15:36,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:15:36,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:15:36,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:15:36,381 INFO L87 Difference]: Start difference. First operand 138 states and 205 transitions. Second operand 70 states. [2019-08-05 11:15:36,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:36,536 INFO L93 Difference]: Finished difference Result 140 states and 208 transitions. [2019-08-05 11:15:36,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:15:36,536 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 137 [2019-08-05 11:15:36,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:36,538 INFO L225 Difference]: With dead ends: 140 [2019-08-05 11:15:36,538 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 11:15:36,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:15:36,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 11:15:36,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-08-05 11:15:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 11:15:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 208 transitions. [2019-08-05 11:15:36,541 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 208 transitions. Word has length 137 [2019-08-05 11:15:36,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:36,541 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 208 transitions. [2019-08-05 11:15:36,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:15:36,541 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 208 transitions. [2019-08-05 11:15:36,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 11:15:36,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:36,542 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1] [2019-08-05 11:15:36,542 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:36,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:36,542 INFO L82 PathProgramCache]: Analyzing trace with hash 161057656, now seen corresponding path program 68 times [2019-08-05 11:15:36,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:36,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:15:36,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:38,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:38,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:15:38,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:15:38,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:15:38,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:15:38,253 INFO L87 Difference]: Start difference. First operand 140 states and 208 transitions. Second operand 71 states. [2019-08-05 11:15:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:38,502 INFO L93 Difference]: Finished difference Result 142 states and 211 transitions. [2019-08-05 11:15:38,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:15:38,503 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 139 [2019-08-05 11:15:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:38,504 INFO L225 Difference]: With dead ends: 142 [2019-08-05 11:15:38,504 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 11:15:38,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:15:38,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 11:15:38,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-08-05 11:15:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 11:15:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 211 transitions. [2019-08-05 11:15:38,506 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 211 transitions. Word has length 139 [2019-08-05 11:15:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:38,507 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 211 transitions. [2019-08-05 11:15:38,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:15:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 211 transitions. [2019-08-05 11:15:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 11:15:38,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:38,507 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1] [2019-08-05 11:15:38,507 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:38,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:38,508 INFO L82 PathProgramCache]: Analyzing trace with hash 157343934, now seen corresponding path program 69 times [2019-08-05 11:15:38,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:38,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:15:38,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:40,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:40,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:15:40,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:15:40,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:15:40,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:15:40,571 INFO L87 Difference]: Start difference. First operand 142 states and 211 transitions. Second operand 72 states. [2019-08-05 11:15:40,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:40,748 INFO L93 Difference]: Finished difference Result 144 states and 214 transitions. [2019-08-05 11:15:40,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:15:40,749 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 141 [2019-08-05 11:15:40,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:40,750 INFO L225 Difference]: With dead ends: 144 [2019-08-05 11:15:40,750 INFO L226 Difference]: Without dead ends: 144 [2019-08-05 11:15:40,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:15:40,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-08-05 11:15:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-08-05 11:15:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 11:15:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 214 transitions. [2019-08-05 11:15:40,753 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 214 transitions. Word has length 141 [2019-08-05 11:15:40,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:40,753 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 214 transitions. [2019-08-05 11:15:40,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:15:40,754 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 214 transitions. [2019-08-05 11:15:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 11:15:40,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:40,755 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1] [2019-08-05 11:15:40,755 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:40,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:40,755 INFO L82 PathProgramCache]: Analyzing trace with hash 883424388, now seen corresponding path program 70 times [2019-08-05 11:15:40,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:40,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:15:40,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:42,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:42,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:15:42,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:15:42,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:15:42,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:15:42,645 INFO L87 Difference]: Start difference. First operand 144 states and 214 transitions. Second operand 73 states. [2019-08-05 11:15:42,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:42,820 INFO L93 Difference]: Finished difference Result 146 states and 217 transitions. [2019-08-05 11:15:42,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:15:42,820 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 143 [2019-08-05 11:15:42,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:42,821 INFO L225 Difference]: With dead ends: 146 [2019-08-05 11:15:42,822 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 11:15:42,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:15:42,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 11:15:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-08-05 11:15:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 11:15:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 217 transitions. [2019-08-05 11:15:42,826 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 217 transitions. Word has length 143 [2019-08-05 11:15:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:42,826 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 217 transitions. [2019-08-05 11:15:42,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:15:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 217 transitions. [2019-08-05 11:15:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 11:15:42,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:42,827 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1] [2019-08-05 11:15:42,827 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:42,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:42,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1432928566, now seen corresponding path program 71 times [2019-08-05 11:15:42,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:42,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:15:42,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:45,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:45,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:15:45,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:15:45,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:15:45,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:15:45,258 INFO L87 Difference]: Start difference. First operand 146 states and 217 transitions. Second operand 74 states. [2019-08-05 11:15:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:45,434 INFO L93 Difference]: Finished difference Result 148 states and 220 transitions. [2019-08-05 11:15:45,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:15:45,434 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 145 [2019-08-05 11:15:45,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:45,436 INFO L225 Difference]: With dead ends: 148 [2019-08-05 11:15:45,436 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 11:15:45,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:15:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 11:15:45,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-08-05 11:15:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 11:15:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 220 transitions. [2019-08-05 11:15:45,440 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 220 transitions. Word has length 145 [2019-08-05 11:15:45,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:45,440 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 220 transitions. [2019-08-05 11:15:45,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:15:45,440 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 220 transitions. [2019-08-05 11:15:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 11:15:45,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:45,441 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1] [2019-08-05 11:15:45,442 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:45,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:45,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1639909264, now seen corresponding path program 72 times [2019-08-05 11:15:45,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:45,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:15:45,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:47,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:47,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:15:47,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:15:47,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:15:47,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:15:47,454 INFO L87 Difference]: Start difference. First operand 148 states and 220 transitions. Second operand 75 states. [2019-08-05 11:15:47,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:47,661 INFO L93 Difference]: Finished difference Result 150 states and 223 transitions. [2019-08-05 11:15:47,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:15:47,661 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 147 [2019-08-05 11:15:47,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:47,663 INFO L225 Difference]: With dead ends: 150 [2019-08-05 11:15:47,663 INFO L226 Difference]: Without dead ends: 150 [2019-08-05 11:15:47,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:15:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-08-05 11:15:47,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-08-05 11:15:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 11:15:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 223 transitions. [2019-08-05 11:15:47,667 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 223 transitions. Word has length 147 [2019-08-05 11:15:47,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:47,667 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 223 transitions. [2019-08-05 11:15:47,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:15:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 223 transitions. [2019-08-05 11:15:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 11:15:47,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:47,668 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1] [2019-08-05 11:15:47,668 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:47,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:47,669 INFO L82 PathProgramCache]: Analyzing trace with hash -300435754, now seen corresponding path program 73 times [2019-08-05 11:15:47,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:47,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:15:47,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:49,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:49,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:15:49,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:15:49,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:15:49,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:15:49,917 INFO L87 Difference]: Start difference. First operand 150 states and 223 transitions. Second operand 76 states. [2019-08-05 11:15:50,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:50,135 INFO L93 Difference]: Finished difference Result 152 states and 226 transitions. [2019-08-05 11:15:50,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:15:50,135 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 149 [2019-08-05 11:15:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:50,137 INFO L225 Difference]: With dead ends: 152 [2019-08-05 11:15:50,137 INFO L226 Difference]: Without dead ends: 152 [2019-08-05 11:15:50,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:15:50,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-08-05 11:15:50,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-08-05 11:15:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 11:15:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 226 transitions. [2019-08-05 11:15:50,140 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 226 transitions. Word has length 149 [2019-08-05 11:15:50,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:50,140 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 226 transitions. [2019-08-05 11:15:50,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:15:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 226 transitions. [2019-08-05 11:15:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-08-05 11:15:50,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:50,141 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1] [2019-08-05 11:15:50,141 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:50,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:50,142 INFO L82 PathProgramCache]: Analyzing trace with hash -956191588, now seen corresponding path program 74 times [2019-08-05 11:15:50,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:50,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:15:50,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:52,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:52,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:15:52,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:15:52,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:15:52,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:15:52,329 INFO L87 Difference]: Start difference. First operand 152 states and 226 transitions. Second operand 77 states. [2019-08-05 11:15:52,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:52,545 INFO L93 Difference]: Finished difference Result 154 states and 229 transitions. [2019-08-05 11:15:52,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:15:52,545 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 151 [2019-08-05 11:15:52,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:52,547 INFO L225 Difference]: With dead ends: 154 [2019-08-05 11:15:52,547 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 11:15:52,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:15:52,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 11:15:52,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-08-05 11:15:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 11:15:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 229 transitions. [2019-08-05 11:15:52,550 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 229 transitions. Word has length 151 [2019-08-05 11:15:52,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:52,550 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 229 transitions. [2019-08-05 11:15:52,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:15:52,550 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 229 transitions. [2019-08-05 11:15:52,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 11:15:52,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:52,551 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1] [2019-08-05 11:15:52,551 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:52,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:52,552 INFO L82 PathProgramCache]: Analyzing trace with hash 222644450, now seen corresponding path program 75 times [2019-08-05 11:15:52,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:52,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:15:52,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:55,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:55,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:55,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:15:55,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:15:55,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:15:55,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:15:55,218 INFO L87 Difference]: Start difference. First operand 154 states and 229 transitions. Second operand 78 states. [2019-08-05 11:15:55,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:55,436 INFO L93 Difference]: Finished difference Result 156 states and 232 transitions. [2019-08-05 11:15:55,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:15:55,436 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 153 [2019-08-05 11:15:55,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:55,437 INFO L225 Difference]: With dead ends: 156 [2019-08-05 11:15:55,438 INFO L226 Difference]: Without dead ends: 156 [2019-08-05 11:15:55,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:15:55,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-08-05 11:15:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-08-05 11:15:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 11:15:55,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 232 transitions. [2019-08-05 11:15:55,441 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 232 transitions. Word has length 153 [2019-08-05 11:15:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:55,441 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 232 transitions. [2019-08-05 11:15:55,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:15:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 232 transitions. [2019-08-05 11:15:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 11:15:55,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:55,442 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1] [2019-08-05 11:15:55,442 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:55,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:55,442 INFO L82 PathProgramCache]: Analyzing trace with hash -787289176, now seen corresponding path program 76 times [2019-08-05 11:15:55,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:55,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:15:55,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:57,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:57,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:15:57,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:15:57,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:15:57,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:15:57,565 INFO L87 Difference]: Start difference. First operand 156 states and 232 transitions. Second operand 79 states. [2019-08-05 11:15:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:57,779 INFO L93 Difference]: Finished difference Result 158 states and 235 transitions. [2019-08-05 11:15:57,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:15:57,779 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 155 [2019-08-05 11:15:57,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:57,780 INFO L225 Difference]: With dead ends: 158 [2019-08-05 11:15:57,781 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 11:15:57,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:15:57,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 11:15:57,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-08-05 11:15:57,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 11:15:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 235 transitions. [2019-08-05 11:15:57,785 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 235 transitions. Word has length 155 [2019-08-05 11:15:57,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:57,785 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 235 transitions. [2019-08-05 11:15:57,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:15:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 235 transitions. [2019-08-05 11:15:57,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 11:15:57,786 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:57,786 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1] [2019-08-05 11:15:57,786 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:57,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:57,787 INFO L82 PathProgramCache]: Analyzing trace with hash -670894866, now seen corresponding path program 77 times [2019-08-05 11:15:57,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:57,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:15:57,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:00,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:00,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:16:00,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:16:00,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:16:00,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:16:00,329 INFO L87 Difference]: Start difference. First operand 158 states and 235 transitions. Second operand 80 states. [2019-08-05 11:16:00,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:00,553 INFO L93 Difference]: Finished difference Result 160 states and 238 transitions. [2019-08-05 11:16:00,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:16:00,554 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 157 [2019-08-05 11:16:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:00,555 INFO L225 Difference]: With dead ends: 160 [2019-08-05 11:16:00,555 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 11:16:00,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:16:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 11:16:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-08-05 11:16:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 11:16:00,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 238 transitions. [2019-08-05 11:16:00,558 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 238 transitions. Word has length 157 [2019-08-05 11:16:00,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:00,558 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 238 transitions. [2019-08-05 11:16:00,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:16:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 238 transitions. [2019-08-05 11:16:00,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 11:16:00,559 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:00,559 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1] [2019-08-05 11:16:00,559 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:00,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:00,560 INFO L82 PathProgramCache]: Analyzing trace with hash -485112652, now seen corresponding path program 78 times [2019-08-05 11:16:00,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:00,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:16:00,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:02,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:02,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:16:02,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:16:02,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:16:02,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:16:02,809 INFO L87 Difference]: Start difference. First operand 160 states and 238 transitions. Second operand 81 states. [2019-08-05 11:16:03,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:03,046 INFO L93 Difference]: Finished difference Result 162 states and 241 transitions. [2019-08-05 11:16:03,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:16:03,046 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 159 [2019-08-05 11:16:03,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:03,047 INFO L225 Difference]: With dead ends: 162 [2019-08-05 11:16:03,048 INFO L226 Difference]: Without dead ends: 162 [2019-08-05 11:16:03,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:16:03,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-08-05 11:16:03,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-08-05 11:16:03,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 11:16:03,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 241 transitions. [2019-08-05 11:16:03,051 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 241 transitions. Word has length 159 [2019-08-05 11:16:03,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:03,051 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 241 transitions. [2019-08-05 11:16:03,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:16:03,052 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 241 transitions. [2019-08-05 11:16:03,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-08-05 11:16:03,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:03,052 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1] [2019-08-05 11:16:03,053 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:03,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:03,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1957935866, now seen corresponding path program 79 times [2019-08-05 11:16:03,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:03,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:16:03,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:05,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:05,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:16:05,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:16:05,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:16:05,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:16:05,609 INFO L87 Difference]: Start difference. First operand 162 states and 241 transitions. Second operand 82 states. [2019-08-05 11:16:05,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:05,847 INFO L93 Difference]: Finished difference Result 164 states and 244 transitions. [2019-08-05 11:16:05,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:16:05,848 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 161 [2019-08-05 11:16:05,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:05,849 INFO L225 Difference]: With dead ends: 164 [2019-08-05 11:16:05,849 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 11:16:05,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:16:05,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 11:16:05,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-08-05 11:16:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 11:16:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 244 transitions. [2019-08-05 11:16:05,854 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 244 transitions. Word has length 161 [2019-08-05 11:16:05,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:05,854 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 244 transitions. [2019-08-05 11:16:05,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:16:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 244 transitions. [2019-08-05 11:16:05,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 11:16:05,855 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:05,856 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1] [2019-08-05 11:16:05,856 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:05,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:05,856 INFO L82 PathProgramCache]: Analyzing trace with hash 380450752, now seen corresponding path program 80 times [2019-08-05 11:16:05,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:05,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:16:05,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:08,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:08,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:16:08,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:16:08,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:16:08,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:16:08,264 INFO L87 Difference]: Start difference. First operand 164 states and 244 transitions. Second operand 83 states. [2019-08-05 11:16:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:08,520 INFO L93 Difference]: Finished difference Result 166 states and 247 transitions. [2019-08-05 11:16:08,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:16:08,520 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 163 [2019-08-05 11:16:08,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:08,521 INFO L225 Difference]: With dead ends: 166 [2019-08-05 11:16:08,521 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 11:16:08,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:16:08,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 11:16:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-08-05 11:16:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 11:16:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 247 transitions. [2019-08-05 11:16:08,525 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 247 transitions. Word has length 163 [2019-08-05 11:16:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:08,525 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 247 transitions. [2019-08-05 11:16:08,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:16:08,525 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 247 transitions. [2019-08-05 11:16:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 11:16:08,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:08,526 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1] [2019-08-05 11:16:08,526 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:08,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:08,526 INFO L82 PathProgramCache]: Analyzing trace with hash 540711686, now seen corresponding path program 81 times [2019-08-05 11:16:08,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:08,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:16:08,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:11,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:11,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 11:16:11,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:16:11,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:16:11,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:16:11,552 INFO L87 Difference]: Start difference. First operand 166 states and 247 transitions. Second operand 84 states. [2019-08-05 11:16:11,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:11,813 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2019-08-05 11:16:11,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:16:11,814 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 165 [2019-08-05 11:16:11,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:11,815 INFO L225 Difference]: With dead ends: 168 [2019-08-05 11:16:11,815 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 11:16:11,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:16:11,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 11:16:11,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-08-05 11:16:11,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 11:16:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-08-05 11:16:11,819 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 165 [2019-08-05 11:16:11,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:11,819 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-08-05 11:16:11,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:16:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-08-05 11:16:11,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 11:16:11,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:11,820 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1] [2019-08-05 11:16:11,820 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:11,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:11,820 INFO L82 PathProgramCache]: Analyzing trace with hash -67353396, now seen corresponding path program 82 times [2019-08-05 11:16:11,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:11,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:16:11,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:14,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:14,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:16:14,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 11:16:14,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 11:16:14,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:16:14,183 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 85 states. [2019-08-05 11:16:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:14,461 INFO L93 Difference]: Finished difference Result 170 states and 253 transitions. [2019-08-05 11:16:14,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 11:16:14,462 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 167 [2019-08-05 11:16:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:14,463 INFO L225 Difference]: With dead ends: 170 [2019-08-05 11:16:14,463 INFO L226 Difference]: Without dead ends: 170 [2019-08-05 11:16:14,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:16:14,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-05 11:16:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-08-05 11:16:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-08-05 11:16:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 253 transitions. [2019-08-05 11:16:14,466 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 253 transitions. Word has length 167 [2019-08-05 11:16:14,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:14,467 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 253 transitions. [2019-08-05 11:16:14,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 11:16:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 253 transitions. [2019-08-05 11:16:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-08-05 11:16:14,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:14,468 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1] [2019-08-05 11:16:14,468 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:14,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:14,469 INFO L82 PathProgramCache]: Analyzing trace with hash -302344942, now seen corresponding path program 83 times [2019-08-05 11:16:14,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:14,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:16:14,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:17,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:17,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 11:16:17,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:16:17,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:16:17,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:16:17,675 INFO L87 Difference]: Start difference. First operand 170 states and 253 transitions. Second operand 86 states. [2019-08-05 11:16:17,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:17,957 INFO L93 Difference]: Finished difference Result 172 states and 256 transitions. [2019-08-05 11:16:17,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:16:17,958 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 169 [2019-08-05 11:16:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:17,959 INFO L225 Difference]: With dead ends: 172 [2019-08-05 11:16:17,959 INFO L226 Difference]: Without dead ends: 172 [2019-08-05 11:16:17,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:16:17,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-08-05 11:16:17,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2019-08-05 11:16:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 11:16:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2019-08-05 11:16:17,963 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 169 [2019-08-05 11:16:17,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:17,963 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2019-08-05 11:16:17,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:16:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2019-08-05 11:16:17,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 11:16:17,964 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:17,964 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1] [2019-08-05 11:16:17,964 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:17,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:17,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1504046040, now seen corresponding path program 84 times [2019-08-05 11:16:17,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:17,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:16:17,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:20,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:20,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:16:20,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 11:16:20,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 11:16:20,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:16:20,747 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 87 states. [2019-08-05 11:16:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:21,046 INFO L93 Difference]: Finished difference Result 174 states and 259 transitions. [2019-08-05 11:16:21,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 11:16:21,046 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 171 [2019-08-05 11:16:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:21,048 INFO L225 Difference]: With dead ends: 174 [2019-08-05 11:16:21,048 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 11:16:21,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:16:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 11:16:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-08-05 11:16:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-08-05 11:16:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 259 transitions. [2019-08-05 11:16:21,051 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 259 transitions. Word has length 171 [2019-08-05 11:16:21,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:21,051 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 259 transitions. [2019-08-05 11:16:21,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 11:16:21,051 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 259 transitions. [2019-08-05 11:16:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 11:16:21,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:21,052 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1] [2019-08-05 11:16:21,053 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:21,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:21,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2015975138, now seen corresponding path program 85 times [2019-08-05 11:16:21,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:21,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:16:21,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:23,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:23,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:23,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 11:16:23,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:16:23,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:16:23,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:16:23,679 INFO L87 Difference]: Start difference. First operand 174 states and 259 transitions. Second operand 88 states. [2019-08-05 11:16:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:23,990 INFO L93 Difference]: Finished difference Result 176 states and 262 transitions. [2019-08-05 11:16:23,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:16:23,990 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 173 [2019-08-05 11:16:23,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:23,992 INFO L225 Difference]: With dead ends: 176 [2019-08-05 11:16:23,992 INFO L226 Difference]: Without dead ends: 176 [2019-08-05 11:16:23,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:16:23,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-05 11:16:23,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-08-05 11:16:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 11:16:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 262 transitions. [2019-08-05 11:16:23,996 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 262 transitions. Word has length 173 [2019-08-05 11:16:23,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:23,996 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 262 transitions. [2019-08-05 11:16:23,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:16:23,996 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 262 transitions. [2019-08-05 11:16:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 11:16:23,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:23,997 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1] [2019-08-05 11:16:23,997 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:23,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:23,998 INFO L82 PathProgramCache]: Analyzing trace with hash -322097948, now seen corresponding path program 86 times [2019-08-05 11:16:23,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:24,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:16:24,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:26,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:26,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:16:26,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 11:16:26,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 11:16:26,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:16:26,923 INFO L87 Difference]: Start difference. First operand 176 states and 262 transitions. Second operand 89 states. [2019-08-05 11:16:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:27,730 INFO L93 Difference]: Finished difference Result 178 states and 265 transitions. [2019-08-05 11:16:27,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 11:16:27,731 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 175 [2019-08-05 11:16:27,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:27,732 INFO L225 Difference]: With dead ends: 178 [2019-08-05 11:16:27,732 INFO L226 Difference]: Without dead ends: 178 [2019-08-05 11:16:27,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:16:27,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-05 11:16:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-08-05 11:16:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 11:16:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 265 transitions. [2019-08-05 11:16:27,737 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 265 transitions. Word has length 175 [2019-08-05 11:16:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:27,738 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 265 transitions. [2019-08-05 11:16:27,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 11:16:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 265 transitions. [2019-08-05 11:16:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 11:16:27,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:27,740 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1] [2019-08-05 11:16:27,740 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:27,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:27,741 INFO L82 PathProgramCache]: Analyzing trace with hash -298723542, now seen corresponding path program 87 times [2019-08-05 11:16:27,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:27,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:16:27,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:31,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:31,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 11:16:31,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:16:31,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:16:31,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:16:31,416 INFO L87 Difference]: Start difference. First operand 178 states and 265 transitions. Second operand 90 states. [2019-08-05 11:16:31,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:31,770 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2019-08-05 11:16:31,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:16:31,771 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 177 [2019-08-05 11:16:31,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:31,772 INFO L225 Difference]: With dead ends: 180 [2019-08-05 11:16:31,772 INFO L226 Difference]: Without dead ends: 180 [2019-08-05 11:16:31,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:16:31,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-08-05 11:16:31,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-08-05 11:16:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 11:16:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 268 transitions. [2019-08-05 11:16:31,775 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 268 transitions. Word has length 177 [2019-08-05 11:16:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:31,776 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 268 transitions. [2019-08-05 11:16:31,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:16:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2019-08-05 11:16:31,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 11:16:31,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:31,777 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1] [2019-08-05 11:16:31,777 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:31,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:31,777 INFO L82 PathProgramCache]: Analyzing trace with hash 689244144, now seen corresponding path program 88 times [2019-08-05 11:16:31,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:31,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:16:31,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:34,522 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:34,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:34,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:16:34,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 11:16:34,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 11:16:34,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:16:34,523 INFO L87 Difference]: Start difference. First operand 180 states and 268 transitions. Second operand 91 states. [2019-08-05 11:16:34,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:34,865 INFO L93 Difference]: Finished difference Result 182 states and 271 transitions. [2019-08-05 11:16:34,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:16:34,866 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 179 [2019-08-05 11:16:34,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:34,867 INFO L225 Difference]: With dead ends: 182 [2019-08-05 11:16:34,867 INFO L226 Difference]: Without dead ends: 182 [2019-08-05 11:16:34,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:16:34,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-05 11:16:34,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-08-05 11:16:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-08-05 11:16:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 271 transitions. [2019-08-05 11:16:34,871 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 271 transitions. Word has length 179 [2019-08-05 11:16:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:34,872 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 271 transitions. [2019-08-05 11:16:34,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 11:16:34,872 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 271 transitions. [2019-08-05 11:16:34,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 11:16:34,872 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:34,872 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1] [2019-08-05 11:16:34,873 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:34,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:34,873 INFO L82 PathProgramCache]: Analyzing trace with hash 938417974, now seen corresponding path program 89 times [2019-08-05 11:16:34,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:34,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:16:34,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:38,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:38,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 11:16:38,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:16:38,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:16:38,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:16:38,044 INFO L87 Difference]: Start difference. First operand 182 states and 271 transitions. Second operand 92 states. [2019-08-05 11:16:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:38,416 INFO L93 Difference]: Finished difference Result 184 states and 274 transitions. [2019-08-05 11:16:38,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:16:38,416 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 181 [2019-08-05 11:16:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:38,418 INFO L225 Difference]: With dead ends: 184 [2019-08-05 11:16:38,418 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 11:16:38,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:16:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 11:16:38,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-08-05 11:16:38,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 11:16:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 274 transitions. [2019-08-05 11:16:38,421 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 274 transitions. Word has length 181 [2019-08-05 11:16:38,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:38,421 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 274 transitions. [2019-08-05 11:16:38,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:16:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 274 transitions. [2019-08-05 11:16:38,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 11:16:38,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:38,422 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1] [2019-08-05 11:16:38,422 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:38,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:38,423 INFO L82 PathProgramCache]: Analyzing trace with hash -123699972, now seen corresponding path program 90 times [2019-08-05 11:16:38,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:38,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:16:38,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:41,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:41,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 11:16:41,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 11:16:41,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 11:16:41,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:16:41,626 INFO L87 Difference]: Start difference. First operand 184 states and 274 transitions. Second operand 93 states. [2019-08-05 11:16:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:42,031 INFO L93 Difference]: Finished difference Result 186 states and 277 transitions. [2019-08-05 11:16:42,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:16:42,031 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 183 [2019-08-05 11:16:42,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:42,033 INFO L225 Difference]: With dead ends: 186 [2019-08-05 11:16:42,033 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 11:16:42,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:16:42,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 11:16:42,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-08-05 11:16:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 11:16:42,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 277 transitions. [2019-08-05 11:16:42,037 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 277 transitions. Word has length 183 [2019-08-05 11:16:42,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:42,038 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 277 transitions. [2019-08-05 11:16:42,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 11:16:42,038 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 277 transitions. [2019-08-05 11:16:42,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-08-05 11:16:42,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:42,039 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1] [2019-08-05 11:16:42,039 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:42,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:42,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1383170370, now seen corresponding path program 91 times [2019-08-05 11:16:42,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:42,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:16:42,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:44,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:44,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 11:16:44,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 11:16:44,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 11:16:44,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:16:44,910 INFO L87 Difference]: Start difference. First operand 186 states and 277 transitions. Second operand 94 states. [2019-08-05 11:16:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:45,297 INFO L93 Difference]: Finished difference Result 188 states and 280 transitions. [2019-08-05 11:16:45,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:16:45,298 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 185 [2019-08-05 11:16:45,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:45,299 INFO L225 Difference]: With dead ends: 188 [2019-08-05 11:16:45,299 INFO L226 Difference]: Without dead ends: 188 [2019-08-05 11:16:45,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:16:45,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-08-05 11:16:45,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-08-05 11:16:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 11:16:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 280 transitions. [2019-08-05 11:16:45,302 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 280 transitions. Word has length 185 [2019-08-05 11:16:45,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:45,302 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 280 transitions. [2019-08-05 11:16:45,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 11:16:45,302 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 280 transitions. [2019-08-05 11:16:45,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 11:16:45,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:45,303 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1] [2019-08-05 11:16:45,304 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:45,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:45,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2081590280, now seen corresponding path program 92 times [2019-08-05 11:16:45,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:45,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:16:45,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:48,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:48,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 11:16:48,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 11:16:48,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 11:16:48,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:16:48,629 INFO L87 Difference]: Start difference. First operand 188 states and 280 transitions. Second operand 95 states. [2019-08-05 11:16:49,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:49,037 INFO L93 Difference]: Finished difference Result 190 states and 283 transitions. [2019-08-05 11:16:49,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 11:16:49,037 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 187 [2019-08-05 11:16:49,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:49,039 INFO L225 Difference]: With dead ends: 190 [2019-08-05 11:16:49,039 INFO L226 Difference]: Without dead ends: 190 [2019-08-05 11:16:49,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:16:49,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-08-05 11:16:49,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-08-05 11:16:49,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-08-05 11:16:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 283 transitions. [2019-08-05 11:16:49,042 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 283 transitions. Word has length 187 [2019-08-05 11:16:49,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:49,043 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 283 transitions. [2019-08-05 11:16:49,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 11:16:49,043 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 283 transitions. [2019-08-05 11:16:49,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-08-05 11:16:49,044 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:49,044 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1] [2019-08-05 11:16:49,044 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:49,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:49,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1046741682, now seen corresponding path program 93 times [2019-08-05 11:16:49,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:49,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:16:49,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:52,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:52,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:16:52,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:16:52,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:16:52,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:16:52,419 INFO L87 Difference]: Start difference. First operand 190 states and 283 transitions. Second operand 96 states. [2019-08-05 11:16:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:52,830 INFO L93 Difference]: Finished difference Result 192 states and 286 transitions. [2019-08-05 11:16:52,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:16:52,830 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 189 [2019-08-05 11:16:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:52,832 INFO L225 Difference]: With dead ends: 192 [2019-08-05 11:16:52,832 INFO L226 Difference]: Without dead ends: 192 [2019-08-05 11:16:52,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:16:52,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-08-05 11:16:52,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-08-05 11:16:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-08-05 11:16:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 286 transitions. [2019-08-05 11:16:52,835 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 286 transitions. Word has length 189 [2019-08-05 11:16:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:52,835 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 286 transitions. [2019-08-05 11:16:52,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:16:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 286 transitions. [2019-08-05 11:16:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-08-05 11:16:52,836 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:52,836 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1] [2019-08-05 11:16:52,836 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:52,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:52,837 INFO L82 PathProgramCache]: Analyzing trace with hash -896649964, now seen corresponding path program 94 times [2019-08-05 11:16:52,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:52,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:16:52,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:56,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:56,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 11:16:56,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 11:16:56,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 11:16:56,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:16:56,782 INFO L87 Difference]: Start difference. First operand 192 states and 286 transitions. Second operand 97 states. [2019-08-05 11:16:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:57,200 INFO L93 Difference]: Finished difference Result 194 states and 289 transitions. [2019-08-05 11:16:57,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:16:57,200 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 191 [2019-08-05 11:16:57,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:57,202 INFO L225 Difference]: With dead ends: 194 [2019-08-05 11:16:57,202 INFO L226 Difference]: Without dead ends: 194 [2019-08-05 11:16:57,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:16:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-05 11:16:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-08-05 11:16:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-08-05 11:16:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2019-08-05 11:16:57,205 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 191 [2019-08-05 11:16:57,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:57,205 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2019-08-05 11:16:57,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 11:16:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2019-08-05 11:16:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-08-05 11:16:57,206 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:57,206 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1] [2019-08-05 11:16:57,207 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:57,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:57,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1607570266, now seen corresponding path program 95 times [2019-08-05 11:16:57,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:57,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:16:57,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:00,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:00,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 11:17:00,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 11:17:00,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 11:17:00,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:17:00,270 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 98 states. [2019-08-05 11:17:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:00,811 INFO L93 Difference]: Finished difference Result 196 states and 292 transitions. [2019-08-05 11:17:00,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 11:17:00,811 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 193 [2019-08-05 11:17:00,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:00,813 INFO L225 Difference]: With dead ends: 196 [2019-08-05 11:17:00,813 INFO L226 Difference]: Without dead ends: 196 [2019-08-05 11:17:00,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:17:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-08-05 11:17:00,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-08-05 11:17:00,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 11:17:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 292 transitions. [2019-08-05 11:17:00,816 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 292 transitions. Word has length 193 [2019-08-05 11:17:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:00,816 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 292 transitions. [2019-08-05 11:17:00,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 11:17:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 292 transitions. [2019-08-05 11:17:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 11:17:00,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:00,817 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1] [2019-08-05 11:17:00,817 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:00,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:00,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1313441760, now seen corresponding path program 96 times [2019-08-05 11:17:00,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:00,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:17:00,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:04,215 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:04,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:04,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 11:17:04,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 11:17:04,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 11:17:04,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:17:04,217 INFO L87 Difference]: Start difference. First operand 196 states and 292 transitions. Second operand 99 states. [2019-08-05 11:17:04,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:04,686 INFO L93 Difference]: Finished difference Result 198 states and 295 transitions. [2019-08-05 11:17:04,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 11:17:04,687 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 195 [2019-08-05 11:17:04,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:04,688 INFO L225 Difference]: With dead ends: 198 [2019-08-05 11:17:04,688 INFO L226 Difference]: Without dead ends: 198 [2019-08-05 11:17:04,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:17:04,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-05 11:17:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2019-08-05 11:17:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-08-05 11:17:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 295 transitions. [2019-08-05 11:17:04,692 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 295 transitions. Word has length 195 [2019-08-05 11:17:04,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:04,693 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 295 transitions. [2019-08-05 11:17:04,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 11:17:04,693 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 295 transitions. [2019-08-05 11:17:04,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-08-05 11:17:04,694 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:04,694 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1] [2019-08-05 11:17:04,694 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:04,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:04,695 INFO L82 PathProgramCache]: Analyzing trace with hash 502612838, now seen corresponding path program 97 times [2019-08-05 11:17:04,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:04,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 11:17:04,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:08,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:08,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:08,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 11:17:08,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 11:17:08,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 11:17:08,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:17:08,213 INFO L87 Difference]: Start difference. First operand 198 states and 295 transitions. Second operand 100 states. [2019-08-05 11:17:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:08,690 INFO L93 Difference]: Finished difference Result 200 states and 298 transitions. [2019-08-05 11:17:08,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 11:17:08,690 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 197 [2019-08-05 11:17:08,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:08,692 INFO L225 Difference]: With dead ends: 200 [2019-08-05 11:17:08,692 INFO L226 Difference]: Without dead ends: 200 [2019-08-05 11:17:08,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:17:08,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-05 11:17:08,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-08-05 11:17:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 11:17:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 298 transitions. [2019-08-05 11:17:08,695 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 298 transitions. Word has length 197 [2019-08-05 11:17:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:08,695 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 298 transitions. [2019-08-05 11:17:08,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 11:17:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 298 transitions. [2019-08-05 11:17:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-08-05 11:17:08,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:08,696 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1] [2019-08-05 11:17:08,696 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:08,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:08,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1974359340, now seen corresponding path program 98 times [2019-08-05 11:17:08,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:08,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:17:08,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:12,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:12,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 11:17:12,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 11:17:12,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 11:17:12,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:17:12,187 INFO L87 Difference]: Start difference. First operand 200 states and 298 transitions. Second operand 101 states. [2019-08-05 11:17:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:12,699 INFO L93 Difference]: Finished difference Result 202 states and 301 transitions. [2019-08-05 11:17:12,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:17:12,699 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2019-08-05 11:17:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:12,701 INFO L225 Difference]: With dead ends: 202 [2019-08-05 11:17:12,701 INFO L226 Difference]: Without dead ends: 202 [2019-08-05 11:17:12,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:17:12,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-08-05 11:17:12,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2019-08-05 11:17:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 11:17:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 301 transitions. [2019-08-05 11:17:12,704 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 301 transitions. Word has length 199 [2019-08-05 11:17:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:12,705 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 301 transitions. [2019-08-05 11:17:12,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 11:17:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 301 transitions. [2019-08-05 11:17:12,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-08-05 11:17:12,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:12,706 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1] [2019-08-05 11:17:12,706 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:12,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:12,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1016459918, now seen corresponding path program 99 times [2019-08-05 11:17:12,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:12,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:17:12,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:16,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:16,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 11:17:16,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 11:17:16,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 11:17:16,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:17:16,078 INFO L87 Difference]: Start difference. First operand 202 states and 301 transitions. Second operand 102 states. [2019-08-05 11:17:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:16,625 INFO L93 Difference]: Finished difference Result 204 states and 304 transitions. [2019-08-05 11:17:16,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 11:17:16,626 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2019-08-05 11:17:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:16,627 INFO L225 Difference]: With dead ends: 204 [2019-08-05 11:17:16,627 INFO L226 Difference]: Without dead ends: 204 [2019-08-05 11:17:16,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:17:16,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-08-05 11:17:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2019-08-05 11:17:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-08-05 11:17:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 304 transitions. [2019-08-05 11:17:16,629 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 304 transitions. Word has length 201 [2019-08-05 11:17:16,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:16,630 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 304 transitions. [2019-08-05 11:17:16,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 11:17:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 304 transitions. [2019-08-05 11:17:16,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 11:17:16,631 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:16,631 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1] [2019-08-05 11:17:16,631 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:16,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:16,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1860645832, now seen corresponding path program 100 times [2019-08-05 11:17:16,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:16,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:17:16,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 9801 trivial. 0 not checked. [2019-08-05 11:17:16,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:17:16,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:17:16,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:17:16,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:17:16,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:17:16,805 INFO L87 Difference]: Start difference. First operand 204 states and 304 transitions. Second operand 5 states. [2019-08-05 11:17:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:16,819 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-08-05 11:17:16,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:17:16,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-08-05 11:17:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:16,819 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:17:16,819 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:17:16,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:17:16,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:17:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:17:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:17:16,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:17:16,820 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 203 [2019-08-05 11:17:16,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:16,820 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:17:16,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:17:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:17:16,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:17:16,825 INFO L202 PluginConnector]: Adding new model CountTillBound-Loop-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:17:16 BoogieIcfgContainer [2019-08-05 11:17:16,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:17:16,827 INFO L168 Benchmark]: Toolchain (without parser) took 165177.68 ms. Allocated memory was 135.3 MB in the beginning and 321.9 MB in the end (delta: 186.6 MB). Free memory was 111.7 MB in the beginning and 78.3 MB in the end (delta: 33.4 MB). Peak memory consumption was 220.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:17:16,828 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 113.0 MB in the beginning and 112.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 11:17:16,828 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.24 ms. Allocated memory is still 135.3 MB. Free memory was 111.7 MB in the beginning and 109.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:17:16,829 INFO L168 Benchmark]: Boogie Preprocessor took 23.25 ms. Allocated memory is still 135.3 MB. Free memory was 109.9 MB in the beginning and 108.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 11:17:16,829 INFO L168 Benchmark]: RCFGBuilder took 375.80 ms. Allocated memory is still 135.3 MB. Free memory was 108.6 MB in the beginning and 99.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:17:16,830 INFO L168 Benchmark]: TraceAbstraction took 164738.10 ms. Allocated memory was 135.3 MB in the beginning and 321.9 MB in the end (delta: 186.6 MB). Free memory was 99.1 MB in the beginning and 78.3 MB in the end (delta: 20.7 MB). Peak memory consumption was 207.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:17:16,833 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 113.0 MB in the beginning and 112.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.24 ms. Allocated memory is still 135.3 MB. Free memory was 111.7 MB in the beginning and 109.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.25 ms. Allocated memory is still 135.3 MB. Free memory was 109.9 MB in the beginning and 108.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 375.80 ms. Allocated memory is still 135.3 MB. Free memory was 108.6 MB in the beginning and 99.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 164738.10 ms. Allocated memory was 135.3 MB in the beginning and 321.9 MB in the end (delta: 186.6 MB). Free memory was 99.1 MB in the beginning and 78.3 MB in the end (delta: 20.7 MB). Peak memory consumption was 207.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 164.6s OverallTime, 101 OverallIterations, 100 TraceHistogramMax, 17.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 502 SDtfs, 12045 SDslu, 10100 SDs, 0 SdLazy, 6771 SolverSat, 327 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10302 GetRequests, 5249 SyntacticMatches, 0 SemanticMatches, 5053 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 142.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=100, 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.3s AutomataMinimizationTime, 101 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 144.8s InterpolantComputationTime, 10403 NumberOfCodeBlocks, 10403 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 10302 ConstructedInterpolants, 0 QuantifiedInterpolants, 4165442 SizeOfPredicates, 100 NumberOfNonLiveVariables, 21008 ConjunctsInSsa, 5156 ConjunctsInUnsatCore, 101 InterpolantComputations, 2 PerfectInterpolantSequences, 10000/338350 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...