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/NeonAngel01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:31:19,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:31:19,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:31:19,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:31:19,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:31:19,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:31:19,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:31:19,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:31:19,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:31:19,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:31:19,186 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:31:19,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:31:19,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:31:19,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:31:19,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:31:19,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:31:19,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:31:19,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:31:19,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:31:19,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:31:19,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:31:19,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:31:19,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:31:19,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:31:19,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:31:19,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:31:19,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:31:19,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:31:19,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:31:19,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:31:19,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:31:19,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:31:19,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:31:19,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:31:19,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:31:19,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:31:19,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:31:19,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:31:19,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:31:19,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:31:19,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:31:19,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:31:19,279 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:31:19,282 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:31:19,284 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:31:19,284 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:31:19,285 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/NeonAngel01.bpl [2019-08-05 10:31:19,285 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/NeonAngel01.bpl' [2019-08-05 10:31:19,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:31:19,318 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:31:19,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:31:19,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:31:19,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:31:19,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:19" (1/1) ... [2019-08-05 10:31:19,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:19" (1/1) ... [2019-08-05 10:31:19,350 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:31:19,351 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:31:19,351 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:31:19,353 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:31:19,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:31:19,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:31:19,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:31:19,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:19" (1/1) ... [2019-08-05 10:31:19,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:19" (1/1) ... [2019-08-05 10:31:19,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:19" (1/1) ... [2019-08-05 10:31:19,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:19" (1/1) ... [2019-08-05 10:31:19,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:19" (1/1) ... [2019-08-05 10:31:19,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:19" (1/1) ... [2019-08-05 10:31:19,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:19" (1/1) ... [2019-08-05 10:31:19,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:31:19,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:31:19,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:31:19,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:31:19,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:31:19,444 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:31:19,444 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:31:19,444 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:31:19,659 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:31:19,659 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:31:19,660 INFO L202 PluginConnector]: Adding new model NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:31:19 BoogieIcfgContainer [2019-08-05 10:31:19,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:31:19,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:31:19,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:31:19,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:31:19,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:19" (1/2) ... [2019-08-05 10:31:19,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680098a1 and model type NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:31:19, skipping insertion in model container [2019-08-05 10:31:19,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:31:19" (2/2) ... [2019-08-05 10:31:19,672 INFO L109 eAbstractionObserver]: Analyzing ICFG NeonAngel01.bpl [2019-08-05 10:31:19,681 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:31:19,687 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:31:19,704 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:31:19,727 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:31:19,728 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:31:19,728 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:31:19,728 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:31:19,728 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:31:19,728 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:31:19,729 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:31:19,729 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:31:19,729 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:31:19,743 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:31:19,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:31:19,751 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:19,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:31:19,754 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:19,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:19,759 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-08-05 10:31:19,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:19,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:31:19,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:19,929 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:31:19,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:31:19,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:31:19,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:31:19,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:31:19,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:31:19,948 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 10:31:20,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:20,004 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 10:31:20,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:31:20,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:31:20,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:20,020 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:31:20,020 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:31:20,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:31:20,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:31:20,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:31:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:31:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:31:20,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:31:20,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:20,057 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:31:20,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:31:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:31:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:31:20,058 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:20,058 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:31:20,059 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:20,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:20,059 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2019-08-05 10:31:20,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:20,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:31:20,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:20,212 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:31:20,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:20,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:31:20,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:31:20,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:31:20,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:31:20,216 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:31:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:20,281 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:31:20,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:31:20,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:31:20,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:20,282 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:31:20,282 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:31:20,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:31:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:31:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:31:20,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:31:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:31:20,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:31:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:20,287 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:31:20,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:31:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:31:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:31:20,288 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:20,288 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:31:20,289 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:20,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:20,289 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2019-08-05 10:31:20,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:20,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:31:20,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:20,383 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:31:20,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:20,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:31:20,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:31:20,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:31:20,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:31:20,385 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:31:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:20,445 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:31:20,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:31:20,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:31:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:20,446 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:31:20,446 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:31:20,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:31:20,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:31:20,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:31:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:31:20,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:31:20,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:31:20,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:20,449 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:31:20,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:31:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:31:20,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:31:20,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:20,451 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:31:20,451 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:20,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:20,452 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2019-08-05 10:31:20,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:20,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:31:20,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:20,563 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:31:20,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:20,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:31:20,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:31:20,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:31:20,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:31:20,567 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:31:20,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:20,587 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:31:20,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:31:20,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:31:20,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:20,589 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:31:20,589 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:31:20,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:31:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:31:20,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:31:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:31:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:31:20,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:31:20,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:20,592 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:31:20,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:31:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:31:20,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:31:20,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:20,593 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:31:20,594 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:20,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:20,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2019-08-05 10:31:20,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:20,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:31:20,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:20,800 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:31:20,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:20,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:31:20,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:31:20,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:31:20,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:31:20,802 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:31:20,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:20,866 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:31:20,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:31:20,867 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:31:20,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:20,868 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:31:20,868 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:31:20,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:31:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:31:20,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:31:20,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:31:20,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:31:20,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:31:20,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:20,871 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:31:20,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:31:20,871 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:31:20,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:31:20,872 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:20,872 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:31:20,872 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:20,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:20,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2019-08-05 10:31:20,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:20,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:31:20,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:21,074 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:31:21,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:21,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:31:21,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:31:21,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:31:21,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:31:21,076 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:31:21,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:21,110 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:31:21,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:31:21,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:31:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:21,111 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:31:21,111 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:31:21,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:31:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:31:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:31:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:31:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:31:21,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:31:21,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:21,115 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:31:21,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:31:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:31:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:31:21,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:21,116 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:31:21,116 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:21,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:21,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2019-08-05 10:31:21,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:21,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:31:21,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:21,365 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:31:21,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:21,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:31:21,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:31:21,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:31:21,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:31:21,367 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:31:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:21,447 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:31:21,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:31:21,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:31:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:21,449 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:31:21,449 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:31:21,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:31:21,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:31:21,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:31:21,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:31:21,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:31:21,452 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:31:21,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:21,452 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:31:21,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:31:21,452 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:31:21,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:31:21,453 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:21,453 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:31:21,453 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:21,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:21,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2019-08-05 10:31:21,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:21,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:31:21,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:21,589 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:31:21,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:21,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:31:21,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:31:21,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:31:21,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:31:21,591 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:31:21,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:21,626 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:31:21,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:31:21,627 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:31:21,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:21,628 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:31:21,628 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:31:21,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:31:21,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:31:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:31:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:31:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:31:21,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:31:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:21,632 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:31:21,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:31:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:31:21,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:31:21,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:21,633 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:31:21,633 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:21,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:21,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2019-08-05 10:31:21,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:21,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:31:21,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:22,056 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:31:22,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:22,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:31:22,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:31:22,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:31:22,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:22,058 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:31:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:22,099 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:31:22,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:31:22,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:31:22,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:22,101 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:31:22,101 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:31:22,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:22,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:31:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:31:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:31:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:31:22,105 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:31:22,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:22,106 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:31:22,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:31:22,106 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:31:22,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:31:22,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:22,107 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:31:22,107 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:22,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:22,107 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2019-08-05 10:31:22,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:22,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:31:22,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:22,266 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:31:22,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:22,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:31:22,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:31:22,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:31:22,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:22,268 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:31:22,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:22,365 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:31:22,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:31:22,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:31:22,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:22,367 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:31:22,368 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:31:22,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:22,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:31:22,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:31:22,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:31:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:31:22,371 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:31:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:22,371 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:31:22,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:31:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:31:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:31:22,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:22,372 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:31:22,373 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:22,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:22,373 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2019-08-05 10:31:22,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:22,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:31:22,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:22,641 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:31:22,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:22,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:31:22,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:31:22,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:31:22,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:22,644 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:31:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:22,675 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:31:22,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:31:22,675 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:31:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:22,676 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:31:22,676 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:31:22,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:22,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:31:22,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:31:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:31:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:31:22,679 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:31:22,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:22,680 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:31:22,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:31:22,680 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:31:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:31:22,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:22,681 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:31:22,681 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:22,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:22,682 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2019-08-05 10:31:22,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:22,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:31:22,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:22,989 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:31:22,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:22,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:22,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:22,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:22,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:22,991 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:31:23,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:23,062 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:31:23,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:31:23,062 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:31:23,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:23,063 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:31:23,063 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:31:23,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:31:23,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:31:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:31:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:31:23,067 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:31:23,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:23,068 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:31:23,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:23,068 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:31:23,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:31:23,069 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:23,069 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:31:23,069 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:23,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:23,069 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2019-08-05 10:31:23,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:23,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:23,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:23,292 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:31:23,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:23,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:23,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:31:23,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:31:23,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:23,295 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:31:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:23,341 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:31:23,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:31:23,341 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:31:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:23,342 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:31:23,343 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:31:23,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:31:23,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:31:23,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:31:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:31:23,346 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:31:23,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:23,347 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:31:23,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:23,347 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:31:23,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:31:23,347 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:23,348 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:31:23,348 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:23,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:23,348 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2019-08-05 10:31:23,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:23,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:31:23,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:23,620 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:31:23,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:23,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:23,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:23,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:23,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:23,622 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:31:23,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:23,647 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:31:23,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:31:23,648 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:31:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:23,649 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:31:23,649 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:31:23,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:23,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:31:23,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:31:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:31:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:31:23,653 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:31:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:23,653 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:31:23,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:31:23,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:23,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:23,654 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:31:23,654 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:23,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:23,655 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2019-08-05 10:31:23,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:23,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:23,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:23,848 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:31:23,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:23,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:31:23,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:23,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:23,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:23,851 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:31:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:23,884 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:31:23,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:31:23,885 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:31:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:23,886 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:31:23,886 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:31:23,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:23,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:31:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:31:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:31:23,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:31:23,890 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:31:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:23,890 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:31:23,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:23,891 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:31:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:31:23,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:23,891 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:31:23,892 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:23,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:23,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2019-08-05 10:31:23,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:23,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:31:23,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:24,121 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:31:24,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:24,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:31:24,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:31:24,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:31:24,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:24,123 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:31:24,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:24,158 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:31:24,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:31:24,166 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:31:24,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:24,167 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:31:24,167 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:31:24,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:31:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:31:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:31:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:31:24,175 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:31:24,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:24,175 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:31:24,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:31:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:31:24,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:31:24,176 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:24,179 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:31:24,179 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:24,180 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2019-08-05 10:31:24,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:24,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:31:24,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:24,587 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:31:24,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:24,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:31:24,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:31:24,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:31:24,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:31:24,589 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:31:24,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:24,641 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:31:24,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:31:24,641 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:31:24,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:24,642 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:31:24,642 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:31:24,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:31:24,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:31:24,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:31:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:31:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:31:24,646 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:31:24,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:24,646 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:31:24,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:31:24,646 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:31:24,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:31:24,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:24,647 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:31:24,647 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:24,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:24,647 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2019-08-05 10:31:24,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:24,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:31:24,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:25,165 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:31:25,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:25,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:31:25,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:31:25,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:31:25,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:31:25,168 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:31:25,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:25,243 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:31:25,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:31:25,243 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:31:25,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:25,243 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:31:25,244 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:31:25,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:31:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:31:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:31:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:31:25,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:31:25,247 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:31:25,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:25,248 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:31:25,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:31:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:31:25,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:31:25,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:25,249 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:31:25,249 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:25,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:25,249 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2019-08-05 10:31:25,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:25,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:31:25,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:25,693 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:31:25,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:25,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:31:25,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:31:25,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:31:25,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:31:25,696 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:31:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:25,727 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:31:25,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:31:25,731 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:31:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:25,732 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:31:25,732 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:31:25,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:31:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:31:25,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:31:25,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:31:25,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:31:25,736 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:31:25,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:25,736 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:31:25,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:31:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:31:25,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:31:25,737 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:25,738 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:31:25,738 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:25,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:25,738 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2019-08-05 10:31:25,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:25,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:31:25,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:26,155 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:31:26,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:26,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:31:26,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:31:26,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:31:26,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:26,156 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:31:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:26,209 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:31:26,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:31:26,210 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:31:26,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:26,210 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:31:26,211 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:31:26,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:26,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:31:26,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:31:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:31:26,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:31:26,214 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:31:26,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:26,215 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:31:26,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:31:26,215 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:31:26,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:31:26,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:26,216 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:31:26,216 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:26,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:26,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2019-08-05 10:31:26,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:26,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:31:26,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:26,578 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:31:26,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:26,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:31:26,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:31:26,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:31:26,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:31:26,580 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:31:26,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:26,625 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:31:26,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:31:26,626 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:31:26,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:26,627 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:31:26,627 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:31:26,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:31:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:31:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:31:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:31:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:31:26,630 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:31:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:26,630 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:31:26,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:31:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:31:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:31:26,631 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:26,631 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:31:26,631 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:26,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:26,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2019-08-05 10:31:26,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:26,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:31:26,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:26,983 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:31:26,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:26,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:31:26,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:31:26,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:31:26,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:26,985 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:31:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:27,051 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:31:27,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:31:27,053 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:31:27,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:27,054 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:31:27,054 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:31:27,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:27,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:31:27,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:31:27,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:31:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:31:27,057 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:31:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:27,057 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:31:27,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:31:27,058 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:31:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:31:27,058 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:27,058 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:31:27,059 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:27,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:27,059 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2019-08-05 10:31:27,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:27,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:31:27,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:27,435 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:31:27,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:27,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:31:27,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:31:27,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:31:27,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:31:27,437 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:31:27,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:27,477 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:31:27,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:31:27,477 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:31:27,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:27,478 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:31:27,478 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:31:27,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:31:27,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:31:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:31:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:31:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:31:27,482 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:31:27,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:27,483 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:31:27,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:31:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:31:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:31:27,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:27,484 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:31:27,484 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:27,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:27,484 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2019-08-05 10:31:27,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:27,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:31:27,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:27,785 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:31:27,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:27,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:31:27,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:31:27,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:31:27,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:31:27,787 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:31:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:27,848 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:31:27,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:31:27,849 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:31:27,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:27,849 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:31:27,850 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:31:27,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:31:27,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:31:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:31:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:31:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:31:27,854 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:31:27,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:27,854 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:31:27,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:31:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:31:27,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:31:27,855 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:27,855 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:31:27,855 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:27,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:27,856 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2019-08-05 10:31:27,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:27,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:31:27,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:28,644 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:31:28,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:28,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:31:28,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:31:28,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:31:28,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:31:28,646 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:31:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:28,706 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:31:28,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:31:28,706 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:31:28,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:28,707 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:31:28,707 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:31:28,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:31:28,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:31:28,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:31:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:31:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:31:28,714 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:31:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:28,714 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:31:28,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:31:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:31:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:31:28,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:28,715 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:31:28,716 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:28,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:28,716 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2019-08-05 10:31:28,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:28,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:31:28,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:29,530 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:31:29,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:29,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:31:29,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:31:29,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:31:29,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:29,532 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:31:29,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:29,592 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:31:29,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:31:29,593 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:31:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:29,593 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:31:29,593 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:31:29,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:31:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:31:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:31:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:31:29,596 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:31:29,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:29,597 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:31:29,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:31:29,597 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:31:29,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:31:29,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:29,597 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:31:29,597 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:29,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:29,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2019-08-05 10:31:29,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:29,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:31:29,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:31,398 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:31:31,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:31,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:31:31,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:31:31,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:31:31,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:31:31,401 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:31:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:31,585 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:31:31,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:31:31,585 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:31:31,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:31,586 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:31:31,586 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:31:31,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:31:31,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:31:31,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:31:31,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:31:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:31:31,591 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:31:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:31,591 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:31:31,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:31:31,593 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:31:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:31:31,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:31,594 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:31:31,594 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:31,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:31,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2019-08-05 10:31:31,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:31,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:31:31,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:32,076 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:31:32,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:32,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:31:32,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:31:32,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:31:32,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:31:32,077 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:31:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:32,135 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:31:32,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:31:32,135 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:31:32,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:32,136 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:31:32,136 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:31:32,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:31:32,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:31:32,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:31:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:31:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:31:32,140 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:31:32,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:32,140 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:31:32,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:31:32,141 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:31:32,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:31:32,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:32,141 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:31:32,141 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:32,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:32,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2019-08-05 10:31:32,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:32,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:31:32,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:33,299 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:31:33,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:33,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:31:33,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:31:33,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:31:33,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:31:33,300 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:31:33,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:33,358 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:31:33,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:31:33,358 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:31:33,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:33,359 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:31:33,359 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:31:33,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:31:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:31:33,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:31:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:31:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:31:33,363 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:31:33,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:33,363 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:31:33,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:31:33,364 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:31:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:31:33,364 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:33,364 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:31:33,364 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:33,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:33,365 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2019-08-05 10:31:33,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:33,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:31:33,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:33,842 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:31:33,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:33,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:31:33,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:31:33,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:31:33,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:31:33,844 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:31:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:33,970 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:31:33,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:31:33,970 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:31:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:33,970 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:31:33,971 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:31:33,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:31:33,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:31:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:31:33,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:31:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:31:33,974 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:31:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:33,974 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:31:33,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:31:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:31:33,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:31:33,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:33,975 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:31:33,975 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:33,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:33,976 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2019-08-05 10:31:33,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:33,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:31:33,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:34,459 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:31:34,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:34,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:31:34,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:31:34,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:31:34,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:31:34,461 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:31:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:34,515 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:31:34,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:31:34,515 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:31:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:34,516 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:31:34,516 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:31:34,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:31:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:31:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:31:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:31:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:31:34,520 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:31:34,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:34,520 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:31:34,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:31:34,520 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:31:34,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:31:34,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:34,521 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:31:34,521 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:34,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:34,521 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2019-08-05 10:31:34,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:34,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:31:34,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:35,087 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:31:35,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:35,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:31:35,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:31:35,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:31:35,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:31:35,090 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:31:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:35,133 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:31:35,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:31:35,133 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:31:35,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:35,134 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:31:35,134 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:31:35,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:31:35,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:31:35,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:31:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:31:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:31:35,138 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:31:35,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:35,138 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:31:35,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:31:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:31:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:31:35,139 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:35,139 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:31:35,139 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:35,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:35,139 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2019-08-05 10:31:35,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:35,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:31:35,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:35,636 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:31:35,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:35,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:31:35,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:31:35,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:31:35,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:31:35,639 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:31:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:35,703 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:31:35,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:31:35,704 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:31:35,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:35,704 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:31:35,704 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:31:35,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:31:35,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:31:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:31:35,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:31:35,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:31:35,708 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:31:35,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:35,708 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:31:35,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:31:35,708 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:31:35,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:31:35,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:35,709 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:31:35,709 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:35,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:35,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2019-08-05 10:31:35,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:35,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:31:35,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:36,232 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:31:36,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:36,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:31:36,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:31:36,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:31:36,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:31:36,234 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:31:36,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:36,281 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:31:36,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:31:36,281 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:31:36,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:36,282 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:31:36,282 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:31:36,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:31:36,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:31:36,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:31:36,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:31:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:31:36,285 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:31:36,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:36,285 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:31:36,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:31:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:31:36,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:31:36,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:36,286 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:31:36,287 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:36,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:36,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2019-08-05 10:31:36,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:36,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:31:36,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:37,373 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:31:37,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:37,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:31:37,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:31:37,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:31:37,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:31:37,375 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:31:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:37,420 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:31:37,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:31:37,420 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:31:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:37,421 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:31:37,421 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:31:37,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:31:37,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:31:37,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:31:37,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:31:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:31:37,424 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:31:37,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:37,425 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:31:37,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:31:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:31:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:31:37,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:37,426 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:31:37,426 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:37,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:37,426 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2019-08-05 10:31:37,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:37,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:31:37,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:38,540 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:31:38,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:38,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:31:38,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:31:38,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:31:38,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:31:38,542 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:31:38,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:38,609 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:31:38,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:31:38,609 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:31:38,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:38,610 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:31:38,610 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:31:38,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:31:38,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:31:38,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:31:38,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:31:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:31:38,613 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:31:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:38,613 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:31:38,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:31:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:31:38,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:31:38,614 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:38,614 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:31:38,614 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:38,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:38,614 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2019-08-05 10:31:38,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:38,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:31:38,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:39,523 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:31:39,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:39,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:31:39,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:31:39,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:31:39,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:31:39,525 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:31:39,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:39,573 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:31:39,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:31:39,574 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:31:39,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:39,575 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:31:39,575 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:31:39,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:31:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:31:39,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:31:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:31:39,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:31:39,578 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:31:39,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:39,578 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:31:39,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:31:39,579 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:31:39,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:31:39,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:39,579 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:31:39,579 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:39,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:39,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2019-08-05 10:31:39,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:39,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:31:39,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:40,188 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:31:40,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:40,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:31:40,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:31:40,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:31:40,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:31:40,190 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:31:40,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:40,254 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:31:40,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:31:40,255 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:31:40,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:40,255 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:31:40,255 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:31:40,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:31:40,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:31:40,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:31:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:31:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:31:40,258 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:31:40,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:40,258 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:31:40,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:31:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:31:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:31:40,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:40,259 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:31:40,259 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:40,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:40,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2019-08-05 10:31:40,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:40,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:31:40,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:40,924 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:31:40,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:40,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:31:40,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:31:40,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:31:40,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:31:40,926 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:31:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:41,024 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:31:41,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:31:41,024 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:31:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:41,025 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:31:41,025 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:31:41,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:31:41,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:31:41,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:31:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:31:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:31:41,029 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:31:41,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:41,030 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:31:41,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:31:41,030 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:31:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:31:41,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:41,031 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:31:41,031 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:41,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:41,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2019-08-05 10:31:41,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:41,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:31:41,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:41,975 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:31:41,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:41,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:31:41,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:31:41,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:31:41,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:31:41,977 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:31:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:42,031 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:31:42,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:31:42,031 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:31:42,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:42,032 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:31:42,032 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:31:42,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:31:42,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:31:42,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:31:42,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:31:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:31:42,035 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:31:42,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:42,035 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:31:42,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:31:42,035 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:31:42,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:31:42,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:42,036 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:31:42,036 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:42,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:42,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2019-08-05 10:31:42,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:42,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:31:42,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:42,784 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:31:42,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:42,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:31:42,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:31:42,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:31:42,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:31:42,786 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:31:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:42,866 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:31:42,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:31:42,867 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:31:42,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:42,868 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:31:42,868 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:31:42,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:31:42,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:31:42,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:31:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:31:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:31:42,871 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:31:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:42,871 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:31:42,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:31:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:31:42,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:31:42,872 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:42,872 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:31:42,872 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:42,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:42,872 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2019-08-05 10:31:42,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:42,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:31:42,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:43,605 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:31:43,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:43,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:31:43,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:31:43,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:31:43,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:31:43,607 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:31:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:43,685 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:31:43,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:31:43,685 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:31:43,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:43,686 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:31:43,686 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:31:43,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:31:43,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:31:43,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:31:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:31:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:31:43,689 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:31:43,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:43,689 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:31:43,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:31:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:31:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:31:43,690 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:43,690 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:31:43,690 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:43,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:43,690 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2019-08-05 10:31:43,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:43,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:31:43,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:44,475 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:31:44,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:44,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:31:44,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:31:44,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:31:44,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:31:44,477 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:31:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:44,533 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:31:44,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:31:44,533 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:31:44,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:44,534 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:31:44,534 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:31:44,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:31:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:31:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:31:44,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:31:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:31:44,538 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:31:44,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:44,538 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:31:44,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:31:44,538 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:31:44,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:31:44,539 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:44,539 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:31:44,539 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:44,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:44,539 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2019-08-05 10:31:44,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:44,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:31:44,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:45,548 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:31:45,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:45,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:31:45,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:31:45,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:31:45,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:31:45,550 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:31:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:45,682 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:31:45,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:31:45,682 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:31:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:45,683 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:31:45,683 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:31:45,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:31:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:31:45,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:31:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:31:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:31:45,686 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:31:45,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:45,686 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:31:45,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:31:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:31:45,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:31:45,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:45,687 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:31:45,687 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:45,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:45,687 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2019-08-05 10:31:45,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:45,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:31:45,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:46,470 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:31:46,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:46,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:31:46,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:31:46,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:31:46,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:31:46,472 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:31:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:46,570 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:31:46,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:31:46,570 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:31:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:46,571 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:31:46,571 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:31:46,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:31:46,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:31:46,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:31:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:31:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:31:46,573 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:31:46,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:46,573 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:31:46,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:31:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:31:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:31:46,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:46,574 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:31:46,574 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:46,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2019-08-05 10:31:46,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:46,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:31:46,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:47,779 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:31:47,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:47,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:31:47,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:31:47,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:31:47,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:31:47,781 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:31:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:48,035 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:31:48,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:31:48,035 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:31:48,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:48,036 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:31:48,036 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:31:48,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:31:48,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:31:48,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:31:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:31:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:31:48,038 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:31:48,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:48,038 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:31:48,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:31:48,039 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:31:48,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:31:48,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:48,039 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:31:48,039 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:48,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:48,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2019-08-05 10:31:48,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:48,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:31:48,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:48,966 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:31:48,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:48,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:31:48,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:31:48,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:31:48,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:31:48,968 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:31:49,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:49,041 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:31:49,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:31:49,041 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:31:49,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:49,042 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:31:49,042 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:31:49,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:31:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:31:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:31:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:31:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:31:49,045 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:31:49,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:49,045 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:31:49,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:31:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:31:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:31:49,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:49,046 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:31:49,046 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:49,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:49,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2019-08-05 10:31:49,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:49,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:31:49,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:49,908 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:31:49,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:49,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:31:49,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:31:49,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:31:49,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:31:49,910 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:31:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:49,970 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:31:49,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:31:49,971 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:31:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:49,971 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:31:49,971 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:31:49,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:31:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:31:49,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:31:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:31:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:31:49,974 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:31:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:49,974 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:31:49,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:31:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:31:49,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:31:49,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:49,975 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:31:49,975 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:49,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:49,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2019-08-05 10:31:49,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:49,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:31:49,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:50,932 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:31:50,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:50,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:31:50,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:31:50,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:31:50,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:31:50,934 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:31:51,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:51,013 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:31:51,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:31:51,014 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:31:51,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:51,014 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:31:51,015 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:31:51,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:31:51,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:31:51,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:31:51,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:31:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:31:51,018 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:31:51,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:51,023 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:31:51,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:31:51,023 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:31:51,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:31:51,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:51,024 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:31:51,024 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:51,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:51,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2019-08-05 10:31:51,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:51,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:31:51,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:52,243 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:31:52,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:52,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:31:52,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:31:52,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:31:52,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:31:52,244 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:31:52,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:52,312 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:31:52,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:31:52,313 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:31:52,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:52,314 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:31:52,314 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:31:52,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:31:52,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:31:52,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:31:52,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:31:52,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:31:52,317 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:31:52,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:52,318 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:31:52,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:31:52,318 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:31:52,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:31:52,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:52,318 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:31:52,319 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:52,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:52,319 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2019-08-05 10:31:52,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:52,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:31:52,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:53,407 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:31:53,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:53,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:31:53,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:31:53,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:31:53,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:31:53,409 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:31:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:53,490 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:31:53,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:31:53,491 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:31:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:53,492 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:31:53,492 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:31:53,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:31:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:31:53,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:31:53,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:31:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:31:53,494 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:31:53,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:53,494 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:31:53,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:31:53,495 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:31:53,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:31:53,495 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:53,495 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:31:53,495 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:53,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:53,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125254, now seen corresponding path program 51 times [2019-08-05 10:31:53,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:53,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:31:53,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:54,859 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:31:54,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:54,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:31:54,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:31:54,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:31:54,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:31:54,860 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:31:54,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:54,935 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:31:54,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:31:54,935 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:31:54,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:54,936 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:31:54,936 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:31:54,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:31:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:31:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:31:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:31:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:31:54,939 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:31:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:54,940 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:31:54,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:31:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:31:54,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:31:54,940 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:54,941 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:31:54,941 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:54,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:54,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107936, now seen corresponding path program 52 times [2019-08-05 10:31:54,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:54,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:31:54,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:55,993 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:31:55,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:55,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:31:55,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:31:55,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:31:55,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:31:55,995 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:31:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:56,074 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:31:56,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:31:56,075 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:31:56,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:56,076 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:31:56,076 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:31:56,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:31:56,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:31:56,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:31:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:31:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:31:56,079 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:31:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:56,079 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:31:56,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:31:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:31:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:31:56,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:56,080 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:31:56,080 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:56,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:56,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832710, now seen corresponding path program 53 times [2019-08-05 10:31:56,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:56,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:31:56,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:57,687 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:31:57,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:57,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:31:57,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:31:57,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:31:57,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:31:57,689 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:31:57,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:57,757 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:31:57,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:31:57,758 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:31:57,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:57,758 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:31:57,759 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:31:57,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:31:57,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:31:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:31:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:31:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:31:57,761 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:31:57,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:57,761 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:31:57,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:31:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:31:57,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:31:57,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:57,762 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:31:57,762 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:57,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:57,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895520, now seen corresponding path program 54 times [2019-08-05 10:31:57,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:57,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:31:57,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:58,870 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:31:58,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:58,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:31:58,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:31:58,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:31:58,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:31:58,871 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:31:58,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:58,977 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:31:58,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:31:58,977 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:31:58,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:58,978 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:31:58,978 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:31:58,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:31:58,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:31:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:31:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:31:58,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:31:58,981 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:31:58,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:58,981 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:31:58,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:31:58,981 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:31:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:31:58,982 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:58,982 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:31:58,982 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:58,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:58,982 INFO L82 PathProgramCache]: Analyzing trace with hash -836059322, now seen corresponding path program 55 times [2019-08-05 10:31:58,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:59,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:31:59,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:00,201 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:32:00,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:00,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:32:00,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:32:00,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:32:00,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:32:00,203 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:32:00,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:00,286 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:32:00,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:32:00,287 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:32:00,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:00,288 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:32:00,288 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:32:00,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:32:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:32:00,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:32:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:32:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:32:00,291 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:32:00,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:00,292 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:32:00,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:32:00,292 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:32:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:32:00,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:00,293 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:32:00,293 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:00,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:00,293 INFO L82 PathProgramCache]: Analyzing trace with hash -148039072, now seen corresponding path program 56 times [2019-08-05 10:32:00,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:00,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:32:00,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:01,474 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:32:01,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:01,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:32:01,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:32:01,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:32:01,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:32:01,475 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:32:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:01,555 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:32:01,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:32:01,555 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:32:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:01,556 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:32:01,556 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:32:01,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:32:01,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:32:01,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:32:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:32:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:32:01,559 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:32:01,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:01,559 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:32:01,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:32:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:32:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:32:01,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:01,560 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:32:01,560 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:01,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:01,561 INFO L82 PathProgramCache]: Analyzing trace with hash -294247802, now seen corresponding path program 57 times [2019-08-05 10:32:01,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:01,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:32:01,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:02,964 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:32:02,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:02,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:32:02,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:32:02,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:32:02,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:32:02,966 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:32:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:03,038 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:32:03,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:32:03,039 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:32:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:03,040 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:32:03,040 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:32:03,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:32:03,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:32:03,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:32:03,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:32:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:32:03,043 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:32:03,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:03,044 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:32:03,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:32:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:32:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:32:03,045 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:03,045 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:32:03,045 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:03,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:03,045 INFO L82 PathProgramCache]: Analyzing trace with hash -531751136, now seen corresponding path program 58 times [2019-08-05 10:32:03,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:03,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:32:03,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:04,425 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:32:04,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:04,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:32:04,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:32:04,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:32:04,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:32:04,427 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:32:04,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:04,502 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:32:04,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:32:04,503 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:32:04,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:04,503 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:32:04,503 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:32:04,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:32:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:32:04,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:32:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:32:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:32:04,506 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:32:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:04,507 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:32:04,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:32:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:32:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:32:04,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:04,507 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:32:04,507 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:04,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:04,508 INFO L82 PathProgramCache]: Analyzing trace with hash 695580102, now seen corresponding path program 59 times [2019-08-05 10:32:04,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:04,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:32:04,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:05,951 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:32:05,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:05,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:32:05,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:32:05,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:32:05,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:32:05,953 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:32:06,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:06,044 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:32:06,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:32:06,045 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:32:06,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:06,046 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:32:06,046 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:32:06,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:32:06,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:32:06,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:32:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:32:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:32:06,048 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:32:06,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:06,049 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:32:06,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:32:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:32:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:32:06,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:06,050 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:32:06,050 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:06,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:06,050 INFO L82 PathProgramCache]: Analyzing trace with hash 88142816, now seen corresponding path program 60 times [2019-08-05 10:32:06,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:06,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:32:06,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:07,738 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:32:07,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:07,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:32:07,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:32:07,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:32:07,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:32:07,740 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:32:07,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:07,835 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:32:07,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:32:07,836 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:32:07,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:07,836 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:32:07,837 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:32:07,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:32:07,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:32:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:32:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:32:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:32:07,839 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:32:07,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:07,839 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:32:07,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:32:07,839 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:32:07,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:32:07,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:07,840 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:32:07,840 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:07,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:07,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543866, now seen corresponding path program 61 times [2019-08-05 10:32:07,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:07,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:32:07,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:09,176 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:32:09,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:09,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:32:09,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:32:09,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:32:09,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:32:09,178 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:32:09,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:09,311 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:32:09,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:32:09,312 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:32:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:09,313 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:32:09,313 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:32:09,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:32:09,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:32:09,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:32:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:32:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:32:09,315 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:32:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:09,315 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:32:09,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:32:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:32:09,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:32:09,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:09,316 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:32:09,317 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:09,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:09,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223456, now seen corresponding path program 62 times [2019-08-05 10:32:09,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:09,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:32:09,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:10,711 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:32:10,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:10,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:32:10,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:32:10,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:32:10,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:32:10,713 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:32:10,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:10,812 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:32:10,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:32:10,812 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:32:10,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:10,813 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:32:10,813 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:32:10,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:32:10,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:32:10,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:32:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:32:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:32:10,816 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:32:10,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:10,817 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:32:10,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:32:10,817 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:32:10,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:32:10,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:10,818 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:32:10,818 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:10,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:10,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774662, now seen corresponding path program 63 times [2019-08-05 10:32:10,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:10,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:32:10,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:12,556 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:32:12,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:12,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:32:12,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:32:12,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:32:12,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:32:12,558 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:32:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:12,640 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:32:12,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:32:12,641 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:32:12,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:12,641 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:32:12,641 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:32:12,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:32:12,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:32:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:32:12,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:32:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:32:12,644 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:32:12,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:12,645 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:32:12,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:32:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:32:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:32:12,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:12,646 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:32:12,646 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:12,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:12,646 INFO L82 PathProgramCache]: Analyzing trace with hash -892596896, now seen corresponding path program 64 times [2019-08-05 10:32:12,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:12,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:32:12,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:14,158 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:32:14,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:14,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:32:14,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:32:14,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:32:14,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:32:14,160 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:32:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:14,266 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:32:14,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:32:14,266 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:32:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:14,267 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:32:14,267 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:32:14,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:32:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:32:14,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:32:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:32:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:32:14,270 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:32:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:14,271 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:32:14,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:32:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:32:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:32:14,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:14,271 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:32:14,272 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:14,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:14,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703866, now seen corresponding path program 65 times [2019-08-05 10:32:14,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:14,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:32:14,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:15,848 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:32:15,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:15,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:32:15,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:32:15,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:32:15,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:32:15,850 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:32:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:15,955 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:32:15,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:32:15,956 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:32:15,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:15,957 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:32:15,957 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:32:15,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:32:15,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:32:15,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:32:15,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:32:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:32:15,960 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:32:15,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:15,960 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:32:15,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:32:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:32:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:32:15,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:15,961 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:32:15,961 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:15,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:15,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718432, now seen corresponding path program 66 times [2019-08-05 10:32:15,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:15,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:32:15,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:17,861 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:32:17,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:17,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:32:17,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:32:17,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:32:17,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:32:17,863 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:32:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:17,959 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:32:17,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:32:17,959 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:32:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:17,960 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:32:17,960 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:32:17,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:32:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:32:17,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:32:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:32:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:32:17,963 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:32:17,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:17,963 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:32:17,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:32:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:32:17,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:32:17,964 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:17,964 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:32:17,964 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:17,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:17,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438138, now seen corresponding path program 67 times [2019-08-05 10:32:17,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:17,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:32:17,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:19,788 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:32:19,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:19,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:32:19,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:32:19,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:32:19,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:32:19,789 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:32:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:19,901 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:32:19,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:32:19,902 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:32:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:19,902 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:32:19,903 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:32:19,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:32:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:32:19,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:32:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:32:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:32:19,904 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:32:19,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:19,905 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:32:19,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:32:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:32:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:32:19,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:19,905 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:32:19,905 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:19,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:19,906 INFO L82 PathProgramCache]: Analyzing trace with hash 976119520, now seen corresponding path program 68 times [2019-08-05 10:32:19,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:19,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:32:19,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:21,664 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:32:21,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:21,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:32:21,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:32:21,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:32:21,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:32:21,665 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:32:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:21,756 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:32:21,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:32:21,756 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:32:21,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:21,757 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:32:21,757 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:32:21,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:32:21,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:32:21,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:32:21,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:32:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:32:21,760 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:32:21,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:21,760 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:32:21,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:32:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:32:21,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:32:21,761 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:21,761 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:32:21,761 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:21,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:21,762 INFO L82 PathProgramCache]: Analyzing trace with hash 194930182, now seen corresponding path program 69 times [2019-08-05 10:32:21,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:21,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:32:21,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:24,420 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:32:24,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:24,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:32:24,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:32:24,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:32:24,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:32:24,421 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:32:24,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:24,527 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:32:24,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:32:24,528 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:32:24,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:24,529 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:32:24,529 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:32:24,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:32:24,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:32:24,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:32:24,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:32:24,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:32:24,532 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:32:24,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:24,532 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:32:24,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:32:24,533 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:32:24,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:32:24,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:24,533 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:32:24,534 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:24,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:24,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864480, now seen corresponding path program 70 times [2019-08-05 10:32:24,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:24,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:32:24,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:26,321 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:32:26,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:26,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:32:26,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:32:26,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:32:26,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:32:26,323 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:32:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:26,431 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:32:26,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:32:26,432 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:32:26,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:26,433 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:32:26,433 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:32:26,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:32:26,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:32:26,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:32:26,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:32:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:32:26,436 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:32:26,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:26,436 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:32:26,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:32:26,436 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:32:26,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:32:26,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:26,437 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:32:26,437 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:26,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:26,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779834, now seen corresponding path program 71 times [2019-08-05 10:32:26,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:26,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:32:26,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:28,604 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:32:28,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:28,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:32:28,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:32:28,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:32:28,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:32:28,606 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:32:28,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:28,711 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:32:28,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:32:28,712 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:32:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:28,713 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:32:28,713 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:32:28,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:32:28,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:32:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:32:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:32:28,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:32:28,717 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:32:28,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:28,717 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:32:28,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:32:28,717 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:32:28,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:32:28,718 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:28,718 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:32:28,718 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:28,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:28,719 INFO L82 PathProgramCache]: Analyzing trace with hash 365428832, now seen corresponding path program 72 times [2019-08-05 10:32:28,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:28,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:32:28,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:30,673 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:32:30,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:30,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:32:30,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:32:30,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:32:30,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:32:30,674 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:32:30,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:30,790 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:32:30,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:32:30,790 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:32:30,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:30,791 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:32:30,791 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:32:30,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:32:30,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:32:30,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:32:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:32:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:32:30,794 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:32:30,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:30,795 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:32:30,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:32:30,795 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:32:30,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:32:30,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:30,795 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:32:30,796 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:30,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:30,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1556611962, now seen corresponding path program 73 times [2019-08-05 10:32:30,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:30,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:32:30,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:32,997 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:32:32,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:32,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:32:32,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:32:32,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:32:32,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:32:32,999 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:32:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:33,102 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:32:33,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:32:33,103 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:32:33,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:33,104 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:32:33,104 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:32:33,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:32:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:32:33,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:32:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:32:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:32:33,107 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:32:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:33,107 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:32:33,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:32:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:32:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:32:33,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:33,108 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:32:33,108 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:33,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334432, now seen corresponding path program 74 times [2019-08-05 10:32:33,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:33,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:32:33,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:35,338 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:32:35,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:35,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:32:35,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:32:35,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:32:35,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:32:35,340 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:32:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:35,442 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:32:35,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:32:35,443 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:32:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:35,443 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:32:35,444 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:32:35,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:32:35,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:32:35,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:32:35,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:32:35,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:32:35,447 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:32:35,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:35,447 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:32:35,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:32:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:32:35,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:32:35,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:35,448 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:32:35,448 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:35,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600186, now seen corresponding path program 75 times [2019-08-05 10:32:35,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:35,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:32:35,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:37,465 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:32:37,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:37,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:32:37,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:32:37,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:32:37,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:32:37,467 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:32:37,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:37,579 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:32:37,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:32:37,579 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:32:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:37,580 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:32:37,580 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:32:37,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:32:37,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:32:37,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:32:37,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:32:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:32:37,583 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:32:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:37,584 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:32:37,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:32:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:32:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:32:37,584 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:37,585 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:32:37,585 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:37,585 INFO L82 PathProgramCache]: Analyzing trace with hash -268903968, now seen corresponding path program 76 times [2019-08-05 10:32:37,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:37,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:32:37,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:39,935 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:32:39,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:39,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:32:39,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:32:39,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:32:39,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:32:39,937 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:32:40,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:40,082 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:32:40,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:32:40,083 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:32:40,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:40,083 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:32:40,084 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:32:40,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:32:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:32:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:32:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:32:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:32:40,086 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:32:40,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:40,087 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:32:40,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:32:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:32:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:32:40,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:40,088 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:32:40,088 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:40,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:40,088 INFO L82 PathProgramCache]: Analyzing trace with hash 253907718, now seen corresponding path program 77 times [2019-08-05 10:32:40,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:40,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:32:40,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:42,157 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:32:42,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:42,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:32:42,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:32:42,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:32:42,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:32:42,159 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:32:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:42,703 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:32:42,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:32:42,704 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:32:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:42,705 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:32:42,705 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:32:42,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:32:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:32:42,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:32:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:32:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:32:42,709 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:32:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:42,709 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:32:42,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:32:42,710 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:32:42,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:32:42,710 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:42,710 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:32:42,710 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:42,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:42,711 INFO L82 PathProgramCache]: Analyzing trace with hash -718799200, now seen corresponding path program 78 times [2019-08-05 10:32:42,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:42,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:32:42,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:45,206 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:32:45,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:45,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:32:45,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:32:45,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:32:45,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:32:45,208 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:32:45,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:45,330 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:32:45,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:32:45,336 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:32:45,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:45,337 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:32:45,337 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:32:45,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:32:45,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:32:45,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:32:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:32:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:32:45,340 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:32:45,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:45,340 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:32:45,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:32:45,340 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:32:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:32:45,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:45,341 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:32:45,341 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:45,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:45,342 INFO L82 PathProgramCache]: Analyzing trace with hash -807942586, now seen corresponding path program 79 times [2019-08-05 10:32:45,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:45,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:32:45,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:47,537 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:32:47,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:47,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:32:47,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:32:47,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:32:47,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:32:47,539 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:32:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:47,677 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:32:47,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:32:47,677 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:32:47,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:47,678 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:32:47,678 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:32:47,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:32:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:32:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:32:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:32:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:32:47,680 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:32:47,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:47,680 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:32:47,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:32:47,680 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:32:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:32:47,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:47,681 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:32:47,681 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:47,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:47,681 INFO L82 PathProgramCache]: Analyzing trace with hash 723579744, now seen corresponding path program 80 times [2019-08-05 10:32:47,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:47,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:32:47,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:51,699 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:32:51,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:51,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:32:51,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:32:51,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:32:51,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:32:51,706 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:32:51,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:51,825 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:32:51,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:32:51,826 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:32:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:51,826 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:32:51,827 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:32:51,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:32:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:32:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:32:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:32:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:32:51,829 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:32:51,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:51,830 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:32:51,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:32:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:32:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:32:51,830 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:51,831 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:32:51,831 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:51,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:51,831 INFO L82 PathProgramCache]: Analyzing trace with hash 956131718, now seen corresponding path program 81 times [2019-08-05 10:32:51,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:51,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:32:51,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:54,536 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:32:54,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:54,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:32:54,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:32:54,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:32:54,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:32:54,538 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:32:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:54,807 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:32:54,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:32:54,807 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:32:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:54,808 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:32:54,808 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:32:54,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:32:54,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:32:54,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:32:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:32:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:32:54,812 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:32:54,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:54,812 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:32:54,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:32:54,812 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:32:54,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:32:54,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:54,813 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:32:54,813 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:54,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:54,813 INFO L82 PathProgramCache]: Analyzing trace with hash -424691680, now seen corresponding path program 82 times [2019-08-05 10:32:54,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:54,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:32:54,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:57,331 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:32:57,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:57,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:32:57,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:32:57,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:32:57,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:32:57,333 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:32:57,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:57,458 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:32:57,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:32:57,459 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:32:57,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:57,460 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:32:57,460 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:32:57,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:32:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:32:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:32:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:32:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:32:57,462 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:32:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:57,463 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:32:57,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:32:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:32:57,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:32:57,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:57,464 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:32:57,464 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:57,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:57,464 INFO L82 PathProgramCache]: Analyzing trace with hash -280544058, now seen corresponding path program 83 times [2019-08-05 10:32:57,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:57,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:32:57,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:00,168 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:33:00,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:00,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:33:00,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:33:00,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:33:00,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:33:00,171 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 10:33:00,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:00,385 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:33:00,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:33:00,385 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:33:00,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:00,386 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:33:00,386 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:33:00,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:33:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:33:00,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:33:00,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:33:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:33:00,389 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:33:00,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:00,389 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:33:00,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:33:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:33:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:33:00,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:00,390 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 10:33:00,390 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:00,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:00,390 INFO L82 PathProgramCache]: Analyzing trace with hash -106935072, now seen corresponding path program 84 times [2019-08-05 10:33:00,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:00,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:33:00,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:02,912 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:33:02,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:02,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:33:02,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:33:02,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:33:02,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:33:02,914 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 10:33:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:03,041 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:33:03,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:33:03,041 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 10:33:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:03,042 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:33:03,042 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:33:03,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:33:03,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:33:03,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:33:03,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:33:03,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:33:03,045 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:33:03,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:03,046 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:33:03,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:33:03,046 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:33:03,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:33:03,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:03,047 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 10:33:03,047 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:03,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:03,047 INFO L82 PathProgramCache]: Analyzing trace with hash 979976198, now seen corresponding path program 85 times [2019-08-05 10:33:03,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:03,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:33:03,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:05,938 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:33:05,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:05,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:33:05,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:33:05,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:33:05,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:33:05,940 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 10:33:06,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:06,134 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:33:06,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:33:06,134 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:33:06,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:06,135 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:33:06,135 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:33:06,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:33:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:33:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:33:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:33:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:33:06,138 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:33:06,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:06,138 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:33:06,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:33:06,139 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:33:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:33:06,139 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:06,139 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 10:33:06,139 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:06,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:06,140 INFO L82 PathProgramCache]: Analyzing trace with hash 314487200, now seen corresponding path program 86 times [2019-08-05 10:33:06,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:06,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:33:06,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:08,985 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:33:08,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:08,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:33:08,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:33:08,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:33:08,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:33:08,988 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-05 10:33:09,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:09,126 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:33:09,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:33:09,127 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 10:33:09,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:09,128 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:33:09,128 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:33:09,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:33:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:33:09,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:33:09,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:33:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:33:09,130 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 10:33:09,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:09,130 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:33:09,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:33:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:33:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:33:09,131 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:09,131 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 10:33:09,131 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:09,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:09,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164742, now seen corresponding path program 87 times [2019-08-05 10:33:09,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:09,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:33:09,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:11,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:11,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:33:11,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:33:11,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:33:11,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:33:11,814 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-05 10:33:11,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:11,936 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:33:11,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:33:11,936 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 10:33:11,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:11,937 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:33:11,937 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:33:11,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:33:11,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:33:11,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:33:11,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:33:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:33:11,940 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 10:33:11,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:11,940 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:33:11,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:33:11,940 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:33:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:33:11,941 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:11,941 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:33:11,941 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:11,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:11,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364768, now seen corresponding path program 88 times [2019-08-05 10:33:11,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:11,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:33:11,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:15,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:15,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:33:15,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:33:15,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:33:15,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:33:15,275 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:33:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:15,406 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:33:15,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:33:15,407 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:33:15,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:15,407 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:33:15,408 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:33:15,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:33:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:33:15,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:33:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:33:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:33:15,411 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 10:33:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:15,411 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:33:15,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:33:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:33:15,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:33:15,412 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:15,412 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 10:33:15,412 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:15,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:15,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663686, now seen corresponding path program 89 times [2019-08-05 10:33:15,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:15,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:33:15,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:18,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:18,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:33:18,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:33:18,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:33:18,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:33:18,190 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 10:33:19,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:19,404 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:33:19,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:33:19,404 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:33:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:19,405 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:33:19,405 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:33:19,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:33:19,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:33:19,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:33:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:33:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:33:19,408 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 10:33:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:19,408 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:33:19,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:33:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:33:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:33:19,409 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:19,409 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 10:33:19,409 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:19,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:19,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930144, now seen corresponding path program 90 times [2019-08-05 10:33:19,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:19,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:33:19,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:22,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:22,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:33:22,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:33:22,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:33:22,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:33:22,443 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-05 10:33:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:22,571 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:33:22,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:33:22,571 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 10:33:22,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:22,572 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:33:22,572 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:33:22,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:33:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:33:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:33:22,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:33:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:33:22,575 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 10:33:22,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:22,576 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:33:22,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:33:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:33:22,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:33:22,576 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:22,577 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 10:33:22,577 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:22,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:22,577 INFO L82 PathProgramCache]: Analyzing trace with hash 854092230, now seen corresponding path program 91 times [2019-08-05 10:33:22,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:22,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:33:22,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:25,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:25,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:33:25,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:33:25,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:33:25,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:33:25,824 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-05 10:33:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:25,972 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:33:25,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:33:25,972 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 10:33:25,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:25,973 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:33:25,973 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:33:25,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:33:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:33:25,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:33:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:33:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:33:25,976 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 10:33:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:25,977 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:33:25,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:33:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:33:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:33:25,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:25,977 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 10:33:25,977 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:25,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:25,978 INFO L82 PathProgramCache]: Analyzing trace with hash 707051488, now seen corresponding path program 92 times [2019-08-05 10:33:25,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:26,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:33:26,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:29,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:29,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:33:29,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:33:29,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:33:29,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:33:29,350 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-05 10:33:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:29,504 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:33:29,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:33:29,504 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 10:33:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:29,505 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:33:29,505 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:33:29,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:33:29,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:33:29,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:33:29,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:33:29,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:33:29,509 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 10:33:29,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:29,509 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:33:29,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:33:29,509 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:33:29,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:33:29,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:29,510 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 10:33:29,510 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:29,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:29,511 INFO L82 PathProgramCache]: Analyzing trace with hash 443755782, now seen corresponding path program 93 times [2019-08-05 10:33:29,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:29,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:33:29,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:32,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:32,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:33:32,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:33:32,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:33:32,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:33:32,562 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-05 10:33:32,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:32,696 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:33:32,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:33:32,696 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 10:33:32,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:32,697 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:33:32,697 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:33:32,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:33:32,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:33:32,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:33:32,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:33:32,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:33:32,700 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 10:33:32,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:32,700 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:33:32,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:33:32,701 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:33:32,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:33:32,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:32,701 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 10:33:32,702 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:32,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:32,702 INFO L82 PathProgramCache]: Analyzing trace with hash 871523488, now seen corresponding path program 94 times [2019-08-05 10:33:32,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:32,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:33:32,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:36,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:36,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:33:36,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:33:36,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:33:36,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:33:36,729 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-05 10:33:36,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:36,885 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:33:36,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:33:36,885 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 10:33:36,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:36,886 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:33:36,886 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:33:36,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:33:36,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:33:36,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:33:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:33:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:33:36,889 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 10:33:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:36,889 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:33:36,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:33:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:33:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:33:36,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:36,890 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 10:33:36,890 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:36,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:36,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420486, now seen corresponding path program 95 times [2019-08-05 10:33:36,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:36,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:33:36,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:40,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:40,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:33:40,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:33:40,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:33:40,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:33:40,373 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-05 10:33:40,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:40,510 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:33:40,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:33:40,511 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 10:33:40,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:40,512 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:33:40,512 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:33:40,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:33:40,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:33:40,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:33:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:33:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:33:40,514 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 10:33:40,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:40,515 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:33:40,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:33:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:33:40,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:33:40,516 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:40,516 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:33:40,516 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:40,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:40,516 INFO L82 PathProgramCache]: Analyzing trace with hash 15325536, now seen corresponding path program 96 times [2019-08-05 10:33:40,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:40,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:33:40,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:43,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:43,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:33:43,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:33:43,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:33:43,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:33:43,748 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:33:43,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:43,907 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:33:43,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:33:43,907 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:33:43,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:43,908 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:33:43,908 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:33:43,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:33:43,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:33:43,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:33:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:33:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:33:43,911 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 10:33:43,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:43,912 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:33:43,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:33:43,912 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:33:43,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:33:43,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:43,913 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 10:33:43,913 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:43,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:43,913 INFO L82 PathProgramCache]: Analyzing trace with hash 475087750, now seen corresponding path program 97 times [2019-08-05 10:33:43,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:43,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:33:43,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:47,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:47,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:33:47,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:33:47,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:33:47,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:33:47,496 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 10:33:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:47,821 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:33:47,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:33:47,822 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 10:33:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:47,823 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:33:47,823 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:33:47,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:33:47,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:33:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:33:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:33:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:33:47,827 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 10:33:47,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:47,827 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:33:47,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:33:47,827 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:33:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:33:47,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:47,828 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 10:33:47,828 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:47,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:47,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814496, now seen corresponding path program 98 times [2019-08-05 10:33:47,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:47,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:33:47,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:51,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:51,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:33:51,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:33:51,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:33:51,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:33:51,491 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-05 10:33:51,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:51,644 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:33:51,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:33:51,644 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 10:33:51,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:51,645 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:33:51,645 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:33:51,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:33:51,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:33:51,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:33:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:33:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:33:51,648 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 10:33:51,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:51,649 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:33:51,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:33:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:33:51,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:33:51,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:51,650 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 10:33:51,650 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:51,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:51,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670662, now seen corresponding path program 99 times [2019-08-05 10:33:51,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:51,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:33:51,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:55,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:55,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:33:55,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:33:55,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:33:55,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:33:55,353 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-08-05 10:33:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:55,530 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:33:55,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:33:55,530 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 10:33:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:55,531 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:33:55,532 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:33:55,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:33:55,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:33:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:33:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:33:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:33:55,535 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 10:33:55,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:55,535 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:33:55,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:33:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:33:55,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:33:55,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:55,536 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-05 10:33:55,536 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:55,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:55,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080992, now seen corresponding path program 100 times [2019-08-05 10:33:55,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:55,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:33:55,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:59,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:59,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:33:59,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:33:59,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:33:59,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:33:59,104 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-08-05 10:33:59,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:59,254 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 10:33:59,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:33:59,254 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-08-05 10:33:59,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:59,255 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:33:59,255 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:33:59,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:33:59,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:33:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:33:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:33:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:33:59,259 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 10:33:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:59,259 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:33:59,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:33:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:33:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:33:59,260 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:59,260 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-08-05 10:33:59,260 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:59,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:59,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833926, now seen corresponding path program 101 times [2019-08-05 10:33:59,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:59,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:33:59,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:03,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:03,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:34:03,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:34:03,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:34:03,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:34:03,022 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-08-05 10:34:03,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:03,214 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:34:03,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:34:03,214 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-08-05 10:34:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:03,215 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:34:03,216 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:34:03,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:34:03,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:34:03,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:34:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:34:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 10:34:03,219 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-05 10:34:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:03,219 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 10:34:03,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:34:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 10:34:03,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:34:03,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:03,220 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-08-05 10:34:03,220 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:03,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076768, now seen corresponding path program 102 times [2019-08-05 10:34:03,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:03,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:34:03,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:07,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:07,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:07,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:34:07,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:34:07,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:34:07,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:34:07,279 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-08-05 10:34:07,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:07,478 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:34:07,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:34:07,479 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-08-05 10:34:07,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:07,480 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:34:07,480 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:34:07,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:34:07,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:34:07,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:34:07,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:34:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:34:07,483 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-05 10:34:07,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:07,484 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:34:07,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:34:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:34:07,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:34:07,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:07,484 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-08-05 10:34:07,485 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:07,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:07,485 INFO L82 PathProgramCache]: Analyzing trace with hash 748670278, now seen corresponding path program 103 times [2019-08-05 10:34:07,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:07,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:34:07,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:11,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:11,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:34:11,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:34:11,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:34:11,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:34:11,535 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-08-05 10:34:11,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:11,734 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:34:11,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:34:11,735 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-08-05 10:34:11,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:11,736 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:34:11,736 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:34:11,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:34:11,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:34:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:34:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:34:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:34:11,739 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-05 10:34:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:11,739 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:34:11,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:34:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:34:11,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:34:11,739 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:11,740 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 10:34:11,740 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:11,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:11,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938272, now seen corresponding path program 104 times [2019-08-05 10:34:11,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:11,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:34:11,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:16,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:16,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:34:16,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:34:16,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:34:16,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:34:16,338 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-05 10:34:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:16,580 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:34:16,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:34:16,580 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 10:34:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:16,581 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:34:16,582 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:34:16,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:34:16,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:34:16,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:34:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:34:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:34:16,585 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-05 10:34:16,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:16,585 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:34:16,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:34:16,585 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:34:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:34:16,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:16,586 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-05 10:34:16,586 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:16,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:16,587 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492282, now seen corresponding path program 105 times [2019-08-05 10:34:16,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:16,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:34:16,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:20,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:20,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:34:20,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:34:20,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:34:20,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:34:20,738 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-08-05 10:34:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:20,910 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:34:20,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:34:20,911 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-05 10:34:20,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:20,912 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:34:20,912 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:34:20,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:34:20,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:34:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:34:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:34:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:34:20,915 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-05 10:34:20,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:20,916 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:34:20,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:34:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:34:20,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:34:20,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:20,927 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-08-05 10:34:20,927 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:20,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:20,928 INFO L82 PathProgramCache]: Analyzing trace with hash -132755168, now seen corresponding path program 106 times [2019-08-05 10:34:20,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:20,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:34:20,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:24,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:24,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 10:34:24,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 10:34:24,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 10:34:24,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:34:24,927 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-08-05 10:34:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:25,126 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 10:34:25,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:34:25,126 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-08-05 10:34:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:25,126 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:34:25,126 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:34:25,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:34:25,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:34:25,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:34:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:34:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:34:25,129 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-05 10:34:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:25,129 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:34:25,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 10:34:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:34:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:34:25,130 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:25,130 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-08-05 10:34:25,130 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:25,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:25,131 INFO L82 PathProgramCache]: Analyzing trace with hash 179553222, now seen corresponding path program 107 times [2019-08-05 10:34:25,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:25,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:34:25,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:29,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:29,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 10:34:29,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 10:34:29,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 10:34:29,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:34:29,340 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-08-05 10:34:29,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:29,553 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:34:29,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:34:29,553 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-08-05 10:34:29,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:29,553 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:34:29,554 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:34:29,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:34:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:34:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:34:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:34:29,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 10:34:29,555 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-05 10:34:29,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:29,555 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 10:34:29,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 10:34:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 10:34:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:34:29,556 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:29,556 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-08-05 10:34:29,556 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:29,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:29,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178720, now seen corresponding path program 108 times [2019-08-05 10:34:29,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:29,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:34:29,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:33,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:33,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 10:34:33,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 10:34:33,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 10:34:33,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:34:33,882 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-08-05 10:34:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:34,067 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:34:34,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 10:34:34,068 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-08-05 10:34:34,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:34,069 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:34:34,069 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:34:34,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:34:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:34:34,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:34:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:34:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:34:34,072 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-05 10:34:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:34,072 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:34:34,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 10:34:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:34:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:34:34,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:34,073 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-08-05 10:34:34,073 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:34,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:34,074 INFO L82 PathProgramCache]: Analyzing trace with hash 751830790, now seen corresponding path program 109 times [2019-08-05 10:34:34,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:34,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:34:34,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:38,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:38,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 10:34:38,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 10:34:38,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 10:34:38,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:34:38,420 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-08-05 10:34:38,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:38,663 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:34:38,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:34:38,664 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-08-05 10:34:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:38,664 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:34:38,664 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:34:38,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:34:38,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:34:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 10:34:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:34:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 10:34:38,666 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-05 10:34:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:38,667 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 10:34:38,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 10:34:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 10:34:38,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:34:38,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:38,668 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-08-05 10:34:38,668 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:38,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:38,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914144, now seen corresponding path program 110 times [2019-08-05 10:34:38,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:38,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:34:38,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:43,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:43,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 10:34:43,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 10:34:43,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 10:34:43,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:34:43,050 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-08-05 10:34:43,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:43,224 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 10:34:43,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 10:34:43,224 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-08-05 10:34:43,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:43,225 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:34:43,225 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:34:43,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:34:43,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:34:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:34:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:34:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:34:43,228 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-05 10:34:43,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:43,228 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:34:43,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 10:34:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:34:43,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:34:43,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:43,229 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-08-05 10:34:43,229 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:43,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:43,230 INFO L82 PathProgramCache]: Analyzing trace with hash 954759750, now seen corresponding path program 111 times [2019-08-05 10:34:43,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:43,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:34:43,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:47,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:47,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:47,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 10:34:47,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 10:34:47,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 10:34:47,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:34:47,756 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2019-08-05 10:34:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:47,951 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:34:47,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 10:34:47,952 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2019-08-05 10:34:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:47,952 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:34:47,953 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:34:47,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:34:47,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:34:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:34:47,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:34:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:34:47,956 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-05 10:34:47,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:47,956 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:34:47,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 10:34:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:34:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:34:47,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:47,957 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 10:34:47,957 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:47,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:47,957 INFO L82 PathProgramCache]: Analyzing trace with hash -467222688, now seen corresponding path program 112 times [2019-08-05 10:34:47,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:48,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:34:48,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:52,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:52,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:34:52,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:34:52,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:34:52,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:34:52,536 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 10:34:52,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:52,760 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:34:52,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:34:52,760 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 10:34:52,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:52,761 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:34:52,761 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:34:52,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:34:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:34:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:34:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:34:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:34:52,764 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-05 10:34:52,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:52,764 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:34:52,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:34:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:34:52,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:34:52,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:52,765 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2019-08-05 10:34:52,765 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:52,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:52,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005306, now seen corresponding path program 113 times [2019-08-05 10:34:52,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:52,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:34:52,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:57,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:57,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 10:34:57,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 10:34:57,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 10:34:57,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:34:57,667 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2019-08-05 10:34:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:57,858 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:34:57,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 10:34:57,859 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2019-08-05 10:34:57,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:57,859 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:34:57,859 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:34:57,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:34:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:34:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 10:34:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:34:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 10:34:57,863 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-08-05 10:34:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:57,863 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 10:34:57,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 10:34:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 10:34:57,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:34:57,864 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:57,864 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2019-08-05 10:34:57,864 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:57,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:57,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439200, now seen corresponding path program 114 times [2019-08-05 10:34:57,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:57,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:34:57,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:02,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:02,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 10:35:02,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 10:35:02,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 10:35:02,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:35:02,605 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2019-08-05 10:35:02,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:02,828 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 10:35:02,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 10:35:02,829 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2019-08-05 10:35:02,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:02,830 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:35:02,830 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:35:02,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:35:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:35:02,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:35:02,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:35:02,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:35:02,833 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-08-05 10:35:02,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:02,834 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:35:02,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 10:35:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:35:02,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:35:02,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:02,835 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2019-08-05 10:35:02,835 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:02,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:02,835 INFO L82 PathProgramCache]: Analyzing trace with hash 954069190, now seen corresponding path program 115 times [2019-08-05 10:35:02,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:02,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:35:02,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:07,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:07,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:07,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-05 10:35:07,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 10:35:07,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 10:35:07,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:35:07,599 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2019-08-05 10:35:07,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:07,824 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 10:35:07,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 10:35:07,824 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2019-08-05 10:35:07,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:07,825 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:35:07,825 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 10:35:07,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:35:07,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 10:35:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 10:35:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:35:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 10:35:07,829 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-08-05 10:35:07,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:07,829 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 10:35:07,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 10:35:07,829 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 10:35:07,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:35:07,830 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:07,830 INFO L399 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2019-08-05 10:35:07,830 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:07,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:07,830 INFO L82 PathProgramCache]: Analyzing trace with hash -488630048, now seen corresponding path program 116 times [2019-08-05 10:35:07,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:07,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:35:07,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:12,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:12,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-08-05 10:35:12,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-08-05 10:35:12,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-08-05 10:35:12,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:35:12,694 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2019-08-05 10:35:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:12,978 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 10:35:12,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-05 10:35:12,978 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2019-08-05 10:35:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:12,979 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:35:12,979 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:35:12,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:35:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:35:12,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 10:35:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:35:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 10:35:12,982 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2019-08-05 10:35:12,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:12,982 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 10:35:12,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-08-05 10:35:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 10:35:12,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:35:12,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:12,983 INFO L399 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2019-08-05 10:35:12,983 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:12,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:12,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2032333830, now seen corresponding path program 117 times [2019-08-05 10:35:12,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:13,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:35:13,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:18,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:18,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-08-05 10:35:18,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-08-05 10:35:18,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-08-05 10:35:18,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:35:18,049 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2019-08-05 10:35:18,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:18,286 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 10:35:18,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-08-05 10:35:18,287 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2019-08-05 10:35:18,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:18,288 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:35:18,288 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:35:18,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:35:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:35:18,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 10:35:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:35:18,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 10:35:18,291 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2019-08-05 10:35:18,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:18,291 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 10:35:18,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-08-05 10:35:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 10:35:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 10:35:18,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:18,291 INFO L399 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2019-08-05 10:35:18,292 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:18,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:18,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1422164576, now seen corresponding path program 118 times [2019-08-05 10:35:18,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:18,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:35:18,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:35:19,392 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:35:19,392 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:35:19,396 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:35:19,396 INFO L202 PluginConnector]: Adding new model NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:35:19 BoogieIcfgContainer [2019-08-05 10:35:19,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:35:19,399 INFO L168 Benchmark]: Toolchain (without parser) took 240079.88 ms. Allocated memory was 133.7 MB in the beginning and 926.4 MB in the end (delta: 792.7 MB). Free memory was 110.0 MB in the beginning and 451.9 MB in the end (delta: -342.0 MB). Peak memory consumption was 450.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:19,399 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory is still 110.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:35:19,400 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.28 ms. Allocated memory is still 133.7 MB. Free memory was 110.0 MB in the beginning and 107.8 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:35:19,400 INFO L168 Benchmark]: Boogie Preprocessor took 20.05 ms. Allocated memory is still 133.7 MB. Free memory was 107.8 MB in the beginning and 107.0 MB in the end (delta: 872.5 kB). Peak memory consumption was 872.5 kB. Max. memory is 7.1 GB. [2019-08-05 10:35:19,401 INFO L168 Benchmark]: RCFGBuilder took 286.78 ms. Allocated memory is still 133.7 MB. Free memory was 107.0 MB in the beginning and 98.8 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:19,402 INFO L168 Benchmark]: TraceAbstraction took 239731.93 ms. Allocated memory was 133.7 MB in the beginning and 926.4 MB in the end (delta: 792.7 MB). Free memory was 98.4 MB in the beginning and 451.9 MB in the end (delta: -353.6 MB). Peak memory consumption was 439.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:19,404 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 133.7 MB. Free memory is still 110.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.28 ms. Allocated memory is still 133.7 MB. Free memory was 110.0 MB in the beginning and 107.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.05 ms. Allocated memory is still 133.7 MB. Free memory was 107.8 MB in the beginning and 107.0 MB in the end (delta: 872.5 kB). Peak memory consumption was 872.5 kB. Max. memory is 7.1 GB. * RCFGBuilder took 286.78 ms. Allocated memory is still 133.7 MB. Free memory was 107.0 MB in the beginning and 98.8 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239731.93 ms. Allocated memory was 133.7 MB in the beginning and 926.4 MB in the end (delta: 792.7 MB). Free memory was 98.4 MB in the beginning and 451.9 MB in the end (delta: -353.6 MB). Peak memory consumption was 439.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 118,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 239.6s OverallTime, 119 OverallIterations, 118 TraceHistogramMax, 15.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 356 SDtfs, 2 SDslu, 1980 SDs, 0 SdLazy, 9119 SolverSat, 216 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7139 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7021 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 217.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=118, 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, 118 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 219.8s InterpolantComputationTime, 7257 NumberOfCodeBlocks, 7257 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 7139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1692179 SizeOfPredicates, 118 NumberOfNonLiveVariables, 28674 ConjunctsInSsa, 7139 ConjunctsInUnsatCore, 118 InterpolantComputations, 1 PerfectInterpolantSequences, 0/273819 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown