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/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:32:06,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:32:06,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:32:06,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:32:06,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:32:06,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:32:06,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:32:06,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:32:06,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:32:06,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:32:06,047 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:32:06,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:32:06,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:32:06,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:32:06,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:32:06,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:32:06,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:32:06,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:32:06,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:32:06,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:32:06,058 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:32:06,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:32:06,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:32:06,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:32:06,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:32:06,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:32:06,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:32:06,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:32:06,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:32:06,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:32:06,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:32:06,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:32:06,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:32:06,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:32:06,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:32:06,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:32:06,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:32:06,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:32:06,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:32:06,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:32:06,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:32:06,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:32:06,115 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:32:06,118 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:32:06,120 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:32:06,121 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:32:06,121 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl [2019-08-05 10:32:06,122 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl' [2019-08-05 10:32:06,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:32:06,153 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:32:06,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:32:06,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:32:06,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:32:06,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:32:06" (1/1) ... [2019-08-05 10:32:06,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:32:06" (1/1) ... [2019-08-05 10:32:06,185 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:32:06,185 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:32:06,185 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:32:06,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:32:06,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:32:06,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:32:06,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:32:06,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:32:06" (1/1) ... [2019-08-05 10:32:06,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:32:06" (1/1) ... [2019-08-05 10:32:06,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:32:06" (1/1) ... [2019-08-05 10:32:06,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:32:06" (1/1) ... [2019-08-05 10:32:06,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:32:06" (1/1) ... [2019-08-05 10:32:06,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:32:06" (1/1) ... [2019-08-05 10:32:06,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:32:06" (1/1) ... [2019-08-05 10:32:06,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:32:06,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:32:06,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:32:06,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:32:06,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:32:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:32:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2019-08-05 10:32:06,275 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2019-08-05 10:32:06,467 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:32:06,467 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:32:06,468 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:32:06 BoogieIcfgContainer [2019-08-05 10:32:06,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:32:06,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:32:06,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:32:06,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:32:06,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:32:06" (1/2) ... [2019-08-05 10:32:06,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f76c6d and model type DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:32:06, skipping insertion in model container [2019-08-05 10:32:06,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:32:06" (2/2) ... [2019-08-05 10:32:06,477 INFO L109 eAbstractionObserver]: Analyzing ICFG DivisibilityInterpolantRequired01-BackwardSuccess.bpl [2019-08-05 10:32:06,488 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:32:06,495 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:32:06,513 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:32:06,545 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:32:06,546 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:32:06,546 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:32:06,546 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:32:06,547 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:32:06,547 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:32:06,547 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:32:06,547 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:32:06,547 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:32:06,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2019-08-05 10:32:06,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:32:06,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:06,573 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:32:06,576 INFO L418 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:06,582 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2019-08-05 10:32:06,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:06,664 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:32:06,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:06,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:32:06,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:32:06,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:32:06,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:32:06,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:32:06,728 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2019-08-05 10:32:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:06,783 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:32:06,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:32:06,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:32:06,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:06,800 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:32:06,800 INFO L226 Difference]: Without dead ends: 4 [2019-08-05 10:32:06,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:32:06,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-08-05 10:32:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-08-05 10:32:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-08-05 10:32:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-08-05 10:32:06,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-08-05 10:32:06,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:06,833 INFO L475 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-08-05 10:32:06,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:32:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-08-05 10:32:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:32:06,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:06,834 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:32:06,834 INFO L418 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:06,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:06,835 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2019-08-05 10:32:06,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:06,843 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:32:06,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:07,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:07,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:32:07,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:32:07,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:32:07,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:32:07,053 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-08-05 10:32:07,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:07,100 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:32:07,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:32:07,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 10:32:07,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:07,101 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:32:07,101 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:32:07,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:32:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:32:07,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:32:07,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:32:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:32:07,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:32:07,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:07,104 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:32:07,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:32:07,105 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:32:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:32:07,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:07,105 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-08-05 10:32:07,106 INFO L418 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:07,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:07,106 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2019-08-05 10:32:07,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:07,114 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:32:07,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:07,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:07,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:32:07,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:32:07,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:32:07,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:32:07,230 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-05 10:32:07,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:07,317 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:32:07,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:32:07,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:32:07,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:07,319 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:32:07,319 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:32:07,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:32:07,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:32:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:32:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:32:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:32:07,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:32:07,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:07,322 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:32:07,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:32:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:32:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:32:07,323 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:07,323 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-08-05 10:32:07,323 INFO L418 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:07,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:07,324 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2019-08-05 10:32:07,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:07,333 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:32:07,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:07,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:07,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:07,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:32:07,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:32:07,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:32:07,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:32:07,413 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 10:32:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:07,457 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:32:07,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:32:07,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:32:07,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:07,459 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:32:07,459 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:32:07,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:32:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:32:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:32:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:32:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:32:07,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:32:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:07,462 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:32:07,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:32:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:32:07,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:32:07,474 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:07,474 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1] [2019-08-05 10:32:07,476 INFO L418 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:07,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:07,477 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2019-08-05 10:32:07,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:07,487 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:32:07,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:07,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:07,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:32:07,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:32:07,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:32:07,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:32:07,667 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-05 10:32:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:07,832 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:32:07,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:32:07,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:32:07,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:07,833 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:32:07,833 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:32:07,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:32:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:32:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:32:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:32:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:32:07,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:32:07,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:07,837 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:32:07,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:32:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:32:07,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:32:07,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:07,838 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1] [2019-08-05 10:32:07,838 INFO L418 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:07,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:07,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2019-08-05 10:32:07,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:07,850 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:32:07,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:07,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:07,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:32:07,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:32:07,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:32:07,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:32:07,938 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-05 10:32:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:08,140 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:32:08,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:32:08,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:32:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:08,141 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:32:08,141 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:32:08,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:32:08,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:32:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:32:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:32:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:32:08,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:32:08,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:08,145 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:32:08,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:32:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:32:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:32:08,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:08,146 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1] [2019-08-05 10:32:08,146 INFO L418 AbstractCegarLoop]: === Iteration 7 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:08,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:08,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2019-08-05 10:32:08,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:08,157 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:32:08,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:08,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:08,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:32:08,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:32:08,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:32:08,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:32:08,265 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-05 10:32:08,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:08,338 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:32:08,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:32:08,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:32:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:08,340 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:32:08,340 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:32:08,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:32:08,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:32:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:32:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:32:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:32:08,343 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:32:08,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:08,344 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:32:08,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:32:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:32:08,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:32:08,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:08,344 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1] [2019-08-05 10:32:08,345 INFO L418 AbstractCegarLoop]: === Iteration 8 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:08,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:08,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2019-08-05 10:32:08,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:08,359 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:32:08,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:08,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:08,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:32:08,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:32:08,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:32:08,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:32:08,719 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-05 10:32:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:08,816 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:32:08,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:32:08,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:32:08,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:08,817 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:32:08,818 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:32:08,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:32:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:32:08,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:32:08,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:32:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:32:08,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:32:08,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:08,822 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:32:08,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:32:08,822 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:32:08,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:32:08,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:08,823 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1] [2019-08-05 10:32:08,823 INFO L418 AbstractCegarLoop]: === Iteration 9 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:08,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:08,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2019-08-05 10:32:08,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:08,834 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:32:08,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:09,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:09,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:32:09,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:32:09,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:32:09,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:32:09,002 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-08-05 10:32:09,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:09,109 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:32:09,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:32:09,111 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:32:09,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:09,112 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:32:09,112 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:32:09,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:32:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:32:09,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:32:09,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:32:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:32:09,115 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:32:09,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:09,115 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:32:09,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:32:09,116 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:32:09,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:32:09,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:09,116 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1] [2019-08-05 10:32:09,117 INFO L418 AbstractCegarLoop]: === Iteration 10 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:09,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:09,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2019-08-05 10:32:09,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:09,130 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:32:09,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:09,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:09,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:32:09,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:32:09,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:32:09,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:32:09,301 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-08-05 10:32:09,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:09,488 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:32:09,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:32:09,488 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:32:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:09,489 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:32:09,489 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:32:09,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:32:09,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:32:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:32:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:32:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:32:09,491 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:32:09,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:09,492 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:32:09,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:32:09,492 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:32:09,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:32:09,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:09,498 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1] [2019-08-05 10:32:09,499 INFO L418 AbstractCegarLoop]: === Iteration 11 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:09,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:09,499 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2019-08-05 10:32:09,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:09,512 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:32:09,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:09,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:09,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:32:09,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:32:09,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:32:09,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:32:09,680 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-08-05 10:32:09,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:09,823 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:32:09,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:32:09,824 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:32:09,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:09,824 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:32:09,825 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:32:09,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:32:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:32:09,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:32:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:32:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:32:09,828 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:32:09,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:09,829 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:32:09,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:32:09,829 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:32:09,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:32:09,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:09,829 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1] [2019-08-05 10:32:09,829 INFO L418 AbstractCegarLoop]: === Iteration 12 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:09,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:09,830 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2019-08-05 10:32:09,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:09,841 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:32:09,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:09,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:09,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:32:09,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:32:09,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:32:09,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:32:09,987 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-08-05 10:32:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:10,121 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:32:10,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:32:10,121 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:32:10,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:10,122 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:32:10,123 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:32:10,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:32:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:32:10,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:32:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:32:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:32:10,125 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:32:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:10,125 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:32:10,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:32:10,126 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:32:10,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:32:10,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:10,126 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1] [2019-08-05 10:32:10,127 INFO L418 AbstractCegarLoop]: === Iteration 13 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:10,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:10,127 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2019-08-05 10:32:10,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:10,139 WARN L254 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:32:10,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:10,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:10,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:32:10,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:32:10,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:32:10,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:32:10,321 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2019-08-05 10:32:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:10,475 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:32:10,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:32:10,475 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:32:10,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:10,476 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:32:10,477 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:32:10,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:32:10,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:32:10,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:32:10,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:32:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:32:10,480 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:32:10,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:10,481 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:32:10,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:32:10,481 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:32:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:32:10,482 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:10,482 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1] [2019-08-05 10:32:10,482 INFO L418 AbstractCegarLoop]: === Iteration 14 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:10,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:10,482 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2019-08-05 10:32:10,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:10,494 WARN L254 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:32:10,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:10,646 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:10,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:10,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:32:10,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:32:10,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:32:10,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:32:10,649 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2019-08-05 10:32:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:10,887 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:32:10,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:32:10,888 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:32:10,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:10,888 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:32:10,889 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:32:10,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:32:10,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:32:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:32:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:32:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:32:10,893 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:32:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:10,894 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:32:10,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:32:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:32:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:32:10,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:10,894 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1] [2019-08-05 10:32:10,895 INFO L418 AbstractCegarLoop]: === Iteration 15 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:10,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:10,895 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2019-08-05 10:32:10,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:10,908 WARN L254 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:32:10,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:11,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:11,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:32:11,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:32:11,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:32:11,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:32:11,078 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2019-08-05 10:32:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:11,250 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:32:11,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:32:11,251 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:32:11,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:11,252 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:32:11,252 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:32:11,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:32:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:32:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:32:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:32:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:32:11,256 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:32:11,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:11,257 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:32:11,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:32:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:32:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:32:11,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:11,258 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1] [2019-08-05 10:32:11,258 INFO L418 AbstractCegarLoop]: === Iteration 16 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:11,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:11,258 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2019-08-05 10:32:11,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:11,273 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:32:11,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:11,470 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:11,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:11,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:32:11,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:32:11,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:32:11,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:32:11,472 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2019-08-05 10:32:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:12,087 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:32:12,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:32:12,088 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:32:12,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:12,089 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:32:12,089 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:32:12,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:32:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:32:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:32:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:32:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:32:12,092 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:32:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:12,093 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:32:12,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:32:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:32:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:32:12,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:12,094 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1] [2019-08-05 10:32:12,094 INFO L418 AbstractCegarLoop]: === Iteration 17 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:12,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:12,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2019-08-05 10:32:12,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:12,106 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:32:12,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:12,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:12,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:32:12,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:32:12,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:32:12,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:12,796 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2019-08-05 10:32:13,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:13,012 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:32:13,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:32:13,013 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:32:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:13,013 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:32:13,013 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:32:13,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:13,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:32:13,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:32:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:32:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:32:13,016 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:32:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:13,017 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:32:13,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:32:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:32:13,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:32:13,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:13,017 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1] [2019-08-05 10:32:13,017 INFO L418 AbstractCegarLoop]: === Iteration 18 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:13,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:13,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2019-08-05 10:32:13,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:13,029 WARN L254 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:32:13,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:13,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:13,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:32:13,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:32:13,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:32:13,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:13,358 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2019-08-05 10:32:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:13,678 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:32:13,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:32:13,678 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:32:13,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:13,679 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:32:13,679 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:32:13,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:32:13,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:32:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:32:13,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:32:13,684 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:32:13,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:13,684 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:32:13,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:32:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:32:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:32:13,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:13,685 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1] [2019-08-05 10:32:13,685 INFO L418 AbstractCegarLoop]: === Iteration 19 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:13,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:13,686 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2019-08-05 10:32:13,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:13,697 WARN L254 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:32:13,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:13,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:13,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:32:13,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:32:13,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:32:13,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:32:13,911 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2019-08-05 10:32:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:14,187 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:32:14,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:32:14,194 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:32:14,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:14,195 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:32:14,195 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:32:14,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:32:14,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:32:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:32:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:32:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:32:14,198 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:32:14,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:14,198 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:32:14,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:32:14,198 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:32:14,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:32:14,199 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:14,199 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1] [2019-08-05 10:32:14,199 INFO L418 AbstractCegarLoop]: === Iteration 20 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:14,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:14,200 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2019-08-05 10:32:14,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:14,211 WARN L254 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:32:14,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:14,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:14,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:32:14,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:32:14,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:32:14,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:32:14,638 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2019-08-05 10:32:14,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:14,911 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:32:14,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:32:14,912 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:32:14,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:14,913 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:32:14,913 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:32:14,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:32:14,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:32:14,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:32:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:32:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:32:14,917 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:32:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:14,918 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:32:14,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:32:14,918 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:32:14,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:32:14,918 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:14,919 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1] [2019-08-05 10:32:14,919 INFO L418 AbstractCegarLoop]: === Iteration 21 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:14,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:14,919 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2019-08-05 10:32:14,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:14,930 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:32:14,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:15,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:15,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:32:15,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:32:15,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:32:15,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:32:15,202 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2019-08-05 10:32:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:15,535 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:32:15,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:32:15,536 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:32:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:15,536 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:32:15,537 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:32:15,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:32:15,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:32:15,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:32:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:32:15,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:32:15,541 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:32:15,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:15,541 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:32:15,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:32:15,541 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:32:15,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:32:15,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:15,542 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1] [2019-08-05 10:32:15,542 INFO L418 AbstractCegarLoop]: === Iteration 22 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:15,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:15,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2019-08-05 10:32:15,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:15,554 WARN L254 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:32:15,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:15,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:15,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:32:15,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:32:15,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:32:15,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:32:15,844 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2019-08-05 10:32:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:16,185 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:32:16,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:32:16,187 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:32:16,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:16,188 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:32:16,188 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:32:16,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:32:16,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:32:16,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:32:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:32:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:32:16,191 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:32:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:16,191 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:32:16,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:32:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:32:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:32:16,192 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:16,192 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1] [2019-08-05 10:32:16,192 INFO L418 AbstractCegarLoop]: === Iteration 23 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:16,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:16,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2019-08-05 10:32:16,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:16,202 WARN L254 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:32:16,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:16,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:16,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:32:16,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:32:16,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:32:16,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:32:16,468 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2019-08-05 10:32:16,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:16,910 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:32:16,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:32:16,910 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:32:16,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:16,911 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:32:16,911 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:32:16,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:32:16,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:32:16,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:32:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:32:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:32:16,915 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:32:16,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:16,916 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:32:16,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:32:16,916 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:32:16,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:32:16,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:16,916 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1] [2019-08-05 10:32:16,917 INFO L418 AbstractCegarLoop]: === Iteration 24 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:16,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:16,917 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2019-08-05 10:32:16,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:16,927 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:32:16,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:17,200 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:17,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:17,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:32:17,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:32:17,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:32:17,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:32:17,202 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2019-08-05 10:32:18,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:18,134 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:32:18,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:32:18,134 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:32:18,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:18,135 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:32:18,135 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:32:18,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:32:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:32:18,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:32:18,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:32:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:32:18,139 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:32:18,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:18,139 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:32:18,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:32:18,139 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:32:18,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:32:18,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:18,140 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1] [2019-08-05 10:32:18,140 INFO L418 AbstractCegarLoop]: === Iteration 25 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:18,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:18,140 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2019-08-05 10:32:18,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:18,149 WARN L254 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:32:18,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:18,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:18,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:32:18,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:32:18,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:32:18,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:32:18,474 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2019-08-05 10:32:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:18,974 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:32:18,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:32:18,974 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 10:32:18,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:18,975 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:32:18,975 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:32:18,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:32:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:32:18,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:32:18,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:32:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:32:18,980 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:32:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:18,980 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:32:18,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:32:18,980 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:32:18,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:32:18,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:18,981 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1] [2019-08-05 10:32:18,981 INFO L418 AbstractCegarLoop]: === Iteration 26 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:18,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:18,981 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2019-08-05 10:32:18,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:18,990 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:32:18,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:19,307 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:19,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:19,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:32:19,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:32:19,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:32:19,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:32:19,309 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2019-08-05 10:32:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:19,851 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:32:19,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:32:19,852 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-08-05 10:32:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:19,852 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:32:19,852 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:32:19,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:32:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:32:19,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:32:19,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:32:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:32:19,856 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:32:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:19,856 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:32:19,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:32:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:32:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:32:19,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:19,858 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1] [2019-08-05 10:32:19,858 INFO L418 AbstractCegarLoop]: === Iteration 27 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:19,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:19,858 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2019-08-05 10:32:19,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:19,868 WARN L254 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:32:19,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:20,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:20,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:32:20,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:32:20,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:32:20,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:32:20,266 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2019-08-05 10:32:20,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:20,755 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:32:20,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:32:20,755 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-08-05 10:32:20,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:20,756 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:32:20,756 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:32:20,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:32:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:32:20,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:32:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:32:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:32:20,760 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:32:20,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:20,760 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:32:20,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:32:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:32:20,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:32:20,761 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:20,761 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1] [2019-08-05 10:32:20,761 INFO L418 AbstractCegarLoop]: === Iteration 28 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:20,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:20,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2019-08-05 10:32:20,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:20,771 WARN L254 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:32:20,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:21,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:21,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:32:21,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:32:21,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:32:21,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:32:21,143 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2019-08-05 10:32:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:21,644 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:32:21,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:32:21,645 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-08-05 10:32:21,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:21,646 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:32:21,646 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:32:21,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:32:21,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:32:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:32:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:32:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:32:21,650 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:32:21,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:21,650 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:32:21,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:32:21,650 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:32:21,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:32:21,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:21,651 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1] [2019-08-05 10:32:21,651 INFO L418 AbstractCegarLoop]: === Iteration 29 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:21,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:21,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2019-08-05 10:32:21,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:21,660 WARN L254 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:32:21,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:22,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:22,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:32:22,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:32:22,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:32:22,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:32:22,048 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2019-08-05 10:32:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:22,767 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:32:22,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:32:22,768 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-05 10:32:22,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:22,768 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:32:22,768 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:32:22,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:32:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:32:22,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:32:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:32:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:32:22,779 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:32:22,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:22,780 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:32:22,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:32:22,780 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:32:22,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:32:22,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:22,781 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1] [2019-08-05 10:32:22,781 INFO L418 AbstractCegarLoop]: === Iteration 30 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:22,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:22,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2019-08-05 10:32:22,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:22,791 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:32:22,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:23,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:23,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:32:23,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:32:23,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:32:23,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:32:23,238 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2019-08-05 10:32:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:23,862 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:32:23,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:32:23,863 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-08-05 10:32:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:23,863 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:32:23,863 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:32:23,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:32:23,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:32:23,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:32:23,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:32:23,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:32:23,867 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:32:23,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:23,868 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:32:23,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:32:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:32:23,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:32:23,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:23,868 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1] [2019-08-05 10:32:23,869 INFO L418 AbstractCegarLoop]: === Iteration 31 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:23,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:23,869 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2019-08-05 10:32:23,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:23,882 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:32:23,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:24,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:24,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:32:24,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:32:24,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:32:24,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:32:24,378 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2019-08-05 10:32:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:24,987 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:32:24,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:32:24,987 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2019-08-05 10:32:24,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:24,988 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:32:24,988 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:32:24,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:32:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:32:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:32:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:32:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:32:24,992 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:32:24,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:24,992 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:32:24,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:32:24,993 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:32:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:32:24,993 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:24,993 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1] [2019-08-05 10:32:24,994 INFO L418 AbstractCegarLoop]: === Iteration 32 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:24,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:24,994 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2019-08-05 10:32:24,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:25,003 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:32:25,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:25,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:25,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:32:25,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:32:25,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:32:25,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:32:25,497 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2019-08-05 10:32:26,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:26,143 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:32:26,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:32:26,143 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2019-08-05 10:32:26,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:26,144 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:32:26,144 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:32:26,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:32:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:32:26,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:32:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:32:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:32:26,148 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:32:26,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:26,148 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:32:26,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:32:26,148 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:32:26,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:32:26,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:26,149 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1] [2019-08-05 10:32:26,149 INFO L418 AbstractCegarLoop]: === Iteration 33 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:26,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:26,149 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2019-08-05 10:32:26,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:26,159 WARN L254 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:32:26,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:26,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:26,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:32:26,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:32:26,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:32:26,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:32:26,647 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2019-08-05 10:32:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:27,330 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:32:27,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:32:27,330 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-08-05 10:32:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:27,331 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:32:27,331 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:32:27,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:32:27,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:32:27,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:32:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:32:27,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:32:27,335 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:32:27,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:27,335 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:32:27,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:32:27,335 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:32:27,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:32:27,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:27,336 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1] [2019-08-05 10:32:27,336 INFO L418 AbstractCegarLoop]: === Iteration 34 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:27,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:27,336 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2019-08-05 10:32:27,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:27,346 WARN L254 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:32:27,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:28,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:28,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:32:28,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:32:28,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:32:28,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:32:28,340 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2019-08-05 10:32:29,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:29,063 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:32:29,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:32:29,063 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-08-05 10:32:29,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:29,064 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:32:29,064 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:32:29,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:32:29,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:32:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:32:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:32:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:32:29,067 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:32:29,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:29,068 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:32:29,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:32:29,068 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:32:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:32:29,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:29,069 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1] [2019-08-05 10:32:29,069 INFO L418 AbstractCegarLoop]: === Iteration 35 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:29,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:29,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2019-08-05 10:32:29,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:29,078 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:32:29,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:29,700 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:29,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:29,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:32:29,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:32:29,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:32:29,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:32:29,701 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2019-08-05 10:32:30,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:30,471 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:32:30,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:32:30,471 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-08-05 10:32:30,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:30,472 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:32:30,472 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:32:30,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:32:30,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:32:30,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:32:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:32:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:32:30,475 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:32:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:30,475 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:32:30,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:32:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:32:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:32:30,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:30,476 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1] [2019-08-05 10:32:30,476 INFO L418 AbstractCegarLoop]: === Iteration 36 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:30,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:30,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2019-08-05 10:32:30,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:30,487 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:32:30,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:31,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:31,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:32:31,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:32:31,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:32:31,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:32:31,859 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2019-08-05 10:32:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:32,755 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:32:32,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:32:32,756 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-08-05 10:32:32,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:32,756 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:32:32,756 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:32:32,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:32:32,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:32:32,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:32:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:32:32,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:32:32,759 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:32:32,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:32,759 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:32:32,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:32:32,759 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:32:32,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:32:32,759 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:32,760 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1] [2019-08-05 10:32:32,760 INFO L418 AbstractCegarLoop]: === Iteration 37 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:32,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:32,760 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2019-08-05 10:32:32,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:32,771 WARN L254 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:32:32,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:34,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:34,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:32:34,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:32:34,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:32:34,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:32:34,230 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2019-08-05 10:32:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:35,093 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:32:35,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:32:35,093 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-05 10:32:35,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:35,094 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:32:35,094 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:32:35,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:32:35,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:32:35,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:32:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:32:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:32:35,098 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:32:35,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:35,098 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:32:35,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:32:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:32:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:32:35,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:35,099 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1] [2019-08-05 10:32:35,099 INFO L418 AbstractCegarLoop]: === Iteration 38 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:35,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:35,099 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2019-08-05 10:32:35,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:35,110 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:32:35,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:35,697 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:35,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:35,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:32:35,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:32:35,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:32:35,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:32:35,699 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2019-08-05 10:32:36,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:36,598 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:32:36,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:32:36,599 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-08-05 10:32:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:36,600 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:32:36,600 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:32:36,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:32:36,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:32:36,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:32:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:32:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:32:36,603 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:32:36,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:36,603 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:32:36,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:32:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:32:36,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:32:36,604 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:36,604 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1] [2019-08-05 10:32:36,604 INFO L418 AbstractCegarLoop]: === Iteration 39 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:36,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:36,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2019-08-05 10:32:36,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:36,615 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:32:36,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:37,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:37,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:32:37,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:32:37,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:32:37,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:32:37,300 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2019-08-05 10:32:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:38,465 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:32:38,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:32:38,466 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-08-05 10:32:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:38,466 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:32:38,466 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:32:38,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:32:38,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:32:38,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:32:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:32:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:32:38,469 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:32:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:38,470 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:32:38,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:32:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:32:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:32:38,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:38,471 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1] [2019-08-05 10:32:38,471 INFO L418 AbstractCegarLoop]: === Iteration 40 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:38,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:38,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2019-08-05 10:32:38,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:38,481 WARN L254 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:32:38,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:39,165 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:39,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:39,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:32:39,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:32:39,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:32:39,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:32:39,167 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2019-08-05 10:32:40,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:40,149 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:32:40,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:32:40,150 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-08-05 10:32:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:40,151 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:32:40,151 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:32:40,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:32:40,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:32:40,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:32:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:32:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:32:40,154 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:32:40,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:40,155 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:32:40,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:32:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:32:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:32:40,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:40,156 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1] [2019-08-05 10:32:40,156 INFO L418 AbstractCegarLoop]: === Iteration 41 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:40,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:40,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2019-08-05 10:32:40,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:40,168 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:32:40,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:40,839 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:40,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:40,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:32:40,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:32:40,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:32:40,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:32:40,841 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2019-08-05 10:32:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:41,918 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:32:41,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:32:41,918 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2019-08-05 10:32:41,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:41,919 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:32:41,919 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:32:41,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:32:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:32:41,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:32:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:32:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:32:41,922 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:32:41,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:41,923 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:32:41,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:32:41,923 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:32:41,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:32:41,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:41,923 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1] [2019-08-05 10:32:41,924 INFO L418 AbstractCegarLoop]: === Iteration 42 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:41,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:41,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2019-08-05 10:32:41,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:41,935 WARN L254 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:32:41,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:42,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:42,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:32:42,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:32:42,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:32:42,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:32:42,743 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2019-08-05 10:32:44,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:44,047 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:32:44,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:32:44,047 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-08-05 10:32:44,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:44,048 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:32:44,048 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:32:44,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:32:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:32:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:32:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:32:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:32:44,051 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:32:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:44,051 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:32:44,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:32:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:32:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:32:44,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:44,052 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1] [2019-08-05 10:32:44,053 INFO L418 AbstractCegarLoop]: === Iteration 43 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:44,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:44,053 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2019-08-05 10:32:44,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:44,062 WARN L254 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:32:44,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:44,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:44,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:32:44,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:32:44,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:32:44,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:32:44,804 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2019-08-05 10:32:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:45,943 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:32:45,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:32:45,943 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2019-08-05 10:32:45,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:45,944 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:32:45,944 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:32:45,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:32:45,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:32:45,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:32:45,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:32:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:32:45,948 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:32:45,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:45,949 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:32:45,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:32:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:32:45,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:32:45,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:45,949 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1] [2019-08-05 10:32:45,950 INFO L418 AbstractCegarLoop]: === Iteration 44 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:45,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:45,950 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2019-08-05 10:32:45,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:45,961 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:32:45,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:46,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:46,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:32:46,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:32:46,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:32:46,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:32:46,729 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2019-08-05 10:32:47,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:47,906 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:32:47,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:32:47,907 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2019-08-05 10:32:47,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:47,907 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:32:47,908 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:32:47,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:32:47,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:32:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:32:47,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:32:47,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:32:47,910 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:32:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:47,910 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:32:47,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:32:47,911 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:32:47,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:32:47,911 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:47,912 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1] [2019-08-05 10:32:47,912 INFO L418 AbstractCegarLoop]: === Iteration 45 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:47,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:47,912 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2019-08-05 10:32:47,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:47,923 WARN L254 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:32:47,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:49,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:49,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:32:49,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:32:49,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:32:49,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:32:49,025 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2019-08-05 10:32:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:50,264 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:32:50,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:32:50,265 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2019-08-05 10:32:50,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:50,266 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:32:50,266 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:32:50,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:32:50,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:32:50,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:32:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:32:50,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:32:50,268 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:32:50,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:50,269 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:32:50,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:32:50,269 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:32:50,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:32:50,269 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:50,270 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1] [2019-08-05 10:32:50,270 INFO L418 AbstractCegarLoop]: === Iteration 46 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:50,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:50,270 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2019-08-05 10:32:50,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:50,282 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:32:50,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:51,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:51,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:32:51,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:32:51,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:32:51,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:32:51,188 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2019-08-05 10:32:52,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:52,523 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:32:52,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:32:52,523 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2019-08-05 10:32:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:52,524 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:32:52,524 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:32:52,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:32:52,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:32:52,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:32:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:32:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:32:52,527 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:32:52,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:52,527 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:32:52,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:32:52,528 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:32:52,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:32:52,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:52,528 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1] [2019-08-05 10:32:52,529 INFO L418 AbstractCegarLoop]: === Iteration 47 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:52,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:52,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2019-08-05 10:32:52,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:52,541 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:32:52,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:53,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:53,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:32:53,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:32:53,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:32:53,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:32:53,866 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2019-08-05 10:32:55,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:55,282 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:32:55,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:32:55,283 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-08-05 10:32:55,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:55,284 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:32:55,284 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:32:55,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:32:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:32:55,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:32:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:32:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:32:55,287 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:32:55,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:55,287 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:32:55,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:32:55,287 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:32:55,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:32:55,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:55,287 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1] [2019-08-05 10:32:55,288 INFO L418 AbstractCegarLoop]: === Iteration 48 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:55,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:55,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2019-08-05 10:32:55,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:55,300 WARN L254 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:32:55,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:56,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:56,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:32:56,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:32:56,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:32:56,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:32:56,198 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2019-08-05 10:32:57,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:57,651 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:32:57,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:32:57,652 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2019-08-05 10:32:57,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:57,653 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:32:57,653 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:32:57,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:32:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:32:57,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:32:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:32:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:32:57,656 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:32:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:57,657 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:32:57,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:32:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:32:57,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:32:57,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:57,657 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1] [2019-08-05 10:32:57,658 INFO L418 AbstractCegarLoop]: === Iteration 49 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:57,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:57,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2019-08-05 10:32:57,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:57,671 WARN L254 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:32:57,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:58,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:58,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:58,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:32:58,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:32:58,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:32:58,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:32:58,973 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2019-08-05 10:33:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:00,470 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:33:00,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:33:00,470 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2019-08-05 10:33:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:00,471 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:33:00,471 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:33:00,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:33:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:33:00,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:33:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:33:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:33:00,474 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:33:00,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:00,475 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:33:00,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:33:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:33:00,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:33:00,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:00,475 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1] [2019-08-05 10:33:00,476 INFO L418 AbstractCegarLoop]: === Iteration 50 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:00,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:00,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2019-08-05 10:33:00,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:00,488 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:33:00,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:01,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:01,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:33:01,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:33:01,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:33:01,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:33:01,493 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2019-08-05 10:33:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:03,048 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:33:03,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:33:03,048 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-08-05 10:33:03,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:03,049 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:33:03,049 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:33:03,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:33:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:33:03,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:33:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:33:03,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:33:03,052 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:33:03,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:03,053 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:33:03,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:33:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:33:03,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:33:03,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:03,053 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1] [2019-08-05 10:33:03,053 INFO L418 AbstractCegarLoop]: === Iteration 51 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:03,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:03,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2019-08-05 10:33:03,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:03,067 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:33:03,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:04,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:04,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:04,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:33:04,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:33:04,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:33:04,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:33:04,415 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2019-08-05 10:33:06,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:06,060 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:33:06,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:33:06,060 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-08-05 10:33:06,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:06,062 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:33:06,062 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:33:06,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:33:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:33:06,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:33:06,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:33:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:33:06,064 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:33:06,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:06,064 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:33:06,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:33:06,065 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:33:06,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:33:06,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:06,065 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1] [2019-08-05 10:33:06,065 INFO L418 AbstractCegarLoop]: === Iteration 52 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:06,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:06,066 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2019-08-05 10:33:06,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:06,080 WARN L254 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:33:06,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:07,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:07,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:33:07,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:33:07,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:33:07,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:33:07,202 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2019-08-05 10:33:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:09,139 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:33:09,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:33:09,140 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2019-08-05 10:33:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:09,140 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:33:09,140 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:33:09,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:33:09,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:33:09,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:33:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:33:09,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:33:09,143 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:33:09,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:09,143 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:33:09,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:33:09,143 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:33:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:33:09,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:09,143 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1] [2019-08-05 10:33:09,144 INFO L418 AbstractCegarLoop]: === Iteration 53 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:09,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:09,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2019-08-05 10:33:09,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:09,157 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:33:09,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:10,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:10,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:33:10,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:33:10,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:33:10,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:33:10,247 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2019-08-05 10:33:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:12,006 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:33:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:33:12,008 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2019-08-05 10:33:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:12,008 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:33:12,009 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:33:12,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:33:12,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:33:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:33:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:33:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:33:12,012 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:33:12,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:12,012 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:33:12,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:33:12,012 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:33:12,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:33:12,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:12,013 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1] [2019-08-05 10:33:12,013 INFO L418 AbstractCegarLoop]: === Iteration 54 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:12,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:12,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2019-08-05 10:33:12,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:12,028 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:33:12,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:13,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:13,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:33:13,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:33:13,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:33:13,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:33:13,144 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2019-08-05 10:33:15,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:15,137 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:33:15,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:33:15,138 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-08-05 10:33:15,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:15,139 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:33:15,139 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:33:15,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:33:15,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:33:15,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:33:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:33:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:33:15,142 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:33:15,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:15,142 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:33:15,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:33:15,143 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:33:15,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:33:15,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:15,143 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1] [2019-08-05 10:33:15,144 INFO L418 AbstractCegarLoop]: === Iteration 55 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:15,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:15,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2019-08-05 10:33:15,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:15,158 WARN L254 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:33:15,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:16,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:16,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:33:16,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:33:16,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:33:16,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:33:16,304 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2019-08-05 10:33:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:18,168 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:33:18,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:33:18,169 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-08-05 10:33:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:18,170 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:33:18,170 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:33:18,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:33:18,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:33:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:33:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:33:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:33:18,173 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:33:18,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:18,174 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:33:18,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:33:18,174 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:33:18,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:33:18,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:18,174 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1] [2019-08-05 10:33:18,175 INFO L418 AbstractCegarLoop]: === Iteration 56 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:18,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:18,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2019-08-05 10:33:18,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:18,189 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:33:18,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:19,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:19,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:33:19,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:33:19,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:33:19,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:33:19,742 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2019-08-05 10:33:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:21,667 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:33:21,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:33:21,668 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2019-08-05 10:33:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:21,669 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:33:21,669 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:33:21,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:33:21,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:33:21,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:33:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:33:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:33:21,671 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:33:21,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:21,671 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:33:21,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:33:21,671 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:33:21,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:33:21,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:21,672 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1] [2019-08-05 10:33:21,672 INFO L418 AbstractCegarLoop]: === Iteration 57 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:21,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:21,672 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2019-08-05 10:33:21,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:21,696 WARN L254 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:33:21,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:23,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:23,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:33:23,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:33:23,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:33:23,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:33:23,007 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2019-08-05 10:33:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:25,229 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:33:25,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:33:25,230 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2019-08-05 10:33:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:25,230 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:33:25,231 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:33:25,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:33:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:33:25,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:33:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:33:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:33:25,234 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:33:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:25,234 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:33:25,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:33:25,234 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:33:25,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:33:25,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:25,235 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1] [2019-08-05 10:33:25,235 INFO L418 AbstractCegarLoop]: === Iteration 58 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:25,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:25,236 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2019-08-05 10:33:25,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:25,251 WARN L254 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:33:25,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:26,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:26,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:26,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:33:26,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:33:26,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:33:26,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:33:26,518 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2019-08-05 10:33:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:28,609 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:33:28,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:33:28,609 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2019-08-05 10:33:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:28,610 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:33:28,610 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:33:28,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:33:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:33:28,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:33:28,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:33:28,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:33:28,613 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:33:28,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:28,613 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:33:28,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:33:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:33:28,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:33:28,613 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:28,613 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1] [2019-08-05 10:33:28,613 INFO L418 AbstractCegarLoop]: === Iteration 59 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:28,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:28,614 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2019-08-05 10:33:28,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:28,629 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:33:28,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:30,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:30,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:30,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:33:30,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:33:30,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:33:30,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:33:30,072 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2019-08-05 10:33:32,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:32,206 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:33:32,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:33:32,206 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2019-08-05 10:33:32,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:32,207 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:33:32,207 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:33:32,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:33:32,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:33:32,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:33:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:33:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:33:32,210 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:33:32,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:32,210 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:33:32,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:33:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:33:32,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:33:32,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:32,211 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1] [2019-08-05 10:33:32,211 INFO L418 AbstractCegarLoop]: === Iteration 60 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:32,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:32,211 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2019-08-05 10:33:32,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:32,228 WARN L254 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 10:33:32,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:33,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:33,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:33:33,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:33:33,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:33:33,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:33:33,641 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2019-08-05 10:33:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:35,982 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:33:35,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:33:35,983 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2019-08-05 10:33:35,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:35,983 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:33:35,984 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:33:35,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:33:35,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:33:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:33:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:33:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:33:35,987 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:33:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:35,987 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:33:35,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:33:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:33:35,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:33:35,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:35,988 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1] [2019-08-05 10:33:35,988 INFO L418 AbstractCegarLoop]: === Iteration 61 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:35,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:35,988 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2019-08-05 10:33:35,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:36,005 WARN L254 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 10:33:36,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:37,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:37,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:33:37,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:33:37,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:33:37,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:33:37,506 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2019-08-05 10:33:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:39,959 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:33:39,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:33:39,959 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2019-08-05 10:33:39,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:39,960 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:33:39,960 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:33:39,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:33:39,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:33:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:33:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:33:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:33:39,963 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:33:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:39,963 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:33:39,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:33:39,963 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:33:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:33:39,964 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:39,964 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1] [2019-08-05 10:33:39,964 INFO L418 AbstractCegarLoop]: === Iteration 62 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:39,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:39,964 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2019-08-05 10:33:39,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:39,982 WARN L254 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 10:33:39,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:41,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:41,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:33:41,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:33:41,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:33:41,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:33:41,469 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2019-08-05 10:33:43,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:43,879 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:33:43,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:33:43,879 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2019-08-05 10:33:43,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:43,880 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:33:43,880 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:33:43,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:33:43,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:33:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:33:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:33:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:33:43,883 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:33:43,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:43,883 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:33:43,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:33:43,884 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:33:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:33:43,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:43,884 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1] [2019-08-05 10:33:43,885 INFO L418 AbstractCegarLoop]: === Iteration 63 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:43,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:43,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2019-08-05 10:33:43,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:43,903 WARN L254 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 127 conjunts are in the unsatisfiable core [2019-08-05 10:33:43,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:45,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:45,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:33:45,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:33:45,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:33:45,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:33:45,650 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2019-08-05 10:33:48,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:48,150 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:33:48,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:33:48,151 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2019-08-05 10:33:48,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:48,152 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:33:48,152 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:33:48,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:33:48,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:33:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:33:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:33:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:33:48,155 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:33:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:48,155 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:33:48,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:33:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:33:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:33:48,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:48,156 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1] [2019-08-05 10:33:48,156 INFO L418 AbstractCegarLoop]: === Iteration 64 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:48,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2019-08-05 10:33:48,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:48,176 WARN L254 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 10:33:48,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:50,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:50,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:33:50,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:33:50,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:33:50,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:33:50,573 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2019-08-05 10:33:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:53,128 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:33:53,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:33:53,128 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2019-08-05 10:33:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:53,129 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:33:53,129 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:33:53,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:33:53,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:33:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:33:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:33:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:33:53,133 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:33:53,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:53,133 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:33:53,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:33:53,133 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:33:53,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:33:53,134 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:53,134 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1] [2019-08-05 10:33:53,134 INFO L418 AbstractCegarLoop]: === Iteration 65 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:53,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:53,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2019-08-05 10:33:53,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:53,152 WARN L254 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 131 conjunts are in the unsatisfiable core [2019-08-05 10:33:53,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:55,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:55,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:33:55,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:33:55,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:33:55,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:33:55,036 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2019-08-05 10:33:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:57,637 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:33:57,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:33:57,638 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2019-08-05 10:33:57,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:57,639 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:33:57,639 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:33:57,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:33:57,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:33:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:33:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:33:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:33:57,642 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:33:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:57,642 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:33:57,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:33:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:33:57,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:33:57,643 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:57,643 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1] [2019-08-05 10:33:57,643 INFO L418 AbstractCegarLoop]: === Iteration 66 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:57,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:57,643 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2019-08-05 10:33:57,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:57,663 WARN L254 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 10:33:57,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:59,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:59,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:33:59,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:33:59,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:33:59,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:33:59,316 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2019-08-05 10:34:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:02,193 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:34:02,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:34:02,193 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2019-08-05 10:34:02,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:02,194 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:34:02,194 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:34:02,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:34:02,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:34:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:34:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:34:02,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:34:02,197 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:34:02,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:02,197 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:34:02,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:34:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:34:02,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:34:02,198 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:02,198 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1] [2019-08-05 10:34:02,198 INFO L418 AbstractCegarLoop]: === Iteration 67 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:02,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:02,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2019-08-05 10:34:02,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:02,215 WARN L254 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-05 10:34:02,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:03,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:03,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:34:03,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:34:03,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:34:03,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:34:03,955 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2019-08-05 10:34:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:06,909 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:34:06,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:34:06,909 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2019-08-05 10:34:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:06,910 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:34:06,910 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:34:06,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:34:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:34:06,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:34:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:34:06,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:34:06,912 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:34:06,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:06,913 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:34:06,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:34:06,913 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:34:06,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:34:06,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:06,914 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1] [2019-08-05 10:34:06,914 INFO L418 AbstractCegarLoop]: === Iteration 68 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:06,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:06,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2019-08-05 10:34:06,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:06,928 WARN L254 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 10:34:06,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:08,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:08,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:34:08,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:34:08,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:34:08,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:34:08,671 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2019-08-05 10:34:11,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:11,604 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:34:11,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:34:11,604 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2019-08-05 10:34:11,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:11,605 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:34:11,605 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:34:11,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:34:11,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:34:11,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:34:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:34:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:34:11,608 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:34:11,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:11,608 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:34:11,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:34:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:34:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:34:11,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:11,609 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1] [2019-08-05 10:34:11,609 INFO L418 AbstractCegarLoop]: === Iteration 69 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:11,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:11,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2019-08-05 10:34:11,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:11,627 WARN L254 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 139 conjunts are in the unsatisfiable core [2019-08-05 10:34:11,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:13,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:13,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:13,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:34:13,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:34:13,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:34:13,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:34:13,520 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2019-08-05 10:34:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:16,717 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:34:16,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:34:16,717 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2019-08-05 10:34:16,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:16,718 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:34:16,718 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:34:16,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:34:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:34:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:34:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:34:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:34:16,721 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:34:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:16,721 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:34:16,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:34:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:34:16,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:34:16,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:16,722 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1] [2019-08-05 10:34:16,722 INFO L418 AbstractCegarLoop]: === Iteration 70 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:16,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:16,722 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2019-08-05 10:34:16,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:16,736 WARN L254 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 10:34:16,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:18,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:18,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:34:18,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:34:18,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:34:18,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:34:18,605 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2019-08-05 10:34:21,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:21,866 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:34:21,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:34:21,866 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2019-08-05 10:34:21,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:21,867 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:34:21,867 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:34:21,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:34:21,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:34:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:34:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:34:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:34:21,870 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:34:21,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:21,870 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:34:21,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:34:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:34:21,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:34:21,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:21,871 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1] [2019-08-05 10:34:21,871 INFO L418 AbstractCegarLoop]: === Iteration 71 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:21,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:21,872 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2019-08-05 10:34:21,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:21,893 WARN L254 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-05 10:34:21,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:23,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:23,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:34:23,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:34:23,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:34:23,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:34:23,833 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2019-08-05 10:34:27,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:27,164 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:34:27,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:34:27,165 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2019-08-05 10:34:27,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:27,165 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:34:27,166 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:34:27,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:34:27,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:34:27,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:34:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:34:27,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:34:27,169 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:34:27,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:27,169 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:34:27,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:34:27,169 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:34:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:34:27,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:27,170 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1] [2019-08-05 10:34:27,170 INFO L418 AbstractCegarLoop]: === Iteration 72 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:27,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:27,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2019-08-05 10:34:27,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:27,192 WARN L254 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-05 10:34:27,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:29,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:29,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:34:29,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:34:29,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:34:29,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:34:29,137 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2019-08-05 10:34:32,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:32,520 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:34:32,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:34:32,521 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2019-08-05 10:34:32,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:32,521 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:34:32,522 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:34:32,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:34:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:34:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:34:32,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:34:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:34:32,525 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:34:32,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:32,525 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:34:32,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:34:32,525 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:34:32,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:34:32,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:32,526 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1] [2019-08-05 10:34:32,526 INFO L418 AbstractCegarLoop]: === Iteration 73 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:32,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:32,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2019-08-05 10:34:32,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:32,551 WARN L254 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-05 10:34:32,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:35,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:35,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:34:35,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:34:35,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:34:35,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:34:35,029 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2019-08-05 10:34:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:38,544 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:34:38,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:34:38,545 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2019-08-05 10:34:38,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:38,546 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:34:38,546 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:34:38,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:34:38,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:34:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:34:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:34:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:34:38,549 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:34:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:38,550 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:34:38,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:34:38,550 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:34:38,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:34:38,550 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:38,550 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1] [2019-08-05 10:34:38,551 INFO L418 AbstractCegarLoop]: === Iteration 74 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:38,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:38,551 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2019-08-05 10:34:38,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:38,576 WARN L254 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 10:34:38,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:40,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:40,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:34:40,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:34:40,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:34:40,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:34:40,904 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2019-08-05 10:34:44,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:44,320 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:34:44,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:34:44,321 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2019-08-05 10:34:44,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:44,322 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:34:44,322 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:34:44,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:34:44,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:34:44,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:34:44,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:34:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:34:44,325 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:34:44,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:44,325 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:34:44,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:34:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:34:44,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:34:44,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:44,326 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1] [2019-08-05 10:34:44,327 INFO L418 AbstractCegarLoop]: === Iteration 75 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:44,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:44,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2019-08-05 10:34:44,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:44,351 WARN L254 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 151 conjunts are in the unsatisfiable core [2019-08-05 10:34:44,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:46,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:46,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:34:46,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:34:46,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:34:46,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:34:46,641 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2019-08-05 10:34:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:50,130 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:34:50,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:34:50,131 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2019-08-05 10:34:50,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:50,132 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:34:50,132 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:34:50,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:34:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:34:50,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:34:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:34:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:34:50,134 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:34:50,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:50,134 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:34:50,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:34:50,134 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:34:50,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:34:50,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:50,135 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1] [2019-08-05 10:34:50,135 INFO L418 AbstractCegarLoop]: === Iteration 76 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:50,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:50,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2019-08-05 10:34:50,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:50,152 WARN L254 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 10:34:50,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:52,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:52,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:34:52,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:34:52,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:34:52,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:34:52,551 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2019-08-05 10:34:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:56,394 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:34:56,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:34:56,395 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2019-08-05 10:34:56,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:56,396 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:34:56,396 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:34:56,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:34:56,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:34:56,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:34:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:34:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:34:56,398 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:34:56,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:56,399 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:34:56,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:34:56,399 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:34:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:34:56,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:56,399 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1] [2019-08-05 10:34:56,399 INFO L418 AbstractCegarLoop]: === Iteration 77 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:56,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:56,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2019-08-05 10:34:56,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:56,432 WARN L254 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-05 10:34:56,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:58,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:58,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:34:58,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:34:58,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:34:58,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:34:58,686 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2019-08-05 10:35:02,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:02,497 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:35:02,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:35:02,498 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2019-08-05 10:35:02,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:02,498 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:35:02,499 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:35:02,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:35:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:35:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:35:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:35:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:35:02,501 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:35:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:02,502 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:35:02,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:35:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:35:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:35:02,502 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:02,502 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1] [2019-08-05 10:35:02,503 INFO L418 AbstractCegarLoop]: === Iteration 78 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:02,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:02,503 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2019-08-05 10:35:02,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:02,531 WARN L254 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 157 conjunts are in the unsatisfiable core [2019-08-05 10:35:02,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:04,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:04,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:35:04,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:35:04,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:35:04,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:35:04,777 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2019-08-05 10:35:08,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:08,938 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:35:08,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:35:08,939 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2019-08-05 10:35:08,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:08,940 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:35:08,940 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:35:08,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:35:08,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:35:08,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:35:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:35:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:35:08,943 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:35:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:08,943 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:35:08,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:35:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:35:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:35:08,944 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:08,944 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1] [2019-08-05 10:35:08,944 INFO L418 AbstractCegarLoop]: === Iteration 79 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:08,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:08,945 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2019-08-05 10:35:08,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:08,971 WARN L254 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-05 10:35:08,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:11,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:11,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:35:11,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:35:11,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:35:11,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:35:11,312 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2019-08-05 10:35:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:15,622 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:35:15,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:35:15,623 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2019-08-05 10:35:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:15,624 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:35:15,624 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:35:15,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:35:15,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:35:15,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:35:15,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:35:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:35:15,627 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:35:15,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:15,627 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:35:15,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:35:15,628 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:35:15,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:35:15,628 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:15,628 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1] [2019-08-05 10:35:15,629 INFO L418 AbstractCegarLoop]: === Iteration 80 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:15,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:15,629 INFO L82 PathProgramCache]: Analyzing trace with hash -718799327, now seen corresponding path program 79 times [2019-08-05 10:35:15,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:15,657 WARN L254 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-05 10:35:15,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:18,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:18,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:35:18,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:35:18,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:35:18,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:35:18,446 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2019-08-05 10:35:22,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:22,464 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:35:22,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:35:22,465 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2019-08-05 10:35:22,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:22,466 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:35:22,466 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:35:22,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:35:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:35:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:35:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:35:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:35:22,468 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:35:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:22,468 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:35:22,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:35:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:35:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:35:22,469 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:22,469 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1] [2019-08-05 10:35:22,469 INFO L418 AbstractCegarLoop]: === Iteration 81 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:22,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:22,470 INFO L82 PathProgramCache]: Analyzing trace with hash -807942713, now seen corresponding path program 80 times [2019-08-05 10:35:22,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:22,499 WARN L254 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 163 conjunts are in the unsatisfiable core [2019-08-05 10:35:22,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:25,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:25,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:25,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:35:25,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:35:25,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:35:25,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:35:25,053 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2019-08-05 10:35:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:29,251 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:35:29,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:35:29,252 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2019-08-05 10:35:29,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:29,252 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:35:29,253 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:35:29,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:35:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:35:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:35:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:35:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:35:29,255 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:35:29,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:29,255 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:35:29,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:35:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:35:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:35:29,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:29,256 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1] [2019-08-05 10:35:29,256 INFO L418 AbstractCegarLoop]: === Iteration 82 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:29,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:29,256 INFO L82 PathProgramCache]: Analyzing trace with hash 723579617, now seen corresponding path program 81 times [2019-08-05 10:35:29,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:29,295 WARN L254 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-05 10:35:29,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:34,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:34,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:34,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:35:34,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:35:34,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:35:34,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:35:34,422 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2019-08-05 10:35:38,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:38,952 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:35:38,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:35:38,952 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2019-08-05 10:35:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:38,953 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:35:38,953 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:35:38,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:35:38,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:35:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:35:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:35:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:35:38,956 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:35:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:38,956 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:35:38,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:35:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:35:38,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:35:38,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:38,957 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1] [2019-08-05 10:35:38,957 INFO L418 AbstractCegarLoop]: === Iteration 83 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:38,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:38,957 INFO L82 PathProgramCache]: Analyzing trace with hash 956131591, now seen corresponding path program 82 times [2019-08-05 10:35:38,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:38,976 WARN L254 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 167 conjunts are in the unsatisfiable core [2019-08-05 10:35:38,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:41,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:41,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:41,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:35:41,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:35:41,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:35:41,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:35:41,958 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2019-08-05 10:35:46,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:46,437 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:35:46,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:35:46,438 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2019-08-05 10:35:46,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:46,439 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:35:46,439 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:35:46,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:35:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:35:46,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:35:46,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:35:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:35:46,442 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:35:46,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:46,442 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:35:46,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:35:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:35:46,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:35:46,443 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:46,443 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1] [2019-08-05 10:35:46,443 INFO L418 AbstractCegarLoop]: === Iteration 84 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:46,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:46,444 INFO L82 PathProgramCache]: Analyzing trace with hash -424691807, now seen corresponding path program 83 times [2019-08-05 10:35:46,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:46,473 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 169 conjunts are in the unsatisfiable core [2019-08-05 10:35:46,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:49,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:49,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:35:49,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:35:49,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:35:49,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:35:49,369 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2019-08-05 10:35:53,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:53,991 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:35:53,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:35:53,992 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2019-08-05 10:35:53,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:53,993 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:35:53,993 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:35:53,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:35:53,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:35:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:35:53,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:35:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:35:53,996 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:35:53,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:53,996 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:35:53,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:35:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:35:53,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:35:53,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:53,997 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1] [2019-08-05 10:35:53,997 INFO L418 AbstractCegarLoop]: === Iteration 85 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:53,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:53,997 INFO L82 PathProgramCache]: Analyzing trace with hash -280544185, now seen corresponding path program 84 times [2019-08-05 10:35:53,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:54,028 WARN L254 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 171 conjunts are in the unsatisfiable core [2019-08-05 10:35:54,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:56,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:56,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:35:56,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:35:56,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:35:56,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:35:56,800 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2019-08-05 10:36:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:01,474 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:36:01,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:36:01,474 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2019-08-05 10:36:01,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:01,475 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:36:01,475 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:36:01,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:36:01,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:36:01,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:36:01,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:36:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:36:01,478 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:36:01,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:01,478 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:36:01,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:36:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:36:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:36:01,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:01,479 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1] [2019-08-05 10:36:01,480 INFO L418 AbstractCegarLoop]: === Iteration 86 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:01,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:01,480 INFO L82 PathProgramCache]: Analyzing trace with hash -106935199, now seen corresponding path program 85 times [2019-08-05 10:36:01,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:01,511 WARN L254 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 173 conjunts are in the unsatisfiable core [2019-08-05 10:36:01,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:04,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:04,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:36:04,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:36:04,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:36:04,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:36:04,533 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2019-08-05 10:36:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:09,336 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:36:09,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:36:09,336 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2019-08-05 10:36:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:09,337 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:36:09,337 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:36:09,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:36:09,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:36:09,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:36:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:36:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:36:09,340 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:36:09,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:09,340 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:36:09,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:36:09,340 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:36:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:36:09,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:09,341 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1] [2019-08-05 10:36:09,341 INFO L418 AbstractCegarLoop]: === Iteration 87 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:09,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:09,341 INFO L82 PathProgramCache]: Analyzing trace with hash 979976071, now seen corresponding path program 86 times [2019-08-05 10:36:09,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:09,367 WARN L254 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 175 conjunts are in the unsatisfiable core [2019-08-05 10:36:09,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:12,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:12,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:12,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:36:12,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:36:12,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:36:12,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:36:12,233 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. Received shutdown request... [2019-08-05 10:36:15,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:36:15,771 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:36:15,777 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:36:15,777 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:36:15 BoogieIcfgContainer [2019-08-05 10:36:15,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:36:15,779 INFO L168 Benchmark]: Toolchain (without parser) took 249626.30 ms. Allocated memory was 140.0 MB in the beginning and 194.0 MB in the end (delta: 54.0 MB). Free memory was 108.4 MB in the beginning and 105.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:36:15,780 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory is still 109.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:36:15,780 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.04 ms. Allocated memory is still 140.0 MB. Free memory was 108.4 MB in the beginning and 106.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:36:15,781 INFO L168 Benchmark]: Boogie Preprocessor took 19.77 ms. Allocated memory is still 140.0 MB. Free memory was 106.3 MB in the beginning and 105.4 MB in the end (delta: 891.6 kB). Peak memory consumption was 891.6 kB. Max. memory is 7.1 GB. [2019-08-05 10:36:15,782 INFO L168 Benchmark]: RCFGBuilder took 260.22 ms. Allocated memory is still 140.0 MB. Free memory was 105.4 MB in the beginning and 96.8 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:36:15,782 INFO L168 Benchmark]: TraceAbstraction took 249307.34 ms. Allocated memory was 140.0 MB in the beginning and 194.0 MB in the end (delta: 54.0 MB). Free memory was 96.3 MB in the beginning and 105.0 MB in the end (delta: -8.7 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:36:15,785 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.21 ms. Allocated memory is still 140.0 MB. Free memory is still 109.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.04 ms. Allocated memory is still 140.0 MB. Free memory was 108.4 MB in the beginning and 106.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.77 ms. Allocated memory is still 140.0 MB. Free memory was 106.3 MB in the beginning and 105.4 MB in the end (delta: 891.6 kB). Peak memory consumption was 891.6 kB. Max. memory is 7.1 GB. * RCFGBuilder took 260.22 ms. Allocated memory is still 140.0 MB. Free memory was 105.4 MB in the beginning and 96.8 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 249307.34 ms. Allocated memory was 140.0 MB in the beginning and 194.0 MB in the end (delta: 54.0 MB). Free memory was 96.3 MB in the beginning and 105.0 MB in the end (delta: -8.7 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was constructing difference of abstraction (89states) and FLOYD_HOARE automaton (currently 67 states, 89 states before enhancement),while ReachableStatesComputation was computing reachable states (65 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 locations, 1 error locations. TIMEOUT Result, 249.2s OverallTime, 87 OverallIterations, 86 TraceHistogramMax, 146.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 173 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 228869 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 119.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3828 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3828 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 99.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 86 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 101.0s InterpolantComputationTime, 3915 NumberOfCodeBlocks, 3915 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 3828 ConstructedInterpolants, 0 QuantifiedInterpolants, 669900 SizeOfPredicates, 0 NumberOfNonLiveVariables, 7917 ConjunctsInSsa, 7743 ConjunctsInUnsatCore, 87 InterpolantComputations, 1 PerfectInterpolantSequences, 0/109736 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown