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/CallIrregular.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:14:33,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:14:33,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:14:33,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:14:33,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:14:33,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:14:33,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:14:33,501 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:14:33,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:14:33,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:14:33,506 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:14:33,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:14:33,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:14:33,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:14:33,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:14:33,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:14:33,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:14:33,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:14:33,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:14:33,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:14:33,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:14:33,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:14:33,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:14:33,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:14:33,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:14:33,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:14:33,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:14:33,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:14:33,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:14:33,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:14:33,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:14:33,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:14:33,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:14:33,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:14:33,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:14:33,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:14:33,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:14:33,547 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:14:33,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:14:33,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:14:33,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:14:33,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:14:33,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:14:33,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:14:33,603 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:14:33,604 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:14:33,604 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/CallIrregular.bpl [2019-08-05 11:14:33,605 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/CallIrregular.bpl' [2019-08-05 11:14:33,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:14:33,650 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:14:33,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:33,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:14:33,651 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:14:33,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CallIrregular.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:33" (1/1) ... [2019-08-05 11:14:33,677 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CallIrregular.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:33" (1/1) ... [2019-08-05 11:14:33,685 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:14:33,686 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:14:33,686 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:14:33,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:33,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:14:33,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:14:33,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:14:33,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CallIrregular.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:33" (1/1) ... [2019-08-05 11:14:33,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CallIrregular.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:33" (1/1) ... [2019-08-05 11:14:33,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CallIrregular.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:33" (1/1) ... [2019-08-05 11:14:33,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CallIrregular.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:33" (1/1) ... [2019-08-05 11:14:33,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CallIrregular.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:33" (1/1) ... [2019-08-05 11:14:33,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CallIrregular.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:33" (1/1) ... [2019-08-05 11:14:33,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CallIrregular.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:33" (1/1) ... [2019-08-05 11:14:33,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:14:33,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:14:33,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:14:33,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:14:33,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CallIrregular.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:33" (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:33,778 INFO L124 BoogieDeclarations]: Specification and implementation of procedure A given in one single declaration [2019-08-05 11:14:33,779 INFO L130 BoogieDeclarations]: Found specification of procedure A [2019-08-05 11:14:33,779 INFO L138 BoogieDeclarations]: Found implementation of procedure A [2019-08-05 11:14:33,779 INFO L124 BoogieDeclarations]: Specification and implementation of procedure B given in one single declaration [2019-08-05 11:14:33,780 INFO L130 BoogieDeclarations]: Found specification of procedure B [2019-08-05 11:14:33,780 INFO L138 BoogieDeclarations]: Found implementation of procedure B [2019-08-05 11:14:33,780 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:14:33,780 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:14:33,781 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:14:34,116 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:14:34,116 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:14:34,117 INFO L202 PluginConnector]: Adding new model CallIrregular.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:34 BoogieIcfgContainer [2019-08-05 11:14:34,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:14:34,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:14:34,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:14:34,122 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:14:34,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CallIrregular.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:33" (1/2) ... [2019-08-05 11:14:34,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@299f9077 and model type CallIrregular.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:14:34, skipping insertion in model container [2019-08-05 11:14:34,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CallIrregular.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:34" (2/2) ... [2019-08-05 11:14:34,126 INFO L109 eAbstractionObserver]: Analyzing ICFG CallIrregular.bpl [2019-08-05 11:14:34,134 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:14:34,142 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:14:34,157 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:14:34,183 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:14:34,184 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:14:34,184 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:14:34,184 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:14:34,184 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:14:34,185 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:14:34,185 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:14:34,185 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:14:34,185 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:14:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-08-05 11:14:34,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:14:34,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:34,209 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:14:34,211 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:34,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:34,216 INFO L82 PathProgramCache]: Analyzing trace with hash 51782385, now seen corresponding path program 1 times [2019-08-05 11:14:34,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:34,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:14:34,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:34,367 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:34,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:34,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:14:34,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:14:34,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:14:34,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:34,402 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-08-05 11:14:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:34,502 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-08-05 11:14:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:14:34,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:14:34,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:34,516 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:14:34,517 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:14:34,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:34,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:14:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:14:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:14:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-08-05 11:14:34,586 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 5 [2019-08-05 11:14:34,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:34,587 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-08-05 11:14:34,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:14:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2019-08-05 11:14:34,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:14:34,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:34,592 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:14:34,593 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:34,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash 604618100, now seen corresponding path program 1 times [2019-08-05 11:14:34,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:34,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:14:34,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:14:34,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:34,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:34,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:14:34,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:14:34,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:34,725 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 5 states. [2019-08-05 11:14:35,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:35,014 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-08-05 11:14:35,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:35,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-08-05 11:14:35,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:35,017 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:14:35,017 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:14:35,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:35,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:14:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:14:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:14:35,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-08-05 11:14:35,025 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 13 [2019-08-05 11:14:35,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:35,025 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-08-05 11:14:35,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:14:35,025 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-08-05 11:14:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:14:35,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:35,027 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:14:35,027 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:35,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:35,028 INFO L82 PathProgramCache]: Analyzing trace with hash 707314295, now seen corresponding path program 2 times [2019-08-05 11:14:35,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:35,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:14:35,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 11:14:35,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:35,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:14:35,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:35,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:35,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:35,216 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 6 states. [2019-08-05 11:14:35,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:35,664 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-08-05 11:14:35,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:14:35,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-08-05 11:14:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:35,667 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:14:35,667 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:14:35,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:14:35,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-08-05 11:14:35,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:14:35,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-08-05 11:14:35,675 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 21 [2019-08-05 11:14:35,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:35,676 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-08-05 11:14:35,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:35,676 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-08-05 11:14:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:14:35,677 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:35,678 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:14:35,678 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:35,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:35,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2116046076, now seen corresponding path program 1 times [2019-08-05 11:14:35,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:35,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:14:35,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:14:35,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:35,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:35,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:35,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:35,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:35,858 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 7 states. [2019-08-05 11:14:36,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:36,010 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-08-05 11:14:36,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:14:36,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-08-05 11:14:36,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:36,015 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:14:36,017 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:14:36,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:36,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:14:36,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-08-05 11:14:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:14:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-08-05 11:14:36,032 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 25 [2019-08-05 11:14:36,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:36,033 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-08-05 11:14:36,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:36,033 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-08-05 11:14:36,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:14:36,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:36,035 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:14:36,035 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:36,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:36,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1994391292, now seen corresponding path program 2 times [2019-08-05 11:14:36,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:36,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:14:36,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-08-05 11:14:36,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:36,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:14:36,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:14:36,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:14:36,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:36,342 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 12 states. [2019-08-05 11:14:37,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:37,103 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-08-05 11:14:37,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:14:37,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-08-05 11:14:37,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:37,105 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:14:37,105 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:14:37,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:14:37,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:14:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2019-08-05 11:14:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:14:37,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-08-05 11:14:37,116 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 37 [2019-08-05 11:14:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:37,116 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-08-05 11:14:37,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:14:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-08-05 11:14:37,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:14:37,118 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:37,119 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:14:37,119 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:37,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:37,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1076466807, now seen corresponding path program 3 times [2019-08-05 11:14:37,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:37,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:14:37,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-08-05 11:14:37,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:37,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:14:37,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:37,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:37,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:37,311 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 9 states. [2019-08-05 11:14:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:37,469 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-08-05 11:14:37,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:14:37,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-08-05 11:14:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:37,472 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:14:37,473 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:14:37,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:37,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:14:37,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2019-08-05 11:14:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:14:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-08-05 11:14:37,483 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 41 [2019-08-05 11:14:37,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:37,483 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-08-05 11:14:37,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:37,484 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-08-05 11:14:37,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:14:37,485 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:37,485 INFO L399 BasicCegarLoop]: trace histogram [8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:37,486 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:37,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:37,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1972129745, now seen corresponding path program 4 times [2019-08-05 11:14:37,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:37,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:14:37,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:14:37,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:37,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:14:37,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:37,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:37,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:37,741 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 9 states. [2019-08-05 11:14:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:37,986 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-08-05 11:14:37,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:14:37,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-08-05 11:14:37,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:37,989 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:14:37,989 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:14:37,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:14:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 11:14:37,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:14:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-08-05 11:14:37,997 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 53 [2019-08-05 11:14:37,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:37,997 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-08-05 11:14:37,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-08-05 11:14:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:14:37,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:37,999 INFO L399 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:37,999 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:38,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:38,000 INFO L82 PathProgramCache]: Analyzing trace with hash 206035542, now seen corresponding path program 5 times [2019-08-05 11:14:38,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:38,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:14:38,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 64 proven. 15 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-08-05 11:14:38,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:38,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:14:38,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:38,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:38,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:38,188 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 9 states. [2019-08-05 11:14:38,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:38,752 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2019-08-05 11:14:38,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:14:38,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-08-05 11:14:38,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:38,755 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:14:38,755 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:14:38,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:14:38,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:14:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-08-05 11:14:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:14:38,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-08-05 11:14:38,764 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 57 [2019-08-05 11:14:38,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:38,765 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-08-05 11:14:38,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-08-05 11:14:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:14:38,766 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:38,767 INFO L399 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:14:38,767 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:38,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:38,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1008930853, now seen corresponding path program 6 times [2019-08-05 11:14:38,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:38,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:14:38,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-08-05 11:14:39,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:39,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:14:39,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:14:39,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:14:39,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:39,140 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 11 states. [2019-08-05 11:14:39,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:39,212 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2019-08-05 11:14:39,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:14:39,213 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2019-08-05 11:14:39,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:39,216 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:14:39,216 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:14:39,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:14:39,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2019-08-05 11:14:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:14:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-08-05 11:14:39,229 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 61 [2019-08-05 11:14:39,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:39,229 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-08-05 11:14:39,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:14:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-08-05 11:14:39,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:14:39,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:39,232 INFO L399 BasicCegarLoop]: trace histogram [13, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:39,232 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:39,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:39,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1206772632, now seen corresponding path program 7 times [2019-08-05 11:14:39,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:39,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:14:39,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 4 proven. 94 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-08-05 11:14:39,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:39,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:14:39,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:14:39,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:14:39,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:39,501 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 10 states. [2019-08-05 11:14:39,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:39,594 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2019-08-05 11:14:39,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:14:39,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2019-08-05 11:14:39,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:39,598 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:14:39,599 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:14:39,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:39,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:14:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 11:14:39,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:14:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-08-05 11:14:39,606 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 77 [2019-08-05 11:14:39,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:39,607 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-08-05 11:14:39,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:14:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-08-05 11:14:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:14:39,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:39,609 INFO L399 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:39,609 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:39,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:39,609 INFO L82 PathProgramCache]: Analyzing trace with hash -904773779, now seen corresponding path program 8 times [2019-08-05 11:14:39,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:39,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:14:39,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 143 proven. 43 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:14:39,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:39,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:14:39,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:14:39,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:14:39,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:39,800 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 12 states. [2019-08-05 11:14:40,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:40,399 INFO L93 Difference]: Finished difference Result 119 states and 173 transitions. [2019-08-05 11:14:40,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:14:40,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2019-08-05 11:14:40,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:40,402 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:14:40,403 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:14:40,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:14:40,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:14:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2019-08-05 11:14:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:14:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2019-08-05 11:14:40,417 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 81 [2019-08-05 11:14:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:40,417 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-08-05 11:14:40,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:14:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2019-08-05 11:14:40,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:14:40,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:40,420 INFO L399 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:14:40,421 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:40,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:40,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1570364786, now seen corresponding path program 9 times [2019-08-05 11:14:40,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:40,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:14:40,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-08-05 11:14:40,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:40,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:14:40,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:14:40,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:14:40,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:14:40,698 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 13 states. [2019-08-05 11:14:40,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:40,860 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2019-08-05 11:14:40,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:14:40,862 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 85 [2019-08-05 11:14:40,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:40,864 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:14:40,864 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:14:40,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:14:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:14:40,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 77. [2019-08-05 11:14:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:14:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-08-05 11:14:40,876 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 85 [2019-08-05 11:14:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:40,876 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-08-05 11:14:40,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:14:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-08-05 11:14:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:14:40,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:40,878 INFO L399 BasicCegarLoop]: trace histogram [19, 13, 13, 13, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:14:40,879 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:40,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:40,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1226865156, now seen corresponding path program 10 times [2019-08-05 11:14:40,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:40,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:14:40,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 5 proven. 172 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2019-08-05 11:14:41,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:41,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:14:41,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:14:41,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:14:41,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:41,079 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 11 states. [2019-08-05 11:14:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:41,220 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2019-08-05 11:14:41,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:14:41,220 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-08-05 11:14:41,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:41,222 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:14:41,223 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:14:41,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:14:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:14:41,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 11:14:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:14:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-08-05 11:14:41,230 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 105 [2019-08-05 11:14:41,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:41,231 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-08-05 11:14:41,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:14:41,231 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-08-05 11:14:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:14:41,233 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:41,233 INFO L399 BasicCegarLoop]: trace histogram [20, 14, 14, 14, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:14:41,233 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:41,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:41,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1388717623, now seen corresponding path program 11 times [2019-08-05 11:14:41,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:41,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:14:41,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 282 proven. 93 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-08-05 11:14:41,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:41,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:14:41,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:14:41,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:14:41,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:14:41,988 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 15 states. [2019-08-05 11:14:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:42,917 INFO L93 Difference]: Finished difference Result 177 states and 274 transitions. [2019-08-05 11:14:42,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:14:42,918 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 109 [2019-08-05 11:14:42,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:42,920 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:14:42,920 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:14:42,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:14:42,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:14:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2019-08-05 11:14:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:14:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-08-05 11:14:42,929 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 109 [2019-08-05 11:14:42,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:42,930 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-08-05 11:14:42,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:14:42,930 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-08-05 11:14:42,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 11:14:42,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:42,931 INFO L399 BasicCegarLoop]: trace histogram [21, 15, 15, 15, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:14:42,932 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:42,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:42,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1732172658, now seen corresponding path program 12 times [2019-08-05 11:14:42,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:42,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:14:42,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2019-08-05 11:14:43,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:43,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:14:43,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:14:43,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:14:43,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:14:43,305 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 15 states. [2019-08-05 11:14:43,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:43,394 INFO L93 Difference]: Finished difference Result 191 states and 224 transitions. [2019-08-05 11:14:43,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:14:43,399 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 113 [2019-08-05 11:14:43,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:43,401 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:14:43,402 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:14:43,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:14:43,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:14:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 103. [2019-08-05 11:14:43,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:14:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2019-08-05 11:14:43,413 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 113 [2019-08-05 11:14:43,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:43,414 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2019-08-05 11:14:43,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:14:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2019-08-05 11:14:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 11:14:43,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:43,415 INFO L399 BasicCegarLoop]: trace histogram [26, 19, 19, 19, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1] [2019-08-05 11:14:43,416 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:43,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:43,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1369606747, now seen corresponding path program 13 times [2019-08-05 11:14:43,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:43,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:14:43,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 6 proven. 284 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked. [2019-08-05 11:14:43,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:43,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:14:43,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:14:43,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:14:43,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:43,774 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 12 states. [2019-08-05 11:14:43,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:43,885 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2019-08-05 11:14:43,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:14:43,886 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2019-08-05 11:14:43,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:43,889 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:14:43,889 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:14:43,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:14:43,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:14:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 11:14:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:14:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2019-08-05 11:14:43,897 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 137 [2019-08-05 11:14:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:43,898 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2019-08-05 11:14:43,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:14:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2019-08-05 11:14:43,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 11:14:43,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:43,900 INFO L399 BasicCegarLoop]: trace histogram [27, 20, 20, 20, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1] [2019-08-05 11:14:43,900 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:43,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:43,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1125587350, now seen corresponding path program 14 times [2019-08-05 11:14:43,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:43,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:14:43,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 509 proven. 171 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-08-05 11:14:44,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:44,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:14:44,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:14:44,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:14:44,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:14:44,339 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 18 states. [2019-08-05 11:14:45,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:45,482 INFO L93 Difference]: Finished difference Result 255 states and 414 transitions. [2019-08-05 11:14:45,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:14:45,485 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 141 [2019-08-05 11:14:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:45,488 INFO L225 Difference]: With dead ends: 255 [2019-08-05 11:14:45,488 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:14:45,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=468, Invalid=1338, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:14:45,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:14:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 119. [2019-08-05 11:14:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:14:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2019-08-05 11:14:45,497 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 141 [2019-08-05 11:14:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:45,498 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2019-08-05 11:14:45,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:14:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2019-08-05 11:14:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 11:14:45,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:45,500 INFO L399 BasicCegarLoop]: trace histogram [28, 21, 21, 21, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1] [2019-08-05 11:14:45,500 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:45,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:45,500 INFO L82 PathProgramCache]: Analyzing trace with hash -284347857, now seen corresponding path program 15 times [2019-08-05 11:14:45,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:45,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:14:45,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 0 proven. 700 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-08-05 11:14:45,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:45,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:14:45,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:14:45,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:14:45,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:14:45,940 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand 17 states. [2019-08-05 11:14:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:46,370 INFO L93 Difference]: Finished difference Result 283 states and 331 transitions. [2019-08-05 11:14:46,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:14:46,371 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 145 [2019-08-05 11:14:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:46,373 INFO L225 Difference]: With dead ends: 283 [2019-08-05 11:14:46,373 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:14:46,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:14:46,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:14:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 133. [2019-08-05 11:14:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:14:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2019-08-05 11:14:46,385 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 145 [2019-08-05 11:14:46,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:46,385 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2019-08-05 11:14:46,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:14:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2019-08-05 11:14:46,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 11:14:46,387 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:46,387 INFO L399 BasicCegarLoop]: trace histogram [34, 26, 26, 26, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1] [2019-08-05 11:14:46,388 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:46,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:46,388 INFO L82 PathProgramCache]: Analyzing trace with hash 2046220555, now seen corresponding path program 16 times [2019-08-05 11:14:46,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:46,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:14:46,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:47,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 7 proven. 436 refuted. 0 times theorem prover too weak. 1729 trivial. 0 not checked. [2019-08-05 11:14:47,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:47,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:14:47,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:14:47,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:14:47,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:14:47,353 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand 13 states. [2019-08-05 11:14:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:47,469 INFO L93 Difference]: Finished difference Result 205 states and 231 transitions. [2019-08-05 11:14:47,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:14:47,473 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 173 [2019-08-05 11:14:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:47,474 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:14:47,475 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:14:47,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:14:47,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:14:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-08-05 11:14:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 11:14:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 154 transitions. [2019-08-05 11:14:47,481 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 154 transitions. Word has length 173 [2019-08-05 11:14:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:47,482 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 154 transitions. [2019-08-05 11:14:47,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:14:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2019-08-05 11:14:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 11:14:47,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:47,484 INFO L399 BasicCegarLoop]: trace histogram [35, 27, 27, 27, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1] [2019-08-05 11:14:47,484 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:47,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:47,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2015695088, now seen corresponding path program 17 times [2019-08-05 11:14:47,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:47,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:14:47,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 858 proven. 283 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2019-08-05 11:14:48,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:48,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:14:48,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:14:48,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:14:48,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:14:48,194 INFO L87 Difference]: Start difference. First operand 135 states and 154 transitions. Second operand 21 states. [2019-08-05 11:14:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:49,770 INFO L93 Difference]: Finished difference Result 357 states and 600 transitions. [2019-08-05 11:14:49,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:14:49,770 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 177 [2019-08-05 11:14:49,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:49,773 INFO L225 Difference]: With dead ends: 357 [2019-08-05 11:14:49,773 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:14:49,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=819, Invalid=2373, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:14:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:14:49,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-08-05 11:14:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 11:14:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 175 transitions. [2019-08-05 11:14:49,782 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 175 transitions. Word has length 177 [2019-08-05 11:14:49,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:49,783 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 175 transitions. [2019-08-05 11:14:49,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:14:49,783 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 175 transitions. [2019-08-05 11:14:49,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 11:14:49,785 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:49,785 INFO L399 BasicCegarLoop]: trace histogram [36, 28, 28, 28, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1] [2019-08-05 11:14:49,785 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:49,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:49,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1116950549, now seen corresponding path program 18 times [2019-08-05 11:14:49,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:49,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:14:49,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2432 backedges. 0 proven. 1164 refuted. 0 times theorem prover too weak. 1268 trivial. 0 not checked. [2019-08-05 11:14:50,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:50,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:14:50,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:14:50,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:14:50,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:14:50,256 INFO L87 Difference]: Start difference. First operand 151 states and 175 transitions. Second operand 19 states. [2019-08-05 11:14:50,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:50,374 INFO L93 Difference]: Finished difference Result 403 states and 469 transitions. [2019-08-05 11:14:50,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:14:50,376 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 181 [2019-08-05 11:14:50,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:50,379 INFO L225 Difference]: With dead ends: 403 [2019-08-05 11:14:50,379 INFO L226 Difference]: Without dead ends: 361 [2019-08-05 11:14:50,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:14:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-08-05 11:14:50,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 167. [2019-08-05 11:14:50,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-08-05 11:14:50,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 192 transitions. [2019-08-05 11:14:50,393 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 192 transitions. Word has length 181 [2019-08-05 11:14:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:50,393 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 192 transitions. [2019-08-05 11:14:50,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:14:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 192 transitions. [2019-08-05 11:14:50,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-08-05 11:14:50,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:50,395 INFO L399 BasicCegarLoop]: trace histogram [43, 34, 34, 34, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:14:50,395 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:50,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:50,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1373480266, now seen corresponding path program 19 times [2019-08-05 11:14:50,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:50,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:14:50,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3477 backedges. 8 proven. 634 refuted. 0 times theorem prover too weak. 2835 trivial. 0 not checked. [2019-08-05 11:14:50,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:50,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:14:50,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:14:50,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:14:50,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:14:50,818 INFO L87 Difference]: Start difference. First operand 167 states and 192 transitions. Second operand 14 states. [2019-08-05 11:14:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:50,980 INFO L93 Difference]: Finished difference Result 257 states and 290 transitions. [2019-08-05 11:14:50,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:14:50,983 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 213 [2019-08-05 11:14:50,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:50,985 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:14:50,985 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:14:50,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:14:50,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:14:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-08-05 11:14:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 11:14:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 194 transitions. [2019-08-05 11:14:50,991 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 194 transitions. Word has length 213 [2019-08-05 11:14:50,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:50,992 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 194 transitions. [2019-08-05 11:14:50,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:14:50,992 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 194 transitions. [2019-08-05 11:14:50,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-08-05 11:14:50,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:50,994 INFO L399 BasicCegarLoop]: trace histogram [44, 35, 35, 35, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:14:50,994 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:50,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:50,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1282606533, now seen corresponding path program 20 times [2019-08-05 11:14:50,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:51,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:14:51,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3640 backedges. 1369 proven. 435 refuted. 0 times theorem prover too weak. 1836 trivial. 0 not checked. [2019-08-05 11:14:52,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:52,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:14:52,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:14:52,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:14:52,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:14:52,766 INFO L87 Difference]: Start difference. First operand 169 states and 194 transitions. Second operand 24 states. [2019-08-05 11:14:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:55,904 INFO L93 Difference]: Finished difference Result 487 states and 839 transitions. [2019-08-05 11:14:55,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:14:55,905 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 217 [2019-08-05 11:14:55,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:55,911 INFO L225 Difference]: With dead ends: 487 [2019-08-05 11:14:55,911 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:14:55,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1805 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1340, Invalid=3916, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:14:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:14:55,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 187. [2019-08-05 11:14:55,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-08-05 11:14:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 218 transitions. [2019-08-05 11:14:55,924 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 218 transitions. Word has length 217 [2019-08-05 11:14:55,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:55,925 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 218 transitions. [2019-08-05 11:14:55,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:14:55,925 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 218 transitions. [2019-08-05 11:14:55,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-08-05 11:14:55,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:55,927 INFO L399 BasicCegarLoop]: trace histogram [45, 36, 36, 36, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:14:55,927 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:55,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:55,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1717316416, now seen corresponding path program 21 times [2019-08-05 11:14:55,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:56,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 11:14:56,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3807 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1977 trivial. 0 not checked. [2019-08-05 11:14:56,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:56,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:14:56,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:14:56,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:14:56,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:14:56,402 INFO L87 Difference]: Start difference. First operand 187 states and 218 transitions. Second operand 21 states. [2019-08-05 11:14:56,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:56,516 INFO L93 Difference]: Finished difference Result 555 states and 642 transitions. [2019-08-05 11:14:56,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:14:56,517 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 221 [2019-08-05 11:14:56,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:56,521 INFO L225 Difference]: With dead ends: 555 [2019-08-05 11:14:56,521 INFO L226 Difference]: Without dead ends: 499 [2019-08-05 11:14:56,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:14:56,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-08-05 11:14:56,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 205. [2019-08-05 11:14:56,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-08-05 11:14:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 237 transitions. [2019-08-05 11:14:56,537 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 237 transitions. Word has length 221 [2019-08-05 11:14:56,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:56,537 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 237 transitions. [2019-08-05 11:14:56,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:14:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 237 transitions. [2019-08-05 11:14:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-08-05 11:14:56,539 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:56,539 INFO L399 BasicCegarLoop]: trace histogram [53, 43, 43, 43, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1] [2019-08-05 11:14:56,540 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:56,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:56,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1514824218, now seen corresponding path program 22 times [2019-08-05 11:14:56,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:56,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:14:56,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5292 backedges. 9 proven. 884 refuted. 0 times theorem prover too weak. 4399 trivial. 0 not checked. [2019-08-05 11:14:56,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:56,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:14:56,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:14:56,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:14:56,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:14:56,843 INFO L87 Difference]: Start difference. First operand 205 states and 237 transitions. Second operand 15 states. [2019-08-05 11:14:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:57,122 INFO L93 Difference]: Finished difference Result 315 states and 356 transitions. [2019-08-05 11:14:57,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:14:57,122 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 257 [2019-08-05 11:14:57,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:57,124 INFO L225 Difference]: With dead ends: 315 [2019-08-05 11:14:57,124 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:14:57,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:14:57,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:14:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-08-05 11:14:57,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-08-05 11:14:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2019-08-05 11:14:57,132 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 257 [2019-08-05 11:14:57,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:57,132 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2019-08-05 11:14:57,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:14:57,133 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2019-08-05 11:14:57,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-08-05 11:14:57,134 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:57,135 INFO L399 BasicCegarLoop]: trace histogram [54, 44, 44, 44, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1] [2019-08-05 11:14:57,135 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:57,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:57,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1668385579, now seen corresponding path program 23 times [2019-08-05 11:14:57,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:57,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:14:57,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5494 backedges. 2088 proven. 633 refuted. 0 times theorem prover too weak. 2773 trivial. 0 not checked. [2019-08-05 11:14:57,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:57,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:57,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:57,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:57,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:57,917 INFO L87 Difference]: Start difference. First operand 207 states and 239 transitions. Second operand 27 states. [2019-08-05 11:15:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:01,537 INFO L93 Difference]: Finished difference Result 649 states and 1138 transitions. [2019-08-05 11:15:01,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:15:01,538 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 261 [2019-08-05 11:15:01,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:01,542 INFO L225 Difference]: With dead ends: 649 [2019-08-05 11:15:01,542 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:15:01,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3009 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2079, Invalid=6111, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:15:01,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:15:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 227. [2019-08-05 11:15:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-08-05 11:15:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 266 transitions. [2019-08-05 11:15:01,555 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 266 transitions. Word has length 261 [2019-08-05 11:15:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:01,556 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 266 transitions. [2019-08-05 11:15:01,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:15:01,556 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 266 transitions. [2019-08-05 11:15:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-08-05 11:15:01,558 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:01,558 INFO L399 BasicCegarLoop]: trace histogram [55, 45, 45, 45, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1] [2019-08-05 11:15:01,559 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:01,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:01,559 INFO L82 PathProgramCache]: Analyzing trace with hash -979754128, now seen corresponding path program 24 times [2019-08-05 11:15:01,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:01,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 11:15:01,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2750 refuted. 0 times theorem prover too weak. 2950 trivial. 0 not checked. [2019-08-05 11:15:02,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:02,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:15:02,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:15:02,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:15:02,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:15:02,590 INFO L87 Difference]: Start difference. First operand 227 states and 266 transitions. Second operand 23 states. [2019-08-05 11:15:02,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:02,703 INFO L93 Difference]: Finished difference Result 743 states and 854 transitions. [2019-08-05 11:15:02,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:15:02,703 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 265 [2019-08-05 11:15:02,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:02,708 INFO L225 Difference]: With dead ends: 743 [2019-08-05 11:15:02,708 INFO L226 Difference]: Without dead ends: 671 [2019-08-05 11:15:02,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:15:02,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-08-05 11:15:02,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 247. [2019-08-05 11:15:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-08-05 11:15:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 287 transitions. [2019-08-05 11:15:02,728 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 287 transitions. Word has length 265 [2019-08-05 11:15:02,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:02,728 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 287 transitions. [2019-08-05 11:15:02,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:15:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 287 transitions. [2019-08-05 11:15:02,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-08-05 11:15:02,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:02,731 INFO L399 BasicCegarLoop]: trace histogram [64, 53, 53, 53, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1] [2019-08-05 11:15:02,731 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:02,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:02,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1655571099, now seen corresponding path program 25 times [2019-08-05 11:15:02,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:02,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:15:02,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7734 backedges. 10 proven. 1192 refuted. 0 times theorem prover too weak. 6532 trivial. 0 not checked. [2019-08-05 11:15:03,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:03,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:15:03,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:15:03,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:15:03,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:15:03,093 INFO L87 Difference]: Start difference. First operand 247 states and 287 transitions. Second operand 16 states. [2019-08-05 11:15:03,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:03,232 INFO L93 Difference]: Finished difference Result 379 states and 429 transitions. [2019-08-05 11:15:03,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:15:03,242 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 305 [2019-08-05 11:15:03,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:03,244 INFO L225 Difference]: With dead ends: 379 [2019-08-05 11:15:03,244 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:15:03,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:15:03,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:15:03,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2019-08-05 11:15:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-08-05 11:15:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 289 transitions. [2019-08-05 11:15:03,253 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 289 transitions. Word has length 305 [2019-08-05 11:15:03,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:03,253 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 289 transitions. [2019-08-05 11:15:03,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:15:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 289 transitions. [2019-08-05 11:15:03,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-08-05 11:15:03,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:03,256 INFO L399 BasicCegarLoop]: trace histogram [65, 54, 54, 54, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1] [2019-08-05 11:15:03,257 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:03,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:03,257 INFO L82 PathProgramCache]: Analyzing trace with hash -2147454496, now seen corresponding path program 26 times [2019-08-05 11:15:03,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:03,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:15:03,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:03,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7979 backedges. 3067 proven. 883 refuted. 0 times theorem prover too weak. 4029 trivial. 0 not checked. [2019-08-05 11:15:03,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:03,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:15:03,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:15:03,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:15:03,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:15:03,823 INFO L87 Difference]: Start difference. First operand 249 states and 289 transitions. Second operand 30 states. [2019-08-05 11:15:09,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:09,171 INFO L93 Difference]: Finished difference Result 847 states and 1504 transitions. [2019-08-05 11:15:09,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 11:15:09,173 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 309 [2019-08-05 11:15:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:09,176 INFO L225 Difference]: With dead ends: 847 [2019-08-05 11:15:09,176 INFO L226 Difference]: Without dead ends: 291 [2019-08-05 11:15:09,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4709 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3090, Invalid=9120, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:15:09,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-08-05 11:15:09,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 271. [2019-08-05 11:15:09,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-08-05 11:15:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 319 transitions. [2019-08-05 11:15:09,193 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 319 transitions. Word has length 309 [2019-08-05 11:15:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:09,194 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 319 transitions. [2019-08-05 11:15:09,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:15:09,194 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 319 transitions. [2019-08-05 11:15:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-08-05 11:15:09,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:09,197 INFO L399 BasicCegarLoop]: trace histogram [66, 55, 55, 55, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1] [2019-08-05 11:15:09,197 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:09,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:09,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1668578341, now seen corresponding path program 27 times [2019-08-05 11:15:09,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:09,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 157 conjunts are in the unsatisfiable core [2019-08-05 11:15:09,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8228 backedges. 0 proven. 3982 refuted. 0 times theorem prover too weak. 4246 trivial. 0 not checked. [2019-08-05 11:15:09,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:09,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:15:09,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:15:09,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:15:09,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:15:09,879 INFO L87 Difference]: Start difference. First operand 271 states and 319 transitions. Second operand 25 states. [2019-08-05 11:15:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:10,196 INFO L93 Difference]: Finished difference Result 971 states and 1109 transitions. [2019-08-05 11:15:10,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:15:10,197 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 313 [2019-08-05 11:15:10,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:10,205 INFO L225 Difference]: With dead ends: 971 [2019-08-05 11:15:10,205 INFO L226 Difference]: Without dead ends: 881 [2019-08-05 11:15:10,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:15:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-08-05 11:15:10,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 293. [2019-08-05 11:15:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-08-05 11:15:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 342 transitions. [2019-08-05 11:15:10,235 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 342 transitions. Word has length 313 [2019-08-05 11:15:10,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:10,235 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 342 transitions. [2019-08-05 11:15:10,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:15:10,236 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 342 transitions. [2019-08-05 11:15:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-08-05 11:15:10,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:10,240 INFO L399 BasicCegarLoop]: trace histogram [76, 64, 64, 64, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1] [2019-08-05 11:15:10,240 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:10,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:10,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1458849173, now seen corresponding path program 28 times [2019-08-05 11:15:10,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:10,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 1073 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 11:15:10,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10932 backedges. 11 proven. 1564 refuted. 0 times theorem prover too weak. 9357 trivial. 0 not checked. [2019-08-05 11:15:11,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:11,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:15:11,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:15:11,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:15:11,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:15:11,043 INFO L87 Difference]: Start difference. First operand 293 states and 342 transitions. Second operand 17 states. [2019-08-05 11:15:11,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:11,248 INFO L93 Difference]: Finished difference Result 449 states and 509 transitions. [2019-08-05 11:15:11,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:15:11,249 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 357 [2019-08-05 11:15:11,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:11,252 INFO L225 Difference]: With dead ends: 449 [2019-08-05 11:15:11,252 INFO L226 Difference]: Without dead ends: 295 [2019-08-05 11:15:11,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:15:11,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-08-05 11:15:11,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-08-05 11:15:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-08-05 11:15:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 344 transitions. [2019-08-05 11:15:11,264 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 344 transitions. Word has length 357 [2019-08-05 11:15:11,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:11,264 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 344 transitions. [2019-08-05 11:15:11,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:15:11,264 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 344 transitions. [2019-08-05 11:15:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-08-05 11:15:11,267 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:11,268 INFO L399 BasicCegarLoop]: trace histogram [77, 65, 65, 65, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1] [2019-08-05 11:15:11,268 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:11,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:11,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1678873830, now seen corresponding path program 29 times [2019-08-05 11:15:11,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:11,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:15:11,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 11224 backedges. 4364 proven. 1191 refuted. 0 times theorem prover too weak. 5669 trivial. 0 not checked. [2019-08-05 11:15:11,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:11,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:15:11,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:15:11,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:15:11,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=848, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:15:11,902 INFO L87 Difference]: Start difference. First operand 295 states and 344 transitions. Second operand 33 states. [2019-08-05 11:15:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:17,253 INFO L93 Difference]: Finished difference Result 1085 states and 1944 transitions. [2019-08-05 11:15:17,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-08-05 11:15:17,253 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 361 [2019-08-05 11:15:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:17,258 INFO L225 Difference]: With dead ends: 1085 [2019-08-05 11:15:17,258 INFO L226 Difference]: Without dead ends: 341 [2019-08-05 11:15:17,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7067 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4433, Invalid=13123, Unknown=0, NotChecked=0, Total=17556 [2019-08-05 11:15:17,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-08-05 11:15:17,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 319. [2019-08-05 11:15:17,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-08-05 11:15:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 377 transitions. [2019-08-05 11:15:17,275 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 377 transitions. Word has length 361 [2019-08-05 11:15:17,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:17,276 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 377 transitions. [2019-08-05 11:15:17,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:15:17,276 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 377 transitions. [2019-08-05 11:15:17,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-08-05 11:15:17,279 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:17,279 INFO L399 BasicCegarLoop]: trace histogram [78, 66, 66, 66, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1] [2019-08-05 11:15:17,280 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:17,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:17,280 INFO L82 PathProgramCache]: Analyzing trace with hash -562062433, now seen corresponding path program 30 times [2019-08-05 11:15:17,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:17,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 183 conjunts are in the unsatisfiable core [2019-08-05 11:15:17,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 11520 backedges. 0 proven. 5590 refuted. 0 times theorem prover too weak. 5930 trivial. 0 not checked. [2019-08-05 11:15:18,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:18,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:15:18,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:15:18,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:15:18,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:15:18,014 INFO L87 Difference]: Start difference. First operand 319 states and 377 transitions. Second operand 27 states. [2019-08-05 11:15:18,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:18,203 INFO L93 Difference]: Finished difference Result 1243 states and 1411 transitions. [2019-08-05 11:15:18,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:15:18,204 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 365 [2019-08-05 11:15:18,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:18,210 INFO L225 Difference]: With dead ends: 1243 [2019-08-05 11:15:18,210 INFO L226 Difference]: Without dead ends: 1133 [2019-08-05 11:15:18,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:15:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2019-08-05 11:15:18,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 343. [2019-08-05 11:15:18,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-08-05 11:15:18,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 402 transitions. [2019-08-05 11:15:18,236 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 402 transitions. Word has length 365 [2019-08-05 11:15:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:18,237 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 402 transitions. [2019-08-05 11:15:18,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:15:18,237 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 402 transitions. [2019-08-05 11:15:18,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-08-05 11:15:18,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:18,241 INFO L399 BasicCegarLoop]: trace histogram [89, 76, 76, 76, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1] [2019-08-05 11:15:18,241 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:18,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:18,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1042018388, now seen corresponding path program 31 times [2019-08-05 11:15:18,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:18,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 11:15:18,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 15027 backedges. 12 proven. 2006 refuted. 0 times theorem prover too weak. 13009 trivial. 0 not checked. [2019-08-05 11:15:18,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:18,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:15:18,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:15:18,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:15:18,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:15:18,778 INFO L87 Difference]: Start difference. First operand 343 states and 402 transitions. Second operand 18 states. [2019-08-05 11:15:19,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:19,258 INFO L93 Difference]: Finished difference Result 525 states and 596 transitions. [2019-08-05 11:15:19,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:15:19,258 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 413 [2019-08-05 11:15:19,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:19,262 INFO L225 Difference]: With dead ends: 525 [2019-08-05 11:15:19,262 INFO L226 Difference]: Without dead ends: 345 [2019-08-05 11:15:19,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:15:19,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-08-05 11:15:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2019-08-05 11:15:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-08-05 11:15:19,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 404 transitions. [2019-08-05 11:15:19,272 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 404 transitions. Word has length 413 [2019-08-05 11:15:19,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:19,273 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 404 transitions. [2019-08-05 11:15:19,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:15:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 404 transitions. [2019-08-05 11:15:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-08-05 11:15:19,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:19,276 INFO L399 BasicCegarLoop]: trace histogram [90, 77, 77, 77, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1] [2019-08-05 11:15:19,277 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:19,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:19,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1152610215, now seen corresponding path program 32 times [2019-08-05 11:15:19,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:19,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:15:19,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:20,099 INFO L134 CoverageAnalysis]: Checked inductivity of 15370 backedges. 6043 proven. 1563 refuted. 0 times theorem prover too weak. 7764 trivial. 0 not checked. [2019-08-05 11:15:20,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:20,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:15:20,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:15:20,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:15:20,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1015, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:15:20,101 INFO L87 Difference]: Start difference. First operand 345 states and 404 transitions. Second operand 36 states. [2019-08-05 11:15:27,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:27,244 INFO L93 Difference]: Finished difference Result 1367 states and 2465 transitions. [2019-08-05 11:15:27,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-08-05 11:15:27,250 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 417 [2019-08-05 11:15:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:27,255 INFO L225 Difference]: With dead ends: 1367 [2019-08-05 11:15:27,255 INFO L226 Difference]: Without dead ends: 395 [2019-08-05 11:15:27,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10232 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=6174, Invalid=18318, Unknown=0, NotChecked=0, Total=24492 [2019-08-05 11:15:27,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-08-05 11:15:27,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 371. [2019-08-05 11:15:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-08-05 11:15:27,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 440 transitions. [2019-08-05 11:15:27,271 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 440 transitions. Word has length 417 [2019-08-05 11:15:27,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:27,271 INFO L475 AbstractCegarLoop]: Abstraction has 371 states and 440 transitions. [2019-08-05 11:15:27,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:15:27,271 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 440 transitions. [2019-08-05 11:15:27,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-08-05 11:15:27,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:27,275 INFO L399 BasicCegarLoop]: trace histogram [91, 78, 78, 78, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1] [2019-08-05 11:15:27,275 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:27,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:27,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1512690850, now seen corresponding path program 33 times [2019-08-05 11:15:27,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:27,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 211 conjunts are in the unsatisfiable core [2019-08-05 11:15:27,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 15717 backedges. 0 proven. 7644 refuted. 0 times theorem prover too weak. 8073 trivial. 0 not checked. [2019-08-05 11:15:28,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:28,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:28,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:15:28,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:15:28,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:28,186 INFO L87 Difference]: Start difference. First operand 371 states and 440 transitions. Second operand 29 states. [2019-08-05 11:15:28,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:28,364 INFO L93 Difference]: Finished difference Result 1563 states and 1764 transitions. [2019-08-05 11:15:28,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:15:28,365 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 421 [2019-08-05 11:15:28,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:28,375 INFO L225 Difference]: With dead ends: 1563 [2019-08-05 11:15:28,375 INFO L226 Difference]: Without dead ends: 1431 [2019-08-05 11:15:28,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:15:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-08-05 11:15:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 397. [2019-08-05 11:15:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-08-05 11:15:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 467 transitions. [2019-08-05 11:15:28,405 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 467 transitions. Word has length 421 [2019-08-05 11:15:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:28,406 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 467 transitions. [2019-08-05 11:15:28,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:15:28,406 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 467 transitions. [2019-08-05 11:15:28,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-08-05 11:15:28,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:28,410 INFO L399 BasicCegarLoop]: trace histogram [103, 89, 89, 89, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1] [2019-08-05 11:15:28,410 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:28,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:28,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1957521128, now seen corresponding path program 34 times [2019-08-05 11:15:28,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:28,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 1421 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 11:15:28,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 20172 backedges. 13 proven. 2524 refuted. 0 times theorem prover too weak. 17635 trivial. 0 not checked. [2019-08-05 11:15:29,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:29,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:15:29,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:15:29,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:15:29,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:15:29,844 INFO L87 Difference]: Start difference. First operand 397 states and 467 transitions. Second operand 19 states. [2019-08-05 11:15:30,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:30,062 INFO L93 Difference]: Finished difference Result 607 states and 690 transitions. [2019-08-05 11:15:30,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:15:30,062 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 473 [2019-08-05 11:15:30,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:30,066 INFO L225 Difference]: With dead ends: 607 [2019-08-05 11:15:30,066 INFO L226 Difference]: Without dead ends: 399 [2019-08-05 11:15:30,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:15:30,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-08-05 11:15:30,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2019-08-05 11:15:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-08-05 11:15:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 469 transitions. [2019-08-05 11:15:30,077 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 469 transitions. Word has length 473 [2019-08-05 11:15:30,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:30,077 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 469 transitions. [2019-08-05 11:15:30,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:15:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 469 transitions. [2019-08-05 11:15:30,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-08-05 11:15:30,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:30,082 INFO L399 BasicCegarLoop]: trace histogram [104, 90, 90, 90, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1] [2019-08-05 11:15:30,082 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:30,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:30,083 INFO L82 PathProgramCache]: Analyzing trace with hash -272394275, now seen corresponding path program 35 times [2019-08-05 11:15:30,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:30,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 1433 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 11:15:30,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:30,993 INFO L134 CoverageAnalysis]: Checked inductivity of 20570 backedges. 8174 proven. 2005 refuted. 0 times theorem prover too weak. 10391 trivial. 0 not checked. [2019-08-05 11:15:30,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:30,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:15:30,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:15:30,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:15:30,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1197, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:15:30,995 INFO L87 Difference]: Start difference. First operand 399 states and 469 transitions. Second operand 39 states. [2019-08-05 11:15:40,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:40,342 INFO L93 Difference]: Finished difference Result 1697 states and 3074 transitions. [2019-08-05 11:15:40,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2019-08-05 11:15:40,342 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 477 [2019-08-05 11:15:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:40,347 INFO L225 Difference]: With dead ends: 1697 [2019-08-05 11:15:40,347 INFO L226 Difference]: Without dead ends: 453 [2019-08-05 11:15:40,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14333 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=8385, Invalid=24921, Unknown=0, NotChecked=0, Total=33306 [2019-08-05 11:15:40,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-08-05 11:15:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 427. [2019-08-05 11:15:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-08-05 11:15:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 508 transitions. [2019-08-05 11:15:40,363 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 508 transitions. Word has length 477 [2019-08-05 11:15:40,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:40,364 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 508 transitions. [2019-08-05 11:15:40,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:15:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 508 transitions. [2019-08-05 11:15:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-08-05 11:15:40,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:40,368 INFO L399 BasicCegarLoop]: trace histogram [105, 91, 91, 91, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1] [2019-08-05 11:15:40,369 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:40,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash 937951650, now seen corresponding path program 36 times [2019-08-05 11:15:40,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:40,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 241 conjunts are in the unsatisfiable core [2019-08-05 11:15:40,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 20972 backedges. 0 proven. 10220 refuted. 0 times theorem prover too weak. 10752 trivial. 0 not checked. [2019-08-05 11:15:41,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:41,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:15:41,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:15:41,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:15:41,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:15:41,516 INFO L87 Difference]: Start difference. First operand 427 states and 508 transitions. Second operand 31 states. [2019-08-05 11:15:41,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:41,694 INFO L93 Difference]: Finished difference Result 1935 states and 2172 transitions. [2019-08-05 11:15:41,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:15:41,695 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 481 [2019-08-05 11:15:41,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:41,703 INFO L225 Difference]: With dead ends: 1935 [2019-08-05 11:15:41,703 INFO L226 Difference]: Without dead ends: 1779 [2019-08-05 11:15:41,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:15:41,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2019-08-05 11:15:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 455. [2019-08-05 11:15:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-08-05 11:15:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 537 transitions. [2019-08-05 11:15:41,735 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 537 transitions. Word has length 481 [2019-08-05 11:15:41,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:41,736 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 537 transitions. [2019-08-05 11:15:41,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:15:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 537 transitions. [2019-08-05 11:15:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-08-05 11:15:41,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:41,741 INFO L399 BasicCegarLoop]: trace histogram [118, 103, 103, 103, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1] [2019-08-05 11:15:41,741 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:41,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:41,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1613165281, now seen corresponding path program 37 times [2019-08-05 11:15:41,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:42,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 1613 conjuncts, 151 conjunts are in the unsatisfiable core [2019-08-05 11:15:42,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 26532 backedges. 14 proven. 3124 refuted. 0 times theorem prover too weak. 23394 trivial. 0 not checked. [2019-08-05 11:15:42,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:42,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:15:42,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:15:42,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:15:42,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:15:42,914 INFO L87 Difference]: Start difference. First operand 455 states and 537 transitions. Second operand 20 states. [2019-08-05 11:15:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:43,070 INFO L93 Difference]: Finished difference Result 695 states and 791 transitions. [2019-08-05 11:15:43,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:15:43,071 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 537 [2019-08-05 11:15:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:43,074 INFO L225 Difference]: With dead ends: 695 [2019-08-05 11:15:43,074 INFO L226 Difference]: Without dead ends: 457 [2019-08-05 11:15:43,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:15:43,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-08-05 11:15:43,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2019-08-05 11:15:43,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-08-05 11:15:43,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 539 transitions. [2019-08-05 11:15:43,084 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 539 transitions. Word has length 537 [2019-08-05 11:15:43,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:43,085 INFO L475 AbstractCegarLoop]: Abstraction has 457 states and 539 transitions. [2019-08-05 11:15:43,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:15:43,085 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 539 transitions. [2019-08-05 11:15:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-08-05 11:15:43,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:43,090 INFO L399 BasicCegarLoop]: trace histogram [119, 104, 104, 104, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1] [2019-08-05 11:15:43,091 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:43,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:43,091 INFO L82 PathProgramCache]: Analyzing trace with hash -242031450, now seen corresponding path program 38 times [2019-08-05 11:15:43,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:43,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 1625 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 11:15:43,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 26989 backedges. 10833 proven. 2523 refuted. 0 times theorem prover too weak. 13633 trivial. 0 not checked. [2019-08-05 11:15:44,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:44,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:15:44,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:15:44,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:15:44,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1394, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:15:44,350 INFO L87 Difference]: Start difference. First operand 457 states and 539 transitions. Second operand 42 states. [2019-08-05 11:15:55,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:55,594 INFO L93 Difference]: Finished difference Result 2079 states and 3778 transitions. [2019-08-05 11:15:55,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2019-08-05 11:15:55,595 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 541 [2019-08-05 11:15:55,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:55,602 INFO L225 Difference]: With dead ends: 2079 [2019-08-05 11:15:55,603 INFO L226 Difference]: Without dead ends: 515 [2019-08-05 11:15:55,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19567 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=11144, Invalid=33166, Unknown=0, NotChecked=0, Total=44310 [2019-08-05 11:15:55,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-08-05 11:15:55,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 487. [2019-08-05 11:15:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-08-05 11:15:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 581 transitions. [2019-08-05 11:15:55,627 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 581 transitions. Word has length 541 [2019-08-05 11:15:55,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:55,628 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 581 transitions. [2019-08-05 11:15:55,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:15:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 581 transitions. [2019-08-05 11:15:55,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2019-08-05 11:15:55,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:55,678 INFO L399 BasicCegarLoop]: trace histogram [120, 105, 105, 105, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1] [2019-08-05 11:15:55,678 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:55,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:55,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1632554645, now seen corresponding path program 39 times [2019-08-05 11:15:55,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:55,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 1637 conjuncts, 273 conjunts are in the unsatisfiable core [2019-08-05 11:15:55,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 27450 backedges. 0 proven. 13400 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2019-08-05 11:15:56,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:56,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:15:56,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:15:56,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:15:56,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:15:56,828 INFO L87 Difference]: Start difference. First operand 487 states and 581 transitions. Second operand 33 states. [2019-08-05 11:15:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:57,048 INFO L93 Difference]: Finished difference Result 2363 states and 2639 transitions. [2019-08-05 11:15:57,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:15:57,048 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 545 [2019-08-05 11:15:57,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:57,059 INFO L225 Difference]: With dead ends: 2363 [2019-08-05 11:15:57,059 INFO L226 Difference]: Without dead ends: 2181 [2019-08-05 11:15:57,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:15:57,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2019-08-05 11:15:57,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 517. [2019-08-05 11:15:57,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-08-05 11:15:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 612 transitions. [2019-08-05 11:15:57,096 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 612 transitions. Word has length 545 [2019-08-05 11:15:57,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:57,097 INFO L475 AbstractCegarLoop]: Abstraction has 517 states and 612 transitions. [2019-08-05 11:15:57,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:15:57,097 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 612 transitions. [2019-08-05 11:15:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-08-05 11:15:57,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:57,103 INFO L399 BasicCegarLoop]: trace histogram [134, 118, 118, 118, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1] [2019-08-05 11:15:57,103 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:57,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:57,103 INFO L82 PathProgramCache]: Analyzing trace with hash -767316625, now seen corresponding path program 40 times [2019-08-05 11:15:57,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:57,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 1817 conjuncts, 169 conjunts are in the unsatisfiable core [2019-08-05 11:15:57,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 34284 backedges. 15 proven. 3812 refuted. 0 times theorem prover too weak. 30457 trivial. 0 not checked. [2019-08-05 11:15:57,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:57,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:15:57,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:15:57,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:15:57,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:15:57,808 INFO L87 Difference]: Start difference. First operand 517 states and 612 transitions. Second operand 21 states. [2019-08-05 11:15:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:57,920 INFO L93 Difference]: Finished difference Result 789 states and 899 transitions. [2019-08-05 11:15:57,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:15:57,920 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 605 [2019-08-05 11:15:57,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:57,924 INFO L225 Difference]: With dead ends: 789 [2019-08-05 11:15:57,924 INFO L226 Difference]: Without dead ends: 519 [2019-08-05 11:15:57,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:15:57,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-08-05 11:15:57,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 519. [2019-08-05 11:15:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-08-05 11:15:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 614 transitions. [2019-08-05 11:15:57,936 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 614 transitions. Word has length 605 [2019-08-05 11:15:57,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:57,936 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 614 transitions. [2019-08-05 11:15:57,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:15:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 614 transitions. [2019-08-05 11:15:57,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-08-05 11:15:57,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:57,943 INFO L399 BasicCegarLoop]: trace histogram [135, 119, 119, 119, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1] [2019-08-05 11:15:57,943 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:57,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1318099340, now seen corresponding path program 41 times [2019-08-05 11:15:57,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:58,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 1829 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 11:15:58,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 34804 backedges. 14102 proven. 3123 refuted. 0 times theorem prover too weak. 17579 trivial. 0 not checked. [2019-08-05 11:15:59,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:59,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:15:59,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:15:59,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:15:59,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=1606, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:15:59,260 INFO L87 Difference]: Start difference. First operand 519 states and 614 transitions. Second operand 45 states. [2019-08-05 11:16:14,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:14,901 INFO L93 Difference]: Finished difference Result 2517 states and 4584 transitions. [2019-08-05 11:16:14,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2019-08-05 11:16:14,902 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 609 [2019-08-05 11:16:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:14,908 INFO L225 Difference]: With dead ends: 2517 [2019-08-05 11:16:14,908 INFO L226 Difference]: Without dead ends: 581 [2019-08-05 11:16:14,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26110 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=14535, Invalid=43305, Unknown=0, NotChecked=0, Total=57840 [2019-08-05 11:16:14,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-08-05 11:16:14,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 551. [2019-08-05 11:16:14,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-08-05 11:16:14,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 659 transitions. [2019-08-05 11:16:14,928 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 659 transitions. Word has length 609 [2019-08-05 11:16:14,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:14,929 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 659 transitions. [2019-08-05 11:16:14,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:16:14,929 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 659 transitions. [2019-08-05 11:16:14,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2019-08-05 11:16:14,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:14,935 INFO L399 BasicCegarLoop]: trace histogram [136, 120, 120, 120, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1] [2019-08-05 11:16:14,935 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:14,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:14,936 INFO L82 PathProgramCache]: Analyzing trace with hash -826480007, now seen corresponding path program 42 times [2019-08-05 11:16:14,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:15,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 1841 conjuncts, 307 conjunts are in the unsatisfiable core [2019-08-05 11:16:15,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 35328 backedges. 0 proven. 17272 refuted. 0 times theorem prover too weak. 18056 trivial. 0 not checked. [2019-08-05 11:16:16,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:16,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:16:16,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:16:16,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:16:16,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:16:16,136 INFO L87 Difference]: Start difference. First operand 551 states and 659 transitions. Second operand 35 states. [2019-08-05 11:16:16,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:16,306 INFO L93 Difference]: Finished difference Result 2851 states and 3169 transitions. [2019-08-05 11:16:16,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:16:16,306 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 613 [2019-08-05 11:16:16,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:16,316 INFO L225 Difference]: With dead ends: 2851 [2019-08-05 11:16:16,316 INFO L226 Difference]: Without dead ends: 2641 [2019-08-05 11:16:16,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:16:16,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2019-08-05 11:16:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 583. [2019-08-05 11:16:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-08-05 11:16:16,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 692 transitions. [2019-08-05 11:16:16,360 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 692 transitions. Word has length 613 [2019-08-05 11:16:16,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:16,361 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 692 transitions. [2019-08-05 11:16:16,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:16:16,361 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 692 transitions. [2019-08-05 11:16:16,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2019-08-05 11:16:16,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:16,368 INFO L399 BasicCegarLoop]: trace histogram [151, 134, 134, 134, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1] [2019-08-05 11:16:16,368 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:16,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:16,368 INFO L82 PathProgramCache]: Analyzing trace with hash -760339134, now seen corresponding path program 43 times [2019-08-05 11:16:16,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:16,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 2033 conjuncts, 188 conjunts are in the unsatisfiable core [2019-08-05 11:16:16,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 43617 backedges. 16 proven. 4594 refuted. 0 times theorem prover too weak. 39007 trivial. 0 not checked. [2019-08-05 11:16:17,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:17,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:16:17,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:16:17,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:16:17,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:16:17,181 INFO L87 Difference]: Start difference. First operand 583 states and 692 transitions. Second operand 22 states. [2019-08-05 11:16:17,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:17,299 INFO L93 Difference]: Finished difference Result 889 states and 1014 transitions. [2019-08-05 11:16:17,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:16:17,299 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 677 [2019-08-05 11:16:17,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:17,303 INFO L225 Difference]: With dead ends: 889 [2019-08-05 11:16:17,303 INFO L226 Difference]: Without dead ends: 585 [2019-08-05 11:16:17,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 656 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:16:17,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-08-05 11:16:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-08-05 11:16:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-08-05 11:16:17,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 694 transitions. [2019-08-05 11:16:17,316 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 694 transitions. Word has length 677 [2019-08-05 11:16:17,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:17,317 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 694 transitions. [2019-08-05 11:16:17,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:16:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 694 transitions. [2019-08-05 11:16:17,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2019-08-05 11:16:17,323 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:17,324 INFO L399 BasicCegarLoop]: trace histogram [152, 135, 135, 135, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1] [2019-08-05 11:16:17,324 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:17,324 INFO L82 PathProgramCache]: Analyzing trace with hash -288208441, now seen corresponding path program 44 times [2019-08-05 11:16:17,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:17,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 2045 conjuncts, 167 conjunts are in the unsatisfiable core [2019-08-05 11:16:17,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 44204 backedges. 18069 proven. 3811 refuted. 0 times theorem prover too weak. 22324 trivial. 0 not checked. [2019-08-05 11:16:18,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:18,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:16:18,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:16:18,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:16:18,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=1833, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:16:18,687 INFO L87 Difference]: Start difference. First operand 585 states and 694 transitions. Second operand 48 states. [2019-08-05 11:16:35,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:35,081 INFO L93 Difference]: Finished difference Result 3015 states and 5499 transitions. [2019-08-05 11:16:35,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 273 states. [2019-08-05 11:16:35,082 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 681 [2019-08-05 11:16:35,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:35,090 INFO L225 Difference]: With dead ends: 3015 [2019-08-05 11:16:35,090 INFO L226 Difference]: Without dead ends: 651 [2019-08-05 11:16:35,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 905 GetRequests, 634 SyntacticMatches, 0 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34233 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=18648, Invalid=55608, Unknown=0, NotChecked=0, Total=74256 [2019-08-05 11:16:35,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-08-05 11:16:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 619. [2019-08-05 11:16:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-08-05 11:16:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 742 transitions. [2019-08-05 11:16:35,113 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 742 transitions. Word has length 681 [2019-08-05 11:16:35,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:35,114 INFO L475 AbstractCegarLoop]: Abstraction has 619 states and 742 transitions. [2019-08-05 11:16:35,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:16:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 742 transitions. [2019-08-05 11:16:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2019-08-05 11:16:35,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:35,121 INFO L399 BasicCegarLoop]: trace histogram [153, 136, 136, 136, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1] [2019-08-05 11:16:35,121 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:35,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:35,122 INFO L82 PathProgramCache]: Analyzing trace with hash -310105780, now seen corresponding path program 45 times [2019-08-05 11:16:35,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:35,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 2057 conjuncts, 343 conjunts are in the unsatisfiable core [2019-08-05 11:16:35,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 44795 backedges. 0 proven. 21930 refuted. 0 times theorem prover too weak. 22865 trivial. 0 not checked. [2019-08-05 11:16:36,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:36,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:16:36,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:16:36,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:16:36,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:16:36,684 INFO L87 Difference]: Start difference. First operand 619 states and 742 transitions. Second operand 37 states. [2019-08-05 11:16:36,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:36,856 INFO L93 Difference]: Finished difference Result 3403 states and 3766 transitions. [2019-08-05 11:16:36,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:16:36,857 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 685 [2019-08-05 11:16:36,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:36,868 INFO L225 Difference]: With dead ends: 3403 [2019-08-05 11:16:36,869 INFO L226 Difference]: Without dead ends: 3163 [2019-08-05 11:16:36,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:16:36,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2019-08-05 11:16:36,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 653. [2019-08-05 11:16:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-08-05 11:16:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 777 transitions. [2019-08-05 11:16:36,917 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 777 transitions. Word has length 685 [2019-08-05 11:16:36,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:36,918 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 777 transitions. [2019-08-05 11:16:36,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:16:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 777 transitions. [2019-08-05 11:16:36,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2019-08-05 11:16:36,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:36,925 INFO L399 BasicCegarLoop]: trace histogram [169, 151, 151, 151, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1] [2019-08-05 11:16:36,925 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:36,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:36,926 INFO L82 PathProgramCache]: Analyzing trace with hash -343088230, now seen corresponding path program 46 times [2019-08-05 11:16:36,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:37,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 2261 conjuncts, 208 conjunts are in the unsatisfiable core [2019-08-05 11:16:37,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 54732 backedges. 17 proven. 5476 refuted. 0 times theorem prover too weak. 49239 trivial. 0 not checked. [2019-08-05 11:16:38,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:38,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:16:38,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:16:38,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:16:38,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=327, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:16:38,314 INFO L87 Difference]: Start difference. First operand 653 states and 777 transitions. Second operand 23 states. [2019-08-05 11:16:38,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:38,438 INFO L93 Difference]: Finished difference Result 995 states and 1136 transitions. [2019-08-05 11:16:38,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:16:38,439 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 753 [2019-08-05 11:16:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:38,443 INFO L225 Difference]: With dead ends: 995 [2019-08-05 11:16:38,443 INFO L226 Difference]: Without dead ends: 655 [2019-08-05 11:16:38,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 731 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:16:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-08-05 11:16:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-08-05 11:16:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-08-05 11:16:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 779 transitions. [2019-08-05 11:16:38,457 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 779 transitions. Word has length 753 [2019-08-05 11:16:38,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:38,458 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 779 transitions. [2019-08-05 11:16:38,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:16:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 779 transitions. [2019-08-05 11:16:38,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2019-08-05 11:16:38,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:38,466 INFO L399 BasicCegarLoop]: trace histogram [170, 152, 152, 152, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1] [2019-08-05 11:16:38,466 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:38,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:38,467 INFO L82 PathProgramCache]: Analyzing trace with hash 62617567, now seen corresponding path program 47 times [2019-08-05 11:16:38,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:38,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 2273 conjuncts, 186 conjunts are in the unsatisfiable core [2019-08-05 11:16:38,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:39,908 INFO L134 CoverageAnalysis]: Checked inductivity of 55390 backedges. 22828 proven. 4593 refuted. 0 times theorem prover too weak. 27969 trivial. 0 not checked. [2019-08-05 11:16:39,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:39,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:16:39,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:16:39,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:16:39,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=2075, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:16:39,910 INFO L87 Difference]: Start difference. First operand 655 states and 779 transitions. Second operand 51 states. [2019-08-05 11:17:00,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:00,759 INFO L93 Difference]: Finished difference Result 3577 states and 6530 transitions. [2019-08-05 11:17:00,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 307 states. [2019-08-05 11:17:00,759 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 757 [2019-08-05 11:17:00,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:00,765 INFO L225 Difference]: With dead ends: 3577 [2019-08-05 11:17:00,765 INFO L226 Difference]: Without dead ends: 725 [2019-08-05 11:17:00,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1012 GetRequests, 707 SyntacticMatches, 0 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44077 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=23579, Invalid=70363, Unknown=0, NotChecked=0, Total=93942 [2019-08-05 11:17:00,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-08-05 11:17:00,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 691. [2019-08-05 11:17:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-08-05 11:17:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 830 transitions. [2019-08-05 11:17:00,785 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 830 transitions. Word has length 757 [2019-08-05 11:17:00,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:00,786 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 830 transitions. [2019-08-05 11:17:00,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:17:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 830 transitions. [2019-08-05 11:17:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 762 [2019-08-05 11:17:00,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:00,794 INFO L399 BasicCegarLoop]: trace histogram [171, 153, 153, 153, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1] [2019-08-05 11:17:00,794 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:00,795 INFO L82 PathProgramCache]: Analyzing trace with hash -332646620, now seen corresponding path program 48 times [2019-08-05 11:17:00,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:01,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 2285 conjuncts, 381 conjunts are in the unsatisfiable core [2019-08-05 11:17:01,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 56052 backedges. 0 proven. 27474 refuted. 0 times theorem prover too weak. 28578 trivial. 0 not checked. [2019-08-05 11:17:02,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:02,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:17:02,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:17:02,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:17:02,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:17:02,628 INFO L87 Difference]: Start difference. First operand 691 states and 830 transitions. Second operand 39 states. [2019-08-05 11:17:02,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:02,816 INFO L93 Difference]: Finished difference Result 4023 states and 4434 transitions. [2019-08-05 11:17:02,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:17:02,816 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 761 [2019-08-05 11:17:02,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:02,828 INFO L225 Difference]: With dead ends: 4023 [2019-08-05 11:17:02,828 INFO L226 Difference]: Without dead ends: 3751 [2019-08-05 11:17:02,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 760 GetRequests, 723 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:17:02,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2019-08-05 11:17:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 727. [2019-08-05 11:17:02,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-08-05 11:17:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 867 transitions. [2019-08-05 11:17:02,867 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 867 transitions. Word has length 761 [2019-08-05 11:17:02,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:02,868 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 867 transitions. [2019-08-05 11:17:02,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:17:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 867 transitions. [2019-08-05 11:17:02,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2019-08-05 11:17:02,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:02,877 INFO L399 BasicCegarLoop]: trace histogram [188, 169, 169, 169, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1] [2019-08-05 11:17:02,877 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:02,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:02,878 INFO L82 PathProgramCache]: Analyzing trace with hash -588386697, now seen corresponding path program 49 times [2019-08-05 11:17:02,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:03,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 2501 conjuncts, 229 conjunts are in the unsatisfiable core [2019-08-05 11:17:03,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 67842 backedges. 18 proven. 6464 refuted. 0 times theorem prover too weak. 61360 trivial. 0 not checked. [2019-08-05 11:17:04,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:04,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:17:04,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:17:04,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:17:04,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=354, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:17:04,230 INFO L87 Difference]: Start difference. First operand 727 states and 867 transitions. Second operand 24 states. [2019-08-05 11:17:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:04,376 INFO L93 Difference]: Finished difference Result 1107 states and 1265 transitions. [2019-08-05 11:17:04,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:17:04,377 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 833 [2019-08-05 11:17:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:04,381 INFO L225 Difference]: With dead ends: 1107 [2019-08-05 11:17:04,381 INFO L226 Difference]: Without dead ends: 729 [2019-08-05 11:17:04,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 810 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:17:04,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-08-05 11:17:04,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2019-08-05 11:17:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-08-05 11:17:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 869 transitions. [2019-08-05 11:17:04,390 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 869 transitions. Word has length 833 [2019-08-05 11:17:04,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:04,390 INFO L475 AbstractCegarLoop]: Abstraction has 729 states and 869 transitions. [2019-08-05 11:17:04,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:17:04,390 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 869 transitions. [2019-08-05 11:17:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2019-08-05 11:17:04,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:04,397 INFO L399 BasicCegarLoop]: trace histogram [189, 170, 170, 170, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1] [2019-08-05 11:17:04,397 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:04,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:04,397 INFO L82 PathProgramCache]: Analyzing trace with hash 761259708, now seen corresponding path program 50 times [2019-08-05 11:17:04,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:04,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 206 conjunts are in the unsatisfiable core [2019-08-05 11:17:04,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 68575 backedges. 28479 proven. 5475 refuted. 0 times theorem prover too weak. 34621 trivial. 0 not checked. [2019-08-05 11:17:05,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:05,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:17:05,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:17:05,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:17:05,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=2332, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:17:05,982 INFO L87 Difference]: Start difference. First operand 729 states and 869 transitions. Second operand 54 states. [2019-08-05 11:17:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:35,396 INFO L93 Difference]: Finished difference Result 4207 states and 7684 transitions. [2019-08-05 11:17:35,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 343 states. [2019-08-05 11:17:35,397 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 837 [2019-08-05 11:17:35,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:35,405 INFO L225 Difference]: With dead ends: 4207 [2019-08-05 11:17:35,405 INFO L226 Difference]: Without dead ends: 803 [2019-08-05 11:17:35,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1125 GetRequests, 784 SyntacticMatches, 0 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55890 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=29430, Invalid=87876, Unknown=0, NotChecked=0, Total=117306 [2019-08-05 11:17:35,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2019-08-05 11:17:35,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 767. [2019-08-05 11:17:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-08-05 11:17:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 923 transitions. [2019-08-05 11:17:35,431 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 923 transitions. Word has length 837 [2019-08-05 11:17:35,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:35,431 INFO L475 AbstractCegarLoop]: Abstraction has 767 states and 923 transitions. [2019-08-05 11:17:35,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:17:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 923 transitions. [2019-08-05 11:17:35,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2019-08-05 11:17:35,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:35,440 INFO L399 BasicCegarLoop]: trace histogram [190, 171, 171, 171, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1] [2019-08-05 11:17:35,441 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:35,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:35,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1025309185, now seen corresponding path program 51 times [2019-08-05 11:17:35,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:36,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 2525 conjuncts, 421 conjunts are in the unsatisfiable core [2019-08-05 11:17:36,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 69312 backedges. 0 proven. 34010 refuted. 0 times theorem prover too weak. 35302 trivial. 0 not checked. [2019-08-05 11:17:37,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:37,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:17:37,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:17:37,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:17:37,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:17:37,288 INFO L87 Difference]: Start difference. First operand 767 states and 923 transitions. Second operand 41 states. [2019-08-05 11:17:37,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:37,485 INFO L93 Difference]: Finished difference Result 4715 states and 5177 transitions. [2019-08-05 11:17:37,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:17:37,486 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 841 [2019-08-05 11:17:37,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:37,497 INFO L225 Difference]: With dead ends: 4715 [2019-08-05 11:17:37,497 INFO L226 Difference]: Without dead ends: 4409 [2019-08-05 11:17:37,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 801 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:17:37,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2019-08-05 11:17:37,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 805. [2019-08-05 11:17:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-08-05 11:17:37,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 962 transitions. [2019-08-05 11:17:37,538 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 962 transitions. Word has length 841 [2019-08-05 11:17:37,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:37,539 INFO L475 AbstractCegarLoop]: Abstraction has 805 states and 962 transitions. [2019-08-05 11:17:37,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:17:37,539 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 962 transitions. [2019-08-05 11:17:37,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 918 [2019-08-05 11:17:37,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:37,547 INFO L399 BasicCegarLoop]: trace histogram [208, 188, 188, 188, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1] [2019-08-05 11:17:37,547 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:37,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:37,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1081665689, now seen corresponding path program 52 times [2019-08-05 11:17:37,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:38,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 2753 conjuncts, 251 conjunts are in the unsatisfiable core [2019-08-05 11:17:38,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 83172 backedges. 19 proven. 7564 refuted. 0 times theorem prover too weak. 75589 trivial. 0 not checked. [2019-08-05 11:17:38,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:38,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:17:38,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:17:38,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:17:38,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=382, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:17:38,792 INFO L87 Difference]: Start difference. First operand 805 states and 962 transitions. Second operand 25 states. [2019-08-05 11:17:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:38,952 INFO L93 Difference]: Finished difference Result 1225 states and 1401 transitions. [2019-08-05 11:17:38,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:17:38,953 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 917 [2019-08-05 11:17:38,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:38,956 INFO L225 Difference]: With dead ends: 1225 [2019-08-05 11:17:38,957 INFO L226 Difference]: Without dead ends: 807 [2019-08-05 11:17:38,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 918 GetRequests, 893 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=244, Invalid=458, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:17:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2019-08-05 11:17:38,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 807. [2019-08-05 11:17:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-08-05 11:17:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 964 transitions. [2019-08-05 11:17:38,966 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 964 transitions. Word has length 917 [2019-08-05 11:17:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:38,966 INFO L475 AbstractCegarLoop]: Abstraction has 807 states and 964 transitions. [2019-08-05 11:17:38,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:17:38,967 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 964 transitions. [2019-08-05 11:17:38,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2019-08-05 11:17:38,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:38,975 INFO L399 BasicCegarLoop]: trace histogram [209, 189, 189, 189, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1] [2019-08-05 11:17:38,975 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:38,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:38,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1001371934, now seen corresponding path program 53 times [2019-08-05 11:17:38,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:39,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 2765 conjuncts, 227 conjunts are in the unsatisfiable core [2019-08-05 11:17:39,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 83984 backedges. 35128 proven. 6463 refuted. 0 times theorem prover too weak. 42393 trivial. 0 not checked. [2019-08-05 11:17:41,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:41,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:17:41,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:17:41,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:17:41,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=588, Invalid=2604, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:17:41,430 INFO L87 Difference]: Start difference. First operand 807 states and 964 transitions. Second operand 57 states. [2019-08-05 11:18:21,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:21,468 INFO L93 Difference]: Finished difference Result 4909 states and 8968 transitions. [2019-08-05 11:18:21,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 381 states. [2019-08-05 11:18:21,469 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 921 [2019-08-05 11:18:21,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:21,476 INFO L225 Difference]: With dead ends: 4909 [2019-08-05 11:18:21,476 INFO L226 Difference]: Without dead ends: 885 [2019-08-05 11:18:21,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1244 GetRequests, 865 SyntacticMatches, 0 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69978 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=36309, Invalid=108471, Unknown=0, NotChecked=0, Total=144780 [2019-08-05 11:18:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2019-08-05 11:18:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 847. [2019-08-05 11:18:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-08-05 11:18:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1021 transitions. [2019-08-05 11:18:21,502 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1021 transitions. Word has length 921 [2019-08-05 11:18:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:21,503 INFO L475 AbstractCegarLoop]: Abstraction has 847 states and 1021 transitions. [2019-08-05 11:18:21,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:18:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1021 transitions. [2019-08-05 11:18:21,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 926 [2019-08-05 11:18:21,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:21,513 INFO L399 BasicCegarLoop]: trace histogram [210, 190, 190, 190, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1] [2019-08-05 11:18:21,514 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:21,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:21,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1873079133, now seen corresponding path program 54 times [2019-08-05 11:18:21,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:22,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 2777 conjuncts, 463 conjunts are in the unsatisfiable core [2019-08-05 11:18:22,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 84800 backedges. 0 proven. 41650 refuted. 0 times theorem prover too weak. 43150 trivial. 0 not checked. [2019-08-05 11:18:23,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:23,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:18:23,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:18:23,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:18:23,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:18:23,968 INFO L87 Difference]: Start difference. First operand 847 states and 1021 transitions. Second operand 43 states. [2019-08-05 11:18:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:24,162 INFO L93 Difference]: Finished difference Result 5483 states and 5999 transitions. [2019-08-05 11:18:24,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:18:24,162 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 925 [2019-08-05 11:18:24,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:24,176 INFO L225 Difference]: With dead ends: 5483 [2019-08-05 11:18:24,176 INFO L226 Difference]: Without dead ends: 5141 [2019-08-05 11:18:24,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 883 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:18:24,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5141 states. [2019-08-05 11:18:24,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5141 to 887. [2019-08-05 11:18:24,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-08-05 11:18:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1062 transitions. [2019-08-05 11:18:24,242 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1062 transitions. Word has length 925 [2019-08-05 11:18:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:24,243 INFO L475 AbstractCegarLoop]: Abstraction has 887 states and 1062 transitions. [2019-08-05 11:18:24,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:18:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1062 transitions. [2019-08-05 11:18:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2019-08-05 11:18:24,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:24,257 INFO L399 BasicCegarLoop]: trace histogram [229, 208, 208, 208, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1] [2019-08-05 11:18:24,258 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:24,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:24,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1569914496, now seen corresponding path program 55 times [2019-08-05 11:18:24,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:24,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 3017 conjuncts, 274 conjunts are in the unsatisfiable core [2019-08-05 11:18:24,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 100959 backedges. 20 proven. 8782 refuted. 0 times theorem prover too weak. 92157 trivial. 0 not checked. [2019-08-05 11:18:25,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:25,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:18:25,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:18:25,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:18:25,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=411, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:18:25,751 INFO L87 Difference]: Start difference. First operand 887 states and 1062 transitions. Second operand 26 states. [2019-08-05 11:18:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:25,897 INFO L93 Difference]: Finished difference Result 1349 states and 1544 transitions. [2019-08-05 11:18:25,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:18:25,897 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1005 [2019-08-05 11:18:25,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:25,901 INFO L225 Difference]: With dead ends: 1349 [2019-08-05 11:18:25,901 INFO L226 Difference]: Without dead ends: 889 [2019-08-05 11:18:25,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1006 GetRequests, 980 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=266, Invalid=490, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:18:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2019-08-05 11:18:25,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 889. [2019-08-05 11:18:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-08-05 11:18:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1064 transitions. [2019-08-05 11:18:25,915 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1064 transitions. Word has length 1005 [2019-08-05 11:18:25,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:25,915 INFO L475 AbstractCegarLoop]: Abstraction has 889 states and 1064 transitions. [2019-08-05 11:18:25,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:18:25,915 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1064 transitions. [2019-08-05 11:18:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2019-08-05 11:18:25,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:25,927 INFO L399 BasicCegarLoop]: trace histogram [230, 209, 209, 209, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1] [2019-08-05 11:18:25,927 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:25,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash -619434363, now seen corresponding path program 56 times [2019-08-05 11:18:25,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:26,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 3029 conjuncts, 249 conjunts are in the unsatisfiable core [2019-08-05 11:18:26,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:28,109 INFO L134 CoverageAnalysis]: Checked inductivity of 101854 backedges. 42887 proven. 7563 refuted. 0 times theorem prover too weak. 51404 trivial. 0 not checked. [2019-08-05 11:18:28,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:28,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:18:28,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:18:28,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:18:28,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=2891, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:18:28,111 INFO L87 Difference]: Start difference. First operand 889 states and 1064 transitions. Second operand 60 states. Received shutdown request... [2019-08-05 11:18:32,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2019-08-05 11:18:32,984 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:18:32,989 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:18:32,989 INFO L202 PluginConnector]: Adding new model CallIrregular.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:18:32 BoogieIcfgContainer [2019-08-05 11:18:32,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:18:32,992 INFO L168 Benchmark]: Toolchain (without parser) took 239340.61 ms. Allocated memory was 134.7 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 111.1 MB in the beginning and 558.5 MB in the end (delta: -447.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-08-05 11:18:32,992 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:18:32,993 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.70 ms. Allocated memory is still 134.7 MB. Free memory was 111.1 MB in the beginning and 109.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:18:32,994 INFO L168 Benchmark]: Boogie Preprocessor took 24.83 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 108.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:18:32,994 INFO L168 Benchmark]: RCFGBuilder took 404.03 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 97.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:18:32,995 INFO L168 Benchmark]: TraceAbstraction took 238870.23 ms. Allocated memory was 134.7 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 97.5 MB in the beginning and 558.5 MB in the end (delta: -461.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-08-05 11:18:32,998 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.17 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.70 ms. Allocated memory is still 134.7 MB. Free memory was 111.1 MB in the beginning and 109.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.83 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 108.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 404.03 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 97.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 238870.23 ms. Allocated memory was 134.7 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 97.5 MB in the beginning and 558.5 MB in the end (delta: -461.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 12). Cancelled while BasicCegarLoop was constructing difference of abstraction (889states) and FLOYD_HOARE automaton (currently 211 states, 60 states before enhancement),while ReachableStatesComputation was computing reachable states (438 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. TIMEOUT Result, 238.8s OverallTime, 59 OverallIterations, 230 TraceHistogramMax, 185.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1016 SDtfs, 2623 SDslu, 8593 SDs, 0 SdLazy, 143074 SolverSat, 5926 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 116.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25283 GetRequests, 21640 SyntacticMatches, 0 SemanticMatches, 3643 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322177 ImplicationChecksByTransitivity, 65.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=889occurred in iteration=58, 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.9s AutomataMinimizationTime, 58 MinimizatonAttempts, 22390 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 12.1s SatisfiabilityAnalysisTime, 38.8s InterpolantComputationTime, 23015 NumberOfCodeBlocks, 23015 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 22956 ConstructedInterpolants, 0 QuantifiedInterpolants, 32785224 SizeOfPredicates, 20 NumberOfNonLiveVariables, 69163 ConjunctsInSsa, 7745 ConjunctsInUnsatCore, 59 InterpolantComputations, 1 PerfectInterpolantSequences, 1071703/1352585 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown