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/BugInterpolantConsolidation01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:39:49,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:39:49,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:39:49,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:39:49,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:39:49,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:39:49,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:39:49,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:39:49,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:39:49,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:39:49,065 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:39:49,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:39:49,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:39:49,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:39:49,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:39:49,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:39:49,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:39:49,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:39:49,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:39:49,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:39:49,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:39:49,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:39:49,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:39:49,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:39:49,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:39:49,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:39:49,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:39:49,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:39:49,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:39:49,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:39:49,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:39:49,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:39:49,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:39:49,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:39:49,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:39:49,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:39:49,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:39:49,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:39:49,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:39:49,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:39:49,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:39:49,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:39:49,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:39:49,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:39:49,153 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:39:49,153 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:39:49,155 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/BugInterpolantConsolidation01.bpl [2019-08-05 10:39:49,156 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/BugInterpolantConsolidation01.bpl' [2019-08-05 10:39:49,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:39:49,194 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:39:49,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:39:49,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:39:49,195 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:39:49,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "BugInterpolantConsolidation01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:49" (1/1) ... [2019-08-05 10:39:49,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "BugInterpolantConsolidation01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:49" (1/1) ... [2019-08-05 10:39:49,229 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:39:49,230 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:39:49,230 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:39:49,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:39:49,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:39:49,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:39:49,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:39:49,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "BugInterpolantConsolidation01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:49" (1/1) ... [2019-08-05 10:39:49,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "BugInterpolantConsolidation01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:49" (1/1) ... [2019-08-05 10:39:49,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "BugInterpolantConsolidation01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:49" (1/1) ... [2019-08-05 10:39:49,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "BugInterpolantConsolidation01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:49" (1/1) ... [2019-08-05 10:39:49,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "BugInterpolantConsolidation01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:49" (1/1) ... [2019-08-05 10:39:49,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "BugInterpolantConsolidation01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:49" (1/1) ... [2019-08-05 10:39:49,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "BugInterpolantConsolidation01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:49" (1/1) ... [2019-08-05 10:39:49,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:39:49,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:39:49,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:39:49,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:39:49,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "BugInterpolantConsolidation01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:49" (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:39:49,325 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:39:49,325 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:39:49,326 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:39:49,542 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:39:49,543 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:39:49,544 INFO L202 PluginConnector]: Adding new model BugInterpolantConsolidation01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:39:49 BoogieIcfgContainer [2019-08-05 10:39:49,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:39:49,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:39:49,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:39:49,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:39:49,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BugInterpolantConsolidation01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:49" (1/2) ... [2019-08-05 10:39:49,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70dba300 and model type BugInterpolantConsolidation01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:39:49, skipping insertion in model container [2019-08-05 10:39:49,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BugInterpolantConsolidation01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:39:49" (2/2) ... [2019-08-05 10:39:49,552 INFO L109 eAbstractionObserver]: Analyzing ICFG BugInterpolantConsolidation01.bpl [2019-08-05 10:39:49,564 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:39:49,573 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:39:49,590 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:39:49,614 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:39:49,615 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:39:49,615 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:39:49,615 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:39:49,615 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:39:49,615 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:39:49,616 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:39:49,616 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:39:49,616 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:39:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:39:49,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:39:49,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:49,639 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:39:49,641 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:49,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:49,647 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-08-05 10:39:49,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:49,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:39:49,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:49,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:49,826 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:39:49,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:39:49,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:39:49,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:39:49,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:39:49,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:39:49,850 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 4 states. [2019-08-05 10:39:50,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:50,042 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:39:50,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:39:50,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 10:39:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:50,056 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:39:50,057 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:39:50,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:39:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:39:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 10:39:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:39:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:39:50,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-08-05 10:39:50,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:50,107 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:39:50,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:39:50,107 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:39:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:39:50,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:50,110 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:39:50,111 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:50,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:50,113 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-08-05 10:39:50,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:50,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:39:50,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:50,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:50,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:50,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:39:50,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:39:50,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:39:50,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:39:50,220 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:39:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:50,325 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:39:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:39:50,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:39:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:50,326 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:39:50,327 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:39:50,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:39:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:39:50,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-08-05 10:39:50,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:39:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:39:50,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-08-05 10:39:50,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:50,331 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:39:50,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:39:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:39:50,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:39:50,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:50,333 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-08-05 10:39:50,333 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:50,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-08-05 10:39:50,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:50,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:39:50,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:50,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:50,440 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:39:50,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:50,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:39:50,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:39:50,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:39:50,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:39:50,442 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-08-05 10:39:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:50,734 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:39:50,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:39:50,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 10:39:50,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:50,735 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:39:50,736 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:39:50,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:39:50,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:39:50,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 10:39:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:39:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:39:50,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 10:39:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:50,739 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:39:50,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:39:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:39:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:39:50,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:50,740 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-08-05 10:39:50,740 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:50,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:50,741 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-08-05 10:39:50,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:50,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:39:50,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:50,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:50,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:50,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:39:50,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:39:50,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:39:50,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:39:50,883 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2019-08-05 10:39:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:51,032 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:39:51,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:39:51,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-05 10:39:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:51,034 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:39:51,034 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:39:51,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:39:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:39:51,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-08-05 10:39:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:39:51,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:39:51,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 10:39:51,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:51,038 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:39:51,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:39:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:39:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:39:51,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:51,039 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-08-05 10:39:51,039 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:51,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:51,039 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-08-05 10:39:51,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:51,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:39:51,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:51,151 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:51,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:51,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:39:51,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:39:51,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:39:51,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:39:51,164 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2019-08-05 10:39:51,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:51,362 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:39:51,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:39:51,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-08-05 10:39:51,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:51,364 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:39:51,365 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:39:51,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:39:51,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:39:51,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-08-05 10:39:51,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:39:51,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:39:51,369 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 10:39:51,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:51,370 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:39:51,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:39:51,370 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:39:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:39:51,370 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:51,371 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-08-05 10:39:51,371 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:51,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:51,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-08-05 10:39:51,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:51,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:39:51,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:51,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:51,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:51,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:39:51,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:39:51,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:39:51,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:39:51,796 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 9 states. [2019-08-05 10:39:51,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:51,982 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:39:51,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:39:51,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-08-05 10:39:51,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:51,983 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:39:51,983 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:39:51,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:39:51,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:39:51,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-08-05 10:39:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:39:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:39:51,987 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 10:39:51,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:51,987 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:39:51,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:39:51,988 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:39:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:39:51,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:51,988 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-08-05 10:39:51,989 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:51,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:51,989 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-08-05 10:39:51,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:52,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:39:52,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:52,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:52,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:52,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:39:52,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:39:52,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:39:52,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:39:52,192 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-08-05 10:39:52,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:52,333 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:39:52,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:39:52,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-08-05 10:39:52,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:52,335 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:39:52,335 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:39:52,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:39:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:39:52,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-08-05 10:39:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:39:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:39:52,339 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-08-05 10:39:52,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:52,340 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:39:52,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:39:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:39:52,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:39:52,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:52,341 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-08-05 10:39:52,341 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:52,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:52,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-08-05 10:39:52,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:52,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:39:52,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:52,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:52,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:52,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:39:52,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:39:52,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:39:52,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:39:52,503 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-08-05 10:39:52,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:52,736 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:39:52,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:39:52,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-08-05 10:39:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:52,738 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:39:52,739 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:39:52,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:39:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:39:52,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-08-05 10:39:52,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:39:52,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:39:52,742 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-08-05 10:39:52,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:52,743 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:39:52,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:39:52,743 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:39:52,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:39:52,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:52,744 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-08-05 10:39:52,744 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:52,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:52,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-08-05 10:39:52,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:52,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:39:52,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:52,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:52,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:52,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:39:52,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:39:52,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:39:52,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:39:52,891 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 12 states. [2019-08-05 10:39:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:53,170 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:39:53,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:39:53,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-08-05 10:39:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:53,172 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:39:53,172 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:39:53,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:39:53,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:39:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-08-05 10:39:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:39:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:39:53,176 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-08-05 10:39:53,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:53,177 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:39:53,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:39:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:39:53,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:39:53,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:53,178 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-08-05 10:39:53,178 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:53,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:53,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-08-05 10:39:53,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:53,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:39:53,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:53,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:53,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:53,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:39:53,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:39:53,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:39:53,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:39:53,419 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 13 states. [2019-08-05 10:39:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:53,631 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:39:53,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:39:53,632 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-08-05 10:39:53,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:53,633 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:39:53,633 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:39:53,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:39:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:39:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-08-05 10:39:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:39:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:39:53,637 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-08-05 10:39:53,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:53,638 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:39:53,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:39:53,638 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:39:53,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:39:53,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:53,639 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-08-05 10:39:53,639 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:53,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:53,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-08-05 10:39:53,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:53,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:39:53,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:53,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:53,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:53,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:39:53,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:39:53,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:39:53,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:39:53,806 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 14 states. [2019-08-05 10:39:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:54,086 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:39:54,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:39:54,087 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-08-05 10:39:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:54,088 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:39:54,088 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:39:54,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:39:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:39:54,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-08-05 10:39:54,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:39:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:39:54,095 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-08-05 10:39:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:54,096 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:39:54,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:39:54,096 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:39:54,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:39:54,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:54,098 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-08-05 10:39:54,098 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:54,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:54,098 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-08-05 10:39:54,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:54,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:39:54,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:54,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:54,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:54,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:39:54,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:39:54,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:39:54,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:39:54,396 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 15 states. [2019-08-05 10:39:55,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:55,021 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:39:55,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:39:55,022 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-08-05 10:39:55,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:55,023 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:39:55,023 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:39:55,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:39:55,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:39:55,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-08-05 10:39:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:39:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:39:55,028 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-08-05 10:39:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:55,028 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:39:55,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:39:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:39:55,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:39:55,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:55,030 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-08-05 10:39:55,030 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:55,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:55,030 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-08-05 10:39:55,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:55,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:39:55,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:55,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:55,224 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:55,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:55,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:39:55,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:39:55,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:39:55,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:39:55,226 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 16 states. [2019-08-05 10:39:55,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:55,589 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:39:55,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:39:55,589 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-08-05 10:39:55,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:55,590 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:39:55,590 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:39:55,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:39:55,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:39:55,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-08-05 10:39:55,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:39:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:39:55,594 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-08-05 10:39:55,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:55,594 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:39:55,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:39:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:39:55,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:39:55,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:55,596 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-08-05 10:39:55,596 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:55,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:55,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-08-05 10:39:55,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:55,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:39:55,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:55,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:55,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:55,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:39:55,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:39:55,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:39:55,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:39:55,830 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 17 states. [2019-08-05 10:39:56,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:56,045 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:39:56,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:39:56,046 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-08-05 10:39:56,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:56,047 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:39:56,047 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:39:56,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:39:56,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:39:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-08-05 10:39:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:39:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:39:56,052 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-08-05 10:39:56,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:56,053 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:39:56,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:39:56,053 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:39:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:39:56,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:56,054 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-08-05 10:39:56,054 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:56,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:56,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-08-05 10:39:56,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:56,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:39:56,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:56,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:56,291 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:39:56,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:56,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:39:56,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:39:56,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:39:56,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:39:56,292 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 18 states. [2019-08-05 10:39:56,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:56,552 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:39:56,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:39:56,552 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-08-05 10:39:56,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:56,553 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:39:56,553 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:39:56,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:39:56,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:39:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-08-05 10:39:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:39:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:39:56,558 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-08-05 10:39:56,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:56,558 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:39:56,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:39:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:39:56,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:39:56,559 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:56,559 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-08-05 10:39:56,560 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:56,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:56,560 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-08-05 10:39:56,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:56,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:39:56,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:56,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:56,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:56,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:39:56,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:39:56,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:39:56,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:39:56,771 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 19 states. [2019-08-05 10:39:57,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:57,066 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:39:57,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:39:57,067 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2019-08-05 10:39:57,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:57,067 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:39:57,068 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:39:57,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:39:57,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:39:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-08-05 10:39:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:39:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:39:57,075 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-08-05 10:39:57,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:57,076 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:39:57,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:39:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:39:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:39:57,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:57,077 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-08-05 10:39:57,077 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:57,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:57,077 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-08-05 10:39:57,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:57,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:39:57,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:57,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:57,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:57,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:39:57,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:39:57,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:39:57,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:39:57,362 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 20 states. [2019-08-05 10:39:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:57,676 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:39:57,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:39:57,676 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2019-08-05 10:39:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:57,677 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:39:57,677 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:39:57,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:39:57,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:39:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-08-05 10:39:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:39:57,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:39:57,682 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-08-05 10:39:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:57,682 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:39:57,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:39:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:39:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:39:57,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:57,683 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-08-05 10:39:57,683 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:57,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:57,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-08-05 10:39:57,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:57,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:39:57,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:58,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:58,336 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:58,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:58,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:39:58,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:39:58,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:39:58,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:39:58,338 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 21 states. [2019-08-05 10:39:58,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:58,701 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:39:58,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:39:58,702 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2019-08-05 10:39:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:58,703 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:39:58,703 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:39:58,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:39:58,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:39:58,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-08-05 10:39:58,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:39:58,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:39:58,708 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-08-05 10:39:58,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:58,709 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:39:58,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:39:58,709 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:39:58,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:39:58,710 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:58,710 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-08-05 10:39:58,710 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:58,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:58,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-08-05 10:39:58,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:58,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:39:58,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:58,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:58,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:58,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:39:58,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:39:58,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:39:58,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:39:58,939 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 22 states. [2019-08-05 10:39:59,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:59,677 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:39:59,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:39:59,678 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2019-08-05 10:39:59,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:59,678 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:39:59,679 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:39:59,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:39:59,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:39:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-08-05 10:39:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:39:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:39:59,682 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-08-05 10:39:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:59,682 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:39:59,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:39:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:39:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:39:59,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:59,683 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-08-05 10:39:59,683 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:59,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:59,684 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-08-05 10:39:59,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:59,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:39:59,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:00,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:00,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:00,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:40:00,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:40:00,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:40:00,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:40:00,071 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 23 states. [2019-08-05 10:40:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:00,880 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:40:00,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:40:00,881 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 41 [2019-08-05 10:40:00,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:00,881 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:40:00,882 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:40:00,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:40:00,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:40:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-08-05 10:40:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:40:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:40:00,887 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-08-05 10:40:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:00,887 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:40:00,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:40:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:40:00,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:40:00,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:00,889 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-08-05 10:40:00,889 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:00,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:00,889 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-08-05 10:40:00,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:00,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:40:00,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:01,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:01,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:01,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:40:01,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:40:01,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:40:01,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:40:01,379 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 24 states. [2019-08-05 10:40:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:01,815 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:40:01,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:40:01,815 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2019-08-05 10:40:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:01,816 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:40:01,816 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:40:01,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=759, Invalid=1221, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:40:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:40:01,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-08-05 10:40:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:40:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:40:01,822 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-08-05 10:40:01,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:01,822 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:40:01,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:40:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:40:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:40:01,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:01,823 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-08-05 10:40:01,823 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:01,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:01,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-08-05 10:40:01,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:01,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:40:01,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:02,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:02,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:02,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:40:02,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:40:02,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:40:02,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:40:02,169 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 25 states. [2019-08-05 10:40:02,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:02,527 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:40:02,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:40:02,529 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 45 [2019-08-05 10:40:02,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:02,530 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:40:02,530 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:40:02,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:40:02,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:40:02,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-08-05 10:40:02,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:40:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:40:02,535 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-08-05 10:40:02,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:02,535 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:40:02,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:40:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:40:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:40:02,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:02,536 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-08-05 10:40:02,536 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:02,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:02,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-08-05 10:40:02,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:02,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:40:02,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:02,969 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:02,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:02,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:40:02,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:40:02,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:40:02,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:40:02,981 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 26 states. [2019-08-05 10:40:03,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:03,675 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:40:03,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:40:03,675 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2019-08-05 10:40:03,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:03,676 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:40:03,676 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:40:03,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=900, Invalid=1452, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:40:03,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:40:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-08-05 10:40:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:40:03,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:40:03,681 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-08-05 10:40:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:03,682 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:40:03,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:40:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:40:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:40:03,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:03,683 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-08-05 10:40:03,683 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:03,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:03,683 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-08-05 10:40:03,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:03,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:40:03,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:04,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:04,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:04,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:40:04,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:40:04,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:40:04,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:40:04,423 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 27 states. [2019-08-05 10:40:04,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:04,861 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:40:04,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:40:04,862 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 49 [2019-08-05 10:40:04,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:04,863 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:40:04,863 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:40:04,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:40:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:40:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-08-05 10:40:04,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:40:04,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:40:04,867 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-08-05 10:40:04,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:04,868 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:40:04,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:40:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:40:04,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:40:04,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:04,869 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-08-05 10:40:04,869 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:04,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:04,869 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-08-05 10:40:04,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:04,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:40:04,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:05,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:05,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:05,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:40:05,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:40:05,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:40:05,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:40:05,192 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 28 states. [2019-08-05 10:40:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:05,681 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:40:05,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:40:05,691 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2019-08-05 10:40:05,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:05,692 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:40:05,692 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:40:05,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1053, Invalid=1703, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:40:05,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:40:05,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-08-05 10:40:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:40:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:40:05,696 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-08-05 10:40:05,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:05,696 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:40:05,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:40:05,697 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:40:05,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:40:05,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:05,697 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-08-05 10:40:05,698 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:05,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:05,698 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-08-05 10:40:05,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:05,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:40:05,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:06,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:06,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:06,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:40:06,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:40:06,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:40:06,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:40:06,074 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 29 states. [2019-08-05 10:40:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:06,582 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:40:06,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:40:06,583 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 53 [2019-08-05 10:40:06,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:06,583 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:40:06,584 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:40:06,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:40:06,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:40:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-08-05 10:40:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:40:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:40:06,591 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-08-05 10:40:06,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:06,591 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:40:06,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:40:06,591 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:40:06,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:40:06,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:06,592 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-08-05 10:40:06,592 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:06,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:06,592 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-08-05 10:40:06,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:06,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:40:06,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:07,033 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:07,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:07,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:40:07,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:40:07,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:40:07,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:40:07,049 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 30 states. [2019-08-05 10:40:07,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:07,564 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:40:07,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:40:07,565 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 55 [2019-08-05 10:40:07,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:07,565 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:40:07,566 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:40:07,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1218, Invalid=1974, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:40:07,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:40:07,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-08-05 10:40:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:40:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:40:07,570 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-08-05 10:40:07,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:07,570 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:40:07,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:40:07,570 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:40:07,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:40:07,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:07,571 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-08-05 10:40:07,571 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:07,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:07,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-08-05 10:40:07,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:07,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:40:07,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:08,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:08,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:08,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:40:08,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:40:08,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:40:08,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:40:08,122 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 31 states. [2019-08-05 10:40:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:08,912 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:40:08,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:40:08,912 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 57 [2019-08-05 10:40:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:08,913 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:40:08,913 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:40:08,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:40:08,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:40:08,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-08-05 10:40:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:40:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:40:08,917 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-08-05 10:40:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:08,917 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:40:08,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:40:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:40:08,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:40:08,918 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:08,918 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-08-05 10:40:08,918 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:08,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:08,919 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-08-05 10:40:08,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:08,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:40:08,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:09,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:09,376 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:09,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:09,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:40:09,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:40:09,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:40:09,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:40:09,378 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 32 states. [2019-08-05 10:40:09,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:09,889 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:40:09,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:40:09,890 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2019-08-05 10:40:09,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:09,890 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:40:09,891 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:40:09,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1395, Invalid=2265, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:40:09,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:40:09,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-08-05 10:40:09,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:40:09,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:40:09,895 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-08-05 10:40:09,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:09,895 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:40:09,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:40:09,895 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:40:09,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:40:09,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:09,896 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-08-05 10:40:09,896 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:09,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:09,896 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-08-05 10:40:09,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:09,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:40:09,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:10,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:10,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:10,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:40:10,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:40:10,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:40:10,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:40:10,382 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 33 states. [2019-08-05 10:40:10,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:10,926 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:40:10,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:40:10,927 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 61 [2019-08-05 10:40:10,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:10,928 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:40:10,928 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:40:10,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:40:10,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:40:10,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-08-05 10:40:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:40:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:40:10,932 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-08-05 10:40:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:10,933 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:40:10,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:40:10,933 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:40:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:40:10,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:10,933 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-08-05 10:40:10,933 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:10,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:10,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-08-05 10:40:10,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:10,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:40:10,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:11,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:11,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:11,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:40:11,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:40:11,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:40:11,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:40:11,367 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 34 states. [2019-08-05 10:40:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:11,996 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:40:11,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:40:11,997 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 63 [2019-08-05 10:40:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:11,998 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:40:11,998 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:40:12,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1584, Invalid=2576, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:40:12,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:40:12,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-08-05 10:40:12,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:40:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:40:12,001 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-08-05 10:40:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:12,002 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:40:12,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:40:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:40:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:40:12,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:12,002 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-08-05 10:40:12,003 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:12,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:12,003 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-08-05 10:40:12,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:12,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:40:12,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:12,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:12,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:12,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:40:12,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:40:12,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:40:12,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:40:12,497 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 35 states. [2019-08-05 10:40:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:13,173 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:40:13,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:40:13,174 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 65 [2019-08-05 10:40:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:13,175 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:40:13,175 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:40:13,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:40:13,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:40:13,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-08-05 10:40:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:40:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:40:13,179 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-08-05 10:40:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:13,179 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:40:13,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:40:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:40:13,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:40:13,180 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:13,180 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-08-05 10:40:13,180 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:13,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:13,181 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-08-05 10:40:13,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:13,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:40:13,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:13,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:13,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:13,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:13,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:40:13,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:40:13,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:40:13,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:40:13,992 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 36 states. [2019-08-05 10:40:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:14,616 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:40:14,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:40:14,617 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2019-08-05 10:40:14,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:14,618 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:40:14,618 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:40:14,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1785, Invalid=2907, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:40:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:40:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-08-05 10:40:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:40:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:40:14,622 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-08-05 10:40:14,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:14,622 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:40:14,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:40:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:40:14,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:40:14,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:14,623 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-08-05 10:40:14,624 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:14,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:14,624 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-08-05 10:40:14,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:14,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:40:14,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:15,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:15,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:15,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:40:15,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:40:15,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:40:15,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:40:15,192 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 37 states. [2019-08-05 10:40:15,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:15,990 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:40:15,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:40:15,991 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 69 [2019-08-05 10:40:15,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:15,992 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:40:15,992 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:40:15,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:40:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:40:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-08-05 10:40:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:40:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:40:15,996 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-08-05 10:40:15,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:15,996 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:40:15,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:40:15,996 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:40:15,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:40:15,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:15,997 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-08-05 10:40:15,997 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:15,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:15,997 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2019-08-05 10:40:15,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:16,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:40:16,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:17,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:17,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:17,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:40:17,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:40:17,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:40:17,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:40:17,070 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 38 states. [2019-08-05 10:40:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:17,807 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:40:17,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:40:17,807 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 71 [2019-08-05 10:40:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:17,808 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:40:17,808 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:40:17,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1998, Invalid=3258, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:40:17,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:40:17,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-08-05 10:40:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:40:17,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:40:17,811 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-08-05 10:40:17,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:17,812 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:40:17,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:40:17,812 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:40:17,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:40:17,812 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:17,812 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-08-05 10:40:17,813 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:17,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:17,813 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2019-08-05 10:40:17,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:17,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:40:17,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:18,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:18,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:18,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:40:18,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:40:18,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:40:18,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:40:18,452 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 39 states. [2019-08-05 10:40:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:19,475 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:40:19,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:40:19,475 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 73 [2019-08-05 10:40:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:19,476 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:40:19,476 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:40:19,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:40:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:40:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-08-05 10:40:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:40:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:40:19,479 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-08-05 10:40:19,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:19,479 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:40:19,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:40:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:40:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:40:19,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:19,480 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-08-05 10:40:19,480 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:19,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:19,480 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2019-08-05 10:40:19,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:19,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:40:19,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:21,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:21,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:21,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:40:21,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:40:21,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:40:21,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:40:21,529 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 40 states. [2019-08-05 10:40:22,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:22,287 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:40:22,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:40:22,288 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 75 [2019-08-05 10:40:22,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:22,289 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:40:22,289 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:40:22,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2223, Invalid=3629, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:40:22,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:40:22,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-08-05 10:40:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:40:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:40:22,293 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-08-05 10:40:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:22,294 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:40:22,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:40:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:40:22,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:40:22,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:22,294 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-08-05 10:40:22,295 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:22,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:22,295 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2019-08-05 10:40:22,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:22,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:40:22,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:22,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:22,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:22,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:40:22,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:40:22,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:40:22,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:40:22,872 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 41 states. [2019-08-05 10:40:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:23,945 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:40:23,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:40:23,945 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 77 [2019-08-05 10:40:23,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:23,946 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:40:23,946 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:40:23,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:40:23,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:40:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-08-05 10:40:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:40:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:40:23,950 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-08-05 10:40:23,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:23,951 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:40:23,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:40:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:40:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:40:23,951 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:23,951 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-08-05 10:40:23,952 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:23,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:23,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2019-08-05 10:40:23,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:23,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:40:23,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:24,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:24,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:24,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:40:24,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:40:24,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:40:24,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:40:24,610 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 42 states. [2019-08-05 10:40:25,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:25,444 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:40:25,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:40:25,444 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 79 [2019-08-05 10:40:25,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:25,445 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:40:25,445 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:40:25,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2460, Invalid=4020, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:40:25,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:40:25,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-08-05 10:40:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:40:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:40:25,449 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-08-05 10:40:25,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:25,450 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:40:25,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:40:25,450 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:40:25,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:40:25,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:25,451 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-08-05 10:40:25,451 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:25,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:25,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2019-08-05 10:40:25,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:25,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:40:25,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:26,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:26,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:26,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:40:26,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:40:26,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:40:26,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:40:26,136 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 43 states. [2019-08-05 10:40:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:27,119 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:40:27,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:40:27,120 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 81 [2019-08-05 10:40:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:27,121 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:40:27,121 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:40:27,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:40:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:40:27,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-08-05 10:40:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:40:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:40:27,125 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-08-05 10:40:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:27,125 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:40:27,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:40:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:40:27,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:40:27,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:27,126 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-08-05 10:40:27,126 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:27,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:27,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2019-08-05 10:40:27,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:27,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:40:27,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:27,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:27,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:27,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:27,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:40:27,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:40:27,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:40:27,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:40:27,808 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 44 states. [2019-08-05 10:40:28,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:28,838 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:40:28,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:40:28,838 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 83 [2019-08-05 10:40:28,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:28,839 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:40:28,839 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:40:28,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2709, Invalid=4431, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:40:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:40:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-08-05 10:40:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:40:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:40:28,842 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-08-05 10:40:28,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:28,843 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:40:28,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:40:28,843 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:40:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:40:28,844 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:28,844 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-08-05 10:40:28,844 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:28,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2019-08-05 10:40:28,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:28,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:40:28,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:29,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:29,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:29,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:40:29,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:40:29,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:40:29,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:40:29,734 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 45 states. [2019-08-05 10:40:30,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:30,684 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:40:30,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:40:30,685 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 85 [2019-08-05 10:40:30,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:30,686 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:40:30,686 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:40:30,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:40:30,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:40:30,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-08-05 10:40:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:40:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:40:30,689 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-08-05 10:40:30,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:30,689 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:40:30,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:40:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:40:30,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:40:30,690 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:30,690 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-08-05 10:40:30,690 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:30,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:30,691 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2019-08-05 10:40:30,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:30,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:40:30,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:31,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:31,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:31,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:40:31,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:40:31,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:40:31,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:40:31,487 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 46 states. [2019-08-05 10:40:32,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:32,497 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:40:32,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:40:32,498 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 87 [2019-08-05 10:40:32,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:32,499 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:40:32,499 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:40:32,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2970, Invalid=4862, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:40:32,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:40:32,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-08-05 10:40:32,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:40:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:40:32,503 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-08-05 10:40:32,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:32,503 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:40:32,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:40:32,503 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:40:32,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:40:32,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:32,504 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-08-05 10:40:32,504 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:32,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:32,504 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2019-08-05 10:40:32,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:32,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:40:32,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:33,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:33,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:33,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:33,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:40:33,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:40:33,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:40:33,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:40:33,395 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 47 states. [2019-08-05 10:40:34,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:34,869 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:40:34,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:40:34,869 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 89 [2019-08-05 10:40:34,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:34,870 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:40:34,870 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:40:34,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:40:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:40:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-08-05 10:40:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:40:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:40:34,874 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-08-05 10:40:34,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:34,874 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:40:34,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:40:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:40:34,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:40:34,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:34,875 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-08-05 10:40:34,875 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:34,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:34,876 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2019-08-05 10:40:34,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:34,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:40:34,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:35,664 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:35,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:35,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:35,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:40:35,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:40:35,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:40:35,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:40:35,692 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 48 states. [2019-08-05 10:40:36,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:36,743 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:40:36,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:40:36,744 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 91 [2019-08-05 10:40:36,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:36,745 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:40:36,745 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:40:36,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3243, Invalid=5313, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:40:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:40:36,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-08-05 10:40:36,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:40:36,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:40:36,749 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-08-05 10:40:36,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:36,749 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:40:36,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:40:36,750 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:40:36,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:40:36,750 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:36,750 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-08-05 10:40:36,751 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:36,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:36,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2019-08-05 10:40:36,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:36,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:40:36,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:37,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:37,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:37,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:40:37,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:40:37,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:40:37,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:40:37,819 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 49 states. [2019-08-05 10:40:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:38,974 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:40:38,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:40:38,974 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 93 [2019-08-05 10:40:38,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:38,975 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:40:38,975 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:40:38,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:40:38,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:40:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-08-05 10:40:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:40:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:40:38,979 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-08-05 10:40:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:38,979 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:40:38,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:40:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:40:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:40:38,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:38,980 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-08-05 10:40:38,980 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2019-08-05 10:40:38,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:38,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:40:39,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:40,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:40,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:40,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:40:40,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:40:40,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:40:40,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:40:40,136 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 50 states. [2019-08-05 10:40:41,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:41,287 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:40:41,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:40:41,287 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 95 [2019-08-05 10:40:41,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:41,288 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:40:41,289 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:40:41,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3528, Invalid=5784, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:40:41,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:40:41,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-08-05 10:40:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:40:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:40:41,292 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-08-05 10:40:41,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:41,293 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:40:41,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:40:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:40:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:40:41,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:41,293 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-08-05 10:40:41,294 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:41,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:41,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2019-08-05 10:40:41,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:41,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:40:41,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:42,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:42,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:42,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:40:42,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:40:42,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:40:42,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:40:42,286 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 51 states. [2019-08-05 10:40:43,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:43,596 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:40:43,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:40:43,599 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 97 [2019-08-05 10:40:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:43,600 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:40:43,600 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:40:43,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:40:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:40:43,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-08-05 10:40:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:40:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:40:43,605 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-08-05 10:40:43,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:43,605 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:40:43,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:40:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:40:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:40:43,606 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:43,606 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-08-05 10:40:43,606 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:43,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:43,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2019-08-05 10:40:43,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:43,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:40:43,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:44,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:45,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:45,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:40:45,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:40:45,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:40:45,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:40:45,025 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 52 states. [2019-08-05 10:40:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:46,423 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:40:46,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:40:46,423 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 99 [2019-08-05 10:40:46,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:46,425 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:40:46,425 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:40:46,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3825, Invalid=6275, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:40:46,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:40:46,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-08-05 10:40:46,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:40:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:40:46,428 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-08-05 10:40:46,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:46,428 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:40:46,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:40:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:40:46,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:40:46,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:46,429 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-08-05 10:40:46,430 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:46,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:46,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2019-08-05 10:40:46,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:46,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:40:46,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:47,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:47,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:47,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:40:47,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:40:47,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:40:47,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:40:47,556 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 53 states. [2019-08-05 10:40:50,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:50,017 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 10:40:50,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:40:50,018 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 101 [2019-08-05 10:40:50,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:50,019 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:40:50,020 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:40:50,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:40:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:40:50,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-08-05 10:40:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:40:50,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:40:50,023 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-08-05 10:40:50,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:50,024 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:40:50,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:40:50,024 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:40:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:40:50,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:50,025 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2019-08-05 10:40:50,025 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:50,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:50,025 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2019-08-05 10:40:50,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:50,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:40:50,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:51,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:51,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:51,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:40:51,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:40:51,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:40:51,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:40:51,414 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 54 states. [2019-08-05 10:40:53,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:53,540 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:40:53,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:40:53,541 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 103 [2019-08-05 10:40:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:53,543 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:40:53,543 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:40:53,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4134, Invalid=6786, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:40:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:40:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-08-05 10:40:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:40:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 10:40:53,546 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-08-05 10:40:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:53,546 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 10:40:53,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:40:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 10:40:53,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:40:53,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:53,547 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2019-08-05 10:40:53,548 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:53,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:53,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2019-08-05 10:40:53,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:53,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:40:53,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:54,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:54,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:54,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:40:54,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:40:54,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:40:54,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:40:54,994 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 55 states. [2019-08-05 10:40:56,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:56,372 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:40:56,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:40:56,373 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 105 [2019-08-05 10:40:56,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:56,374 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:40:56,374 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:40:56,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:40:56,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:40:56,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-08-05 10:40:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:40:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:40:56,379 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-08-05 10:40:56,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:56,379 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:40:56,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:40:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:40:56,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:40:56,380 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:56,380 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2019-08-05 10:40:56,380 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:56,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:56,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2019-08-05 10:40:56,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:56,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:40:56,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:57,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:40:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:57,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:57,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:40:57,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:40:57,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:40:57,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:40:57,545 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 56 states. [2019-08-05 10:40:58,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:58,943 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 10:40:58,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:40:58,943 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 107 [2019-08-05 10:40:58,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:58,945 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:40:58,945 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:40:58,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4455, Invalid=7317, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:40:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:40:58,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-08-05 10:40:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:40:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:40:58,949 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-08-05 10:40:58,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:58,949 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:40:58,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:40:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:40:58,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:40:58,950 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:58,950 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2019-08-05 10:40:58,950 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:58,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:58,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2019-08-05 10:40:58,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:58,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:40:58,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:00,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:00,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:00,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:41:00,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:41:00,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:41:00,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:41:00,448 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 57 states. [2019-08-05 10:41:01,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:01,878 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:41:01,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:41:01,879 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 109 [2019-08-05 10:41:01,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:01,880 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:41:01,880 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:41:01,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4620, Invalid=7590, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:41:01,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:41:01,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-08-05 10:41:01,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:41:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 10:41:01,884 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-08-05 10:41:01,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:01,884 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 10:41:01,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:41:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 10:41:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:41:01,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:01,885 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2019-08-05 10:41:01,885 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:01,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:01,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2019-08-05 10:41:01,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:01,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:41:01,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:03,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:03,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:03,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:41:03,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:41:03,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:41:03,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:41:03,159 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 58 states. [2019-08-05 10:41:04,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:04,941 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 10:41:04,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:41:04,942 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 111 [2019-08-05 10:41:04,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:04,943 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:41:04,943 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:41:04,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4788, Invalid=7868, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:41:04,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:41:04,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-08-05 10:41:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:41:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 10:41:04,947 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-08-05 10:41:04,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:04,947 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 10:41:04,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:41:04,947 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 10:41:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:41:04,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:04,948 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2019-08-05 10:41:04,948 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:04,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:04,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2019-08-05 10:41:04,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:04,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:41:04,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:06,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:06,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:06,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:41:06,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:41:06,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:41:06,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1655, Invalid=1767, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:41:06,129 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 59 states. [2019-08-05 10:41:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:07,788 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:41:07,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:41:07,788 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 113 [2019-08-05 10:41:07,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:07,789 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:41:07,790 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:41:07,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4959, Invalid=8151, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:41:07,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:41:07,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-08-05 10:41:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:41:07,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:41:07,794 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-08-05 10:41:07,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:07,794 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:41:07,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:41:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:41:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:41:07,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:07,795 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2019-08-05 10:41:07,795 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:07,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:07,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2019-08-05 10:41:07,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:07,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:41:07,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:09,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:09,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:09,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:09,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:41:09,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:41:09,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:41:09,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:41:09,150 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 60 states. [2019-08-05 10:41:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:10,981 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 10:41:10,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:41:10,982 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 115 [2019-08-05 10:41:10,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:10,983 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:41:10,983 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:41:10,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5133, Invalid=8439, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:41:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:41:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-08-05 10:41:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:41:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 10:41:10,986 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-08-05 10:41:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:10,986 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 10:41:10,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:41:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 10:41:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:41:10,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:10,987 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2019-08-05 10:41:10,988 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:10,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:10,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2019-08-05 10:41:10,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:11,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:41:11,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:12,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:12,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:12,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:41:12,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:41:12,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:41:12,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1772, Invalid=1888, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:41:12,205 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 61 states. [2019-08-05 10:41:13,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:13,851 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 10:41:13,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:41:13,852 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 117 [2019-08-05 10:41:13,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:13,853 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:41:13,853 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:41:13,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=5310, Invalid=8732, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:41:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:41:13,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-08-05 10:41:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:41:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 10:41:13,857 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-08-05 10:41:13,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:13,857 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 10:41:13,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:41:13,857 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 10:41:13,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:41:13,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:13,858 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2019-08-05 10:41:13,858 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:13,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:13,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2019-08-05 10:41:13,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:13,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:41:13,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:15,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:15,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:15,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:41:15,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:41:15,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:41:15,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:41:15,548 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 62 states. [2019-08-05 10:41:17,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:17,390 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-08-05 10:41:17,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:41:17,390 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 119 [2019-08-05 10:41:17,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:17,391 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:41:17,392 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:41:17,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1769 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5490, Invalid=9030, Unknown=0, NotChecked=0, Total=14520 [2019-08-05 10:41:17,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:41:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-08-05 10:41:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:41:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 10:41:17,395 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-08-05 10:41:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:17,396 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 10:41:17,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:41:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 10:41:17,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 10:41:17,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:17,397 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2019-08-05 10:41:17,397 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:17,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:17,397 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2019-08-05 10:41:17,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:17,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:41:17,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:19,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:19,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:19,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:19,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:41:19,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:41:19,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:41:19,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:41:19,588 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 63 states. [2019-08-05 10:41:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:21,611 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-08-05 10:41:21,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:41:21,612 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 121 [2019-08-05 10:41:21,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:21,613 INFO L225 Difference]: With dead ends: 125 [2019-08-05 10:41:21,613 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 10:41:21,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5673, Invalid=9333, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 10:41:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 10:41:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-08-05 10:41:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:41:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-08-05 10:41:21,616 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-08-05 10:41:21,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:21,617 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-08-05 10:41:21,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:41:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-08-05 10:41:21,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 10:41:21,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:21,618 INFO L399 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2019-08-05 10:41:21,618 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:21,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:21,618 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2019-08-05 10:41:21,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:21,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:41:21,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:22,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:22,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:22,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:41:22,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:41:22,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:41:22,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:41:22,991 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 64 states. [2019-08-05 10:41:24,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:24,791 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-08-05 10:41:24,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:41:24,791 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 123 [2019-08-05 10:41:24,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:24,792 INFO L225 Difference]: With dead ends: 127 [2019-08-05 10:41:24,792 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:41:24,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=5859, Invalid=9641, Unknown=0, NotChecked=0, Total=15500 [2019-08-05 10:41:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:41:24,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-08-05 10:41:24,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 10:41:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-08-05 10:41:24,796 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-08-05 10:41:24,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:24,796 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-08-05 10:41:24,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:41:24,796 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-08-05 10:41:24,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 10:41:24,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:24,797 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2019-08-05 10:41:24,798 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:24,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:24,798 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2019-08-05 10:41:24,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:24,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:41:24,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:26,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:26,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:26,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:41:26,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:41:26,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:41:26,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:41:26,537 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 65 states. [2019-08-05 10:41:28,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:28,395 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-08-05 10:41:28,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:41:28,396 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 125 [2019-08-05 10:41:28,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:28,397 INFO L225 Difference]: With dead ends: 129 [2019-08-05 10:41:28,397 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 10:41:28,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=6048, Invalid=9954, Unknown=0, NotChecked=0, Total=16002 [2019-08-05 10:41:28,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 10:41:28,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-08-05 10:41:28,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 10:41:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-08-05 10:41:28,400 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-08-05 10:41:28,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:28,401 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-08-05 10:41:28,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:41:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-08-05 10:41:28,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 10:41:28,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:28,401 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2019-08-05 10:41:28,402 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:28,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:28,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2019-08-05 10:41:28,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:28,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:41:28,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:29,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:29,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:29,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:41:29,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:41:29,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:41:29,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:41:29,849 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 66 states. [2019-08-05 10:41:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:32,008 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-08-05 10:41:32,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:41:32,009 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 127 [2019-08-05 10:41:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:32,010 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:41:32,010 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 10:41:32,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2015 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=6240, Invalid=10272, Unknown=0, NotChecked=0, Total=16512 [2019-08-05 10:41:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 10:41:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-08-05 10:41:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 10:41:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-08-05 10:41:32,014 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-08-05 10:41:32,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:32,014 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-08-05 10:41:32,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:41:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-08-05 10:41:32,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 10:41:32,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:32,015 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2019-08-05 10:41:32,015 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:32,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:32,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2019-08-05 10:41:32,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:32,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:41:32,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:33,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:33,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:33,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:41:33,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:41:33,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:41:33,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:41:33,502 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 67 states. [2019-08-05 10:41:35,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:35,634 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-08-05 10:41:35,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:41:35,634 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 129 [2019-08-05 10:41:35,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:35,635 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:41:35,635 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:41:35,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=6435, Invalid=10595, Unknown=0, NotChecked=0, Total=17030 [2019-08-05 10:41:35,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:41:35,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-08-05 10:41:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:41:35,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 10:41:35,639 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-08-05 10:41:35,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:35,639 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 10:41:35,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:41:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 10:41:35,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 10:41:35,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:35,642 INFO L399 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2019-08-05 10:41:35,642 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:35,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:35,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2019-08-05 10:41:35,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:35,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:41:35,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:37,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:37,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:37,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:41:37,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:41:37,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:41:37,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:41:37,320 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 68 states. [2019-08-05 10:41:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:39,337 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-08-05 10:41:39,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:41:39,338 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 131 [2019-08-05 10:41:39,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:39,339 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:41:39,339 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:41:39,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2144 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=6633, Invalid=10923, Unknown=0, NotChecked=0, Total=17556 [2019-08-05 10:41:39,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:41:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-08-05 10:41:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 10:41:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-08-05 10:41:39,343 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-08-05 10:41:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:39,344 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-08-05 10:41:39,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:41:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-08-05 10:41:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:41:39,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:39,345 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2019-08-05 10:41:39,345 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:39,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:39,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2019-08-05 10:41:39,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:39,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:41:39,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:43,948 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:43,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:43,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:41:43,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:41:43,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:41:43,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2280, Invalid=2412, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:41:43,985 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 69 states. [2019-08-05 10:41:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:46,390 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-08-05 10:41:46,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:41:46,391 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 133 [2019-08-05 10:41:46,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:46,392 INFO L225 Difference]: With dead ends: 137 [2019-08-05 10:41:46,392 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 10:41:46,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=6834, Invalid=11256, Unknown=0, NotChecked=0, Total=18090 [2019-08-05 10:41:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 10:41:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-08-05 10:41:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 10:41:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-08-05 10:41:46,396 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-08-05 10:41:46,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:46,396 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-08-05 10:41:46,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:41:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-08-05 10:41:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 10:41:46,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:46,397 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2019-08-05 10:41:46,397 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:46,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:46,398 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2019-08-05 10:41:46,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:46,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:41:46,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:48,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:48,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:48,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:41:48,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:41:48,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:41:48,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2348, Invalid=2482, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:41:48,125 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 70 states. [2019-08-05 10:41:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:50,353 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-08-05 10:41:50,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:41:50,353 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 135 [2019-08-05 10:41:50,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:50,355 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:41:50,355 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:41:50,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=7038, Invalid=11594, Unknown=0, NotChecked=0, Total=18632 [2019-08-05 10:41:50,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:41:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-08-05 10:41:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 10:41:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-08-05 10:41:50,358 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2019-08-05 10:41:50,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:50,358 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-08-05 10:41:50,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:41:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-08-05 10:41:50,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 10:41:50,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:50,359 INFO L399 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2019-08-05 10:41:50,359 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:50,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:50,359 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2019-08-05 10:41:50,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:50,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:41:50,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:52,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:52,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:52,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:41:52,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:41:52,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:41:52,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2417, Invalid=2553, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:41:52,450 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 71 states. [2019-08-05 10:41:54,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:54,711 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-08-05 10:41:54,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:41:54,712 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 137 [2019-08-05 10:41:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:54,713 INFO L225 Difference]: With dead ends: 141 [2019-08-05 10:41:54,713 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 10:41:54,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2345 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7245, Invalid=11937, Unknown=0, NotChecked=0, Total=19182 [2019-08-05 10:41:54,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 10:41:54,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2019-08-05 10:41:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 10:41:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-08-05 10:41:54,716 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2019-08-05 10:41:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:54,717 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2019-08-05 10:41:54,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:41:54,717 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2019-08-05 10:41:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:41:54,718 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:54,718 INFO L399 BasicCegarLoop]: trace histogram [69, 68, 1, 1] [2019-08-05 10:41:54,718 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:54,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:54,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1829081960, now seen corresponding path program 68 times [2019-08-05 10:41:54,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:54,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:41:54,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:56,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:41:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:56,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:56,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:41:56,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:41:56,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:41:56,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:41:56,691 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 72 states. [2019-08-05 10:41:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:58,959 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-08-05 10:41:58,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:41:58,959 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 139 [2019-08-05 10:41:58,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:58,960 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:41:58,960 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 10:41:58,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2414 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7455, Invalid=12285, Unknown=0, NotChecked=0, Total=19740 [2019-08-05 10:41:58,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 10:41:58,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-08-05 10:41:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 10:41:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-08-05 10:41:58,964 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2019-08-05 10:41:58,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:58,964 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-08-05 10:41:58,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:41:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-08-05 10:41:58,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:41:58,965 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:58,965 INFO L399 BasicCegarLoop]: trace histogram [70, 69, 1, 1] [2019-08-05 10:41:58,965 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:58,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:58,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1106140586, now seen corresponding path program 69 times [2019-08-05 10:41:58,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:58,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:41:58,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:00,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:42:00,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:00,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:00,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:42:00,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:42:00,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:42:00,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2558, Invalid=2698, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:42:00,702 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 73 states. [2019-08-05 10:42:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:03,245 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-08-05 10:42:03,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:42:03,246 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 141 [2019-08-05 10:42:03,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:03,247 INFO L225 Difference]: With dead ends: 145 [2019-08-05 10:42:03,248 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 10:42:03,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2484 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7668, Invalid=12638, Unknown=0, NotChecked=0, Total=20306 [2019-08-05 10:42:03,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 10:42:03,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2019-08-05 10:42:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 10:42:03,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2019-08-05 10:42:03,252 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2019-08-05 10:42:03,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:03,252 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2019-08-05 10:42:03,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:42:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2019-08-05 10:42:03,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:42:03,253 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:03,253 INFO L399 BasicCegarLoop]: trace histogram [71, 70, 1, 1] [2019-08-05 10:42:03,253 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:03,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:03,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2144182124, now seen corresponding path program 70 times [2019-08-05 10:42:03,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:03,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:42:03,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:05,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:42:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:05,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:05,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:42:05,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:42:05,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:42:05,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:42:05,057 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 74 states. [2019-08-05 10:42:07,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:07,793 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-08-05 10:42:07,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:42:07,793 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 143 [2019-08-05 10:42:07,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:07,795 INFO L225 Difference]: With dead ends: 147 [2019-08-05 10:42:07,795 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 10:42:07,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=7884, Invalid=12996, Unknown=0, NotChecked=0, Total=20880 [2019-08-05 10:42:07,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 10:42:07,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-08-05 10:42:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 10:42:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-08-05 10:42:07,799 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2019-08-05 10:42:07,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:07,799 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-08-05 10:42:07,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:42:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-08-05 10:42:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 10:42:07,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:07,800 INFO L399 BasicCegarLoop]: trace histogram [72, 71, 1, 1] [2019-08-05 10:42:07,800 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:07,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1025279826, now seen corresponding path program 71 times [2019-08-05 10:42:07,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:07,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:42:07,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:09,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:42:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:09,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:09,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:42:09,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:42:09,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:42:09,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=2847, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:42:09,710 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 75 states. [2019-08-05 10:42:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:12,536 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-08-05 10:42:12,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:42:12,536 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 145 [2019-08-05 10:42:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:12,538 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:42:12,538 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:42:12,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2627 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=8103, Invalid=13359, Unknown=0, NotChecked=0, Total=21462 [2019-08-05 10:42:12,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:42:12,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-08-05 10:42:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:42:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-08-05 10:42:12,542 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2019-08-05 10:42:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:12,543 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-08-05 10:42:12,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:42:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-08-05 10:42:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 10:42:12,543 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:12,544 INFO L399 BasicCegarLoop]: trace histogram [73, 72, 1, 1] [2019-08-05 10:42:12,544 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:12,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:12,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1746400912, now seen corresponding path program 72 times [2019-08-05 10:42:12,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:12,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:42:12,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:14,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:42:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:14,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:14,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:42:14,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:42:14,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:42:14,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2777, Invalid=2923, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:42:14,815 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 76 states. [2019-08-05 10:42:17,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:17,574 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-08-05 10:42:17,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:42:17,574 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 147 [2019-08-05 10:42:17,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:17,575 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:42:17,576 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:42:17,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2700 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=8325, Invalid=13727, Unknown=0, NotChecked=0, Total=22052 [2019-08-05 10:42:17,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:42:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-08-05 10:42:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 10:42:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2019-08-05 10:42:17,580 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2019-08-05 10:42:17,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:17,581 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2019-08-05 10:42:17,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:42:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2019-08-05 10:42:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 10:42:17,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:17,582 INFO L399 BasicCegarLoop]: trace histogram [74, 73, 1, 1] [2019-08-05 10:42:17,582 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:17,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:17,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1040937394, now seen corresponding path program 73 times [2019-08-05 10:42:17,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:17,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:42:17,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:19,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:42:19,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:19,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:19,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:42:19,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:42:19,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:42:19,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2852, Invalid=3000, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:42:19,698 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 77 states. [2019-08-05 10:42:22,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:22,551 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-08-05 10:42:22,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:42:22,552 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 149 [2019-08-05 10:42:22,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:22,553 INFO L225 Difference]: With dead ends: 153 [2019-08-05 10:42:22,553 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 10:42:22,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2774 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=8550, Invalid=14100, Unknown=0, NotChecked=0, Total=22650 [2019-08-05 10:42:22,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 10:42:22,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2019-08-05 10:42:22,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 10:42:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-08-05 10:42:22,557 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2019-08-05 10:42:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:22,557 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-08-05 10:42:22,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:42:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-08-05 10:42:22,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-08-05 10:42:22,558 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:22,558 INFO L399 BasicCegarLoop]: trace histogram [75, 74, 1, 1] [2019-08-05 10:42:22,559 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:22,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:22,559 INFO L82 PathProgramCache]: Analyzing trace with hash -386543244, now seen corresponding path program 74 times [2019-08-05 10:42:22,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:22,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:42:22,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:24,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:42:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:24,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:24,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:42:24,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:42:24,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:42:24,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:42:24,937 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 78 states. [2019-08-05 10:42:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:27,849 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-08-05 10:42:27,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:42:27,849 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 151 [2019-08-05 10:42:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:27,850 INFO L225 Difference]: With dead ends: 155 [2019-08-05 10:42:27,851 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 10:42:27,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2849 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8778, Invalid=14478, Unknown=0, NotChecked=0, Total=23256 [2019-08-05 10:42:27,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 10:42:27,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-08-05 10:42:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 10:42:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-08-05 10:42:27,854 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2019-08-05 10:42:27,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:27,854 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-08-05 10:42:27,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:42:27,854 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-08-05 10:42:27,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 10:42:27,855 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:27,855 INFO L399 BasicCegarLoop]: trace histogram [76, 75, 1, 1] [2019-08-05 10:42:27,855 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:27,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:27,856 INFO L82 PathProgramCache]: Analyzing trace with hash -2100868938, now seen corresponding path program 75 times [2019-08-05 10:42:27,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:27,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:42:27,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:29,891 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:42:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:29,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:29,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:42:29,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:42:29,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:42:29,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3005, Invalid=3157, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:42:29,936 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 79 states. [2019-08-05 10:42:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:32,976 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-08-05 10:42:32,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:42:32,977 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 153 [2019-08-05 10:42:32,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:32,978 INFO L225 Difference]: With dead ends: 157 [2019-08-05 10:42:32,978 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:42:32,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2925 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=9009, Invalid=14861, Unknown=0, NotChecked=0, Total=23870 [2019-08-05 10:42:32,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:42:32,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-08-05 10:42:32,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 10:42:32,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-08-05 10:42:32,982 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2019-08-05 10:42:32,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:32,983 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-08-05 10:42:32,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:42:32,983 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-08-05 10:42:32,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 10:42:32,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:32,984 INFO L399 BasicCegarLoop]: trace histogram [77, 76, 1, 1] [2019-08-05 10:42:32,984 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:32,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:32,984 INFO L82 PathProgramCache]: Analyzing trace with hash -300419208, now seen corresponding path program 76 times [2019-08-05 10:42:32,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:33,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:42:33,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:35,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:42:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:35,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:35,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:42:35,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:42:35,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:42:35,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:42:35,232 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 80 states. [2019-08-05 10:42:38,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:38,332 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-08-05 10:42:38,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:42:38,332 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 155 [2019-08-05 10:42:38,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:38,333 INFO L225 Difference]: With dead ends: 159 [2019-08-05 10:42:38,333 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 10:42:38,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3002 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=9243, Invalid=15249, Unknown=0, NotChecked=0, Total=24492 [2019-08-05 10:42:38,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 10:42:38,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-08-05 10:42:38,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 10:42:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-08-05 10:42:38,337 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2019-08-05 10:42:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:38,337 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2019-08-05 10:42:38,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:42:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2019-08-05 10:42:38,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 10:42:38,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:38,338 INFO L399 BasicCegarLoop]: trace histogram [78, 77, 1, 1] [2019-08-05 10:42:38,338 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:38,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:38,339 INFO L82 PathProgramCache]: Analyzing trace with hash -940048966, now seen corresponding path program 77 times [2019-08-05 10:42:38,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:38,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:42:38,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:40,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:42:40,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:40,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:40,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:42:40,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:42:40,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:42:40,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3162, Invalid=3318, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:42:40,512 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 81 states. [2019-08-05 10:42:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:43,633 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-08-05 10:42:43,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:42:43,634 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 157 [2019-08-05 10:42:43,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:43,635 INFO L225 Difference]: With dead ends: 161 [2019-08-05 10:42:43,635 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 10:42:43,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=9480, Invalid=15642, Unknown=0, NotChecked=0, Total=25122 [2019-08-05 10:42:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 10:42:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-08-05 10:42:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 10:42:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-08-05 10:42:43,640 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2019-08-05 10:42:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:43,640 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-08-05 10:42:43,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:42:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-08-05 10:42:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 10:42:43,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:43,642 INFO L399 BasicCegarLoop]: trace histogram [79, 78, 1, 1] [2019-08-05 10:42:43,642 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:43,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:43,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1443923076, now seen corresponding path program 78 times [2019-08-05 10:42:43,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:43,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:42:43,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:45,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:42:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:46,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:46,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:42:46,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:42:46,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:42:46,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3242, Invalid=3400, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:42:46,011 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 82 states. [2019-08-05 10:42:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:49,119 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-08-05 10:42:49,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:42:49,120 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 159 [2019-08-05 10:42:49,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:49,121 INFO L225 Difference]: With dead ends: 163 [2019-08-05 10:42:49,121 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 10:42:49,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3159 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=9720, Invalid=16040, Unknown=0, NotChecked=0, Total=25760 [2019-08-05 10:42:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 10:42:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-08-05 10:42:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 10:42:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-08-05 10:42:49,125 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2019-08-05 10:42:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:49,125 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-08-05 10:42:49,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:42:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-08-05 10:42:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-08-05 10:42:49,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:49,127 INFO L399 BasicCegarLoop]: trace histogram [80, 79, 1, 1] [2019-08-05 10:42:49,127 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:49,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:49,127 INFO L82 PathProgramCache]: Analyzing trace with hash -335638338, now seen corresponding path program 79 times [2019-08-05 10:42:49,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:49,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:42:49,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:51,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:42:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:51,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:51,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:42:51,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:42:51,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:42:51,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3323, Invalid=3483, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:42:51,443 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 83 states. [2019-08-05 10:42:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:54,701 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-08-05 10:42:54,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:42:54,702 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 161 [2019-08-05 10:42:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:54,703 INFO L225 Difference]: With dead ends: 165 [2019-08-05 10:42:54,703 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 10:42:54,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3239 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=9963, Invalid=16443, Unknown=0, NotChecked=0, Total=26406 [2019-08-05 10:42:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 10:42:54,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-08-05 10:42:54,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 10:42:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-08-05 10:42:54,707 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2019-08-05 10:42:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:54,707 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-08-05 10:42:54,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:42:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-08-05 10:42:54,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 10:42:54,708 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:54,708 INFO L399 BasicCegarLoop]: trace histogram [81, 80, 1, 1] [2019-08-05 10:42:54,708 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:54,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:54,709 INFO L82 PathProgramCache]: Analyzing trace with hash -425894528, now seen corresponding path program 80 times [2019-08-05 10:42:54,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:54,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:42:54,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:57,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:42:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:57,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:57,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:42:57,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:42:57,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:42:57,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:42:57,746 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 84 states. [2019-08-05 10:43:00,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:00,723 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-08-05 10:43:00,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:43:00,724 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 163 [2019-08-05 10:43:00,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:00,725 INFO L225 Difference]: With dead ends: 167 [2019-08-05 10:43:00,725 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 10:43:00,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3320 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=10209, Invalid=16851, Unknown=0, NotChecked=0, Total=27060 [2019-08-05 10:43:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 10:43:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-08-05 10:43:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 10:43:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-08-05 10:43:00,728 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2019-08-05 10:43:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:00,729 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-08-05 10:43:00,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:43:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-08-05 10:43:00,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 10:43:00,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:00,730 INFO L399 BasicCegarLoop]: trace histogram [82, 81, 1, 1] [2019-08-05 10:43:00,730 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:00,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:00,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1262747198, now seen corresponding path program 81 times [2019-08-05 10:43:00,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:00,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:43:00,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:03,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:03,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:03,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:43:03,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:43:03,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:43:03,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3488, Invalid=3652, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:43:03,517 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 85 states. [2019-08-05 10:43:06,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:06,595 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2019-08-05 10:43:06,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:43:06,596 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 165 [2019-08-05 10:43:06,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:06,597 INFO L225 Difference]: With dead ends: 169 [2019-08-05 10:43:06,597 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 10:43:06,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3402 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=10458, Invalid=17264, Unknown=0, NotChecked=0, Total=27722 [2019-08-05 10:43:06,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 10:43:06,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2019-08-05 10:43:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 10:43:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2019-08-05 10:43:06,601 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2019-08-05 10:43:06,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:06,601 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2019-08-05 10:43:06,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:43:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2019-08-05 10:43:06,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 10:43:06,602 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:06,602 INFO L399 BasicCegarLoop]: trace histogram [83, 82, 1, 1] [2019-08-05 10:43:06,602 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:06,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:06,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1975688580, now seen corresponding path program 82 times [2019-08-05 10:43:06,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:06,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:43:06,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:09,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:09,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:09,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:43:09,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:43:09,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:43:09,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:43:09,397 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 86 states. [2019-08-05 10:43:12,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:12,577 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-08-05 10:43:12,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:43:12,578 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 167 [2019-08-05 10:43:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:12,579 INFO L225 Difference]: With dead ends: 171 [2019-08-05 10:43:12,579 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 10:43:12,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3485 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=10710, Invalid=17682, Unknown=0, NotChecked=0, Total=28392 [2019-08-05 10:43:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 10:43:12,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-08-05 10:43:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-08-05 10:43:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-08-05 10:43:12,583 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2019-08-05 10:43:12,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:12,583 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2019-08-05 10:43:12,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:43:12,583 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2019-08-05 10:43:12,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-08-05 10:43:12,584 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:12,584 INFO L399 BasicCegarLoop]: trace histogram [84, 83, 1, 1] [2019-08-05 10:43:12,584 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:12,584 INFO L82 PathProgramCache]: Analyzing trace with hash 261181638, now seen corresponding path program 83 times [2019-08-05 10:43:12,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:12,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:43:12,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:15,424 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:15,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:15,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:43:15,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:43:15,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:43:15,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3657, Invalid=3825, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:43:15,476 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 87 states. [2019-08-05 10:43:19,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:19,075 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-08-05 10:43:19,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:43:19,076 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 169 [2019-08-05 10:43:19,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:19,077 INFO L225 Difference]: With dead ends: 173 [2019-08-05 10:43:19,077 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 10:43:19,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3569 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10965, Invalid=18105, Unknown=0, NotChecked=0, Total=29070 [2019-08-05 10:43:19,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 10:43:19,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-08-05 10:43:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 10:43:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-08-05 10:43:19,081 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2019-08-05 10:43:19,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:19,082 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-08-05 10:43:19,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:43:19,082 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-08-05 10:43:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 10:43:19,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:19,083 INFO L399 BasicCegarLoop]: trace histogram [85, 84, 1, 1] [2019-08-05 10:43:19,083 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:19,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:19,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1887452040, now seen corresponding path program 84 times [2019-08-05 10:43:19,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:19,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:43:19,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:21,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:21,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:21,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:43:21,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:43:21,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:43:21,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3743, Invalid=3913, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:43:21,807 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 88 states. [2019-08-05 10:43:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:25,510 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-08-05 10:43:25,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:43:25,511 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 171 [2019-08-05 10:43:25,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:25,512 INFO L225 Difference]: With dead ends: 175 [2019-08-05 10:43:25,512 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 10:43:25,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3654 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=11223, Invalid=18533, Unknown=0, NotChecked=0, Total=29756 [2019-08-05 10:43:25,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 10:43:25,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-08-05 10:43:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-08-05 10:43:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2019-08-05 10:43:25,516 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2019-08-05 10:43:25,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:25,516 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2019-08-05 10:43:25,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:43:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2019-08-05 10:43:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 10:43:25,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:25,517 INFO L399 BasicCegarLoop]: trace histogram [86, 85, 1, 1] [2019-08-05 10:43:25,518 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:25,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:25,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1365212618, now seen corresponding path program 85 times [2019-08-05 10:43:25,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:25,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:43:25,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:28,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:28,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:28,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:43:28,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:43:28,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:43:28,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3830, Invalid=4002, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:43:28,509 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 89 states. [2019-08-05 10:43:31,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:31,861 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-08-05 10:43:31,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:43:31,861 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 173 [2019-08-05 10:43:31,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:31,863 INFO L225 Difference]: With dead ends: 177 [2019-08-05 10:43:31,863 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 10:43:31,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3740 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=11484, Invalid=18966, Unknown=0, NotChecked=0, Total=30450 [2019-08-05 10:43:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 10:43:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-08-05 10:43:31,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 10:43:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-08-05 10:43:31,867 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2019-08-05 10:43:31,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:31,867 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-08-05 10:43:31,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:43:31,867 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-08-05 10:43:31,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 10:43:31,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:31,868 INFO L399 BasicCegarLoop]: trace histogram [87, 86, 1, 1] [2019-08-05 10:43:31,869 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:31,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:31,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2004301708, now seen corresponding path program 86 times [2019-08-05 10:43:31,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:31,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:43:31,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:34,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:35,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:35,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:43:35,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:43:35,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:43:35,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:43:35,011 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 90 states. [2019-08-05 10:43:38,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:38,645 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-08-05 10:43:38,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:43:38,645 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 175 [2019-08-05 10:43:38,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:38,646 INFO L225 Difference]: With dead ends: 179 [2019-08-05 10:43:38,646 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 10:43:38,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3827 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=11748, Invalid=19404, Unknown=0, NotChecked=0, Total=31152 [2019-08-05 10:43:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 10:43:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-08-05 10:43:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 10:43:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-08-05 10:43:38,649 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2019-08-05 10:43:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:38,649 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-08-05 10:43:38,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:43:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-08-05 10:43:38,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:43:38,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:38,650 INFO L399 BasicCegarLoop]: trace histogram [88, 87, 1, 1] [2019-08-05 10:43:38,650 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:38,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:38,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1988593870, now seen corresponding path program 87 times [2019-08-05 10:43:38,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:38,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:43:38,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:41,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:41,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:41,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:43:41,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:43:41,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:43:41,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4007, Invalid=4183, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:43:41,431 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 91 states. [2019-08-05 10:43:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:45,239 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-08-05 10:43:45,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:43:45,240 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 177 [2019-08-05 10:43:45,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:45,241 INFO L225 Difference]: With dead ends: 181 [2019-08-05 10:43:45,241 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 10:43:45,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3915 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=12015, Invalid=19847, Unknown=0, NotChecked=0, Total=31862 [2019-08-05 10:43:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 10:43:45,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-08-05 10:43:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 10:43:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2019-08-05 10:43:45,244 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2019-08-05 10:43:45,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:45,244 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2019-08-05 10:43:45,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:43:45,245 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2019-08-05 10:43:45,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 10:43:45,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:45,245 INFO L399 BasicCegarLoop]: trace histogram [89, 88, 1, 1] [2019-08-05 10:43:45,245 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:45,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:45,246 INFO L82 PathProgramCache]: Analyzing trace with hash -221736560, now seen corresponding path program 88 times [2019-08-05 10:43:45,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:45,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:43:45,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:48,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:48,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:48,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:43:48,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:43:48,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:43:48,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4097, Invalid=4275, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:43:48,091 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 92 states. Received shutdown request... [2019-08-05 10:43:49,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:43:49,165 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:43:49,170 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:43:49,170 INFO L202 PluginConnector]: Adding new model BugInterpolantConsolidation01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:43:49 BoogieIcfgContainer [2019-08-05 10:43:49,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:43:49,173 INFO L168 Benchmark]: Toolchain (without parser) took 239979.09 ms. Allocated memory was 140.0 MB in the beginning and 649.1 MB in the end (delta: 509.1 MB). Free memory was 108.7 MB in the beginning and 127.9 MB in the end (delta: -19.2 MB). Peak memory consumption was 489.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:49,174 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 140.0 MB. Free memory was 109.8 MB in the beginning and 109.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:43:49,174 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.61 ms. Allocated memory is still 140.0 MB. Free memory was 108.5 MB in the beginning and 106.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:49,175 INFO L168 Benchmark]: Boogie Preprocessor took 21.49 ms. Allocated memory is still 140.0 MB. Free memory was 106.6 MB in the beginning and 105.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:49,176 INFO L168 Benchmark]: RCFGBuilder took 289.52 ms. Allocated memory is still 140.0 MB. Free memory was 105.5 MB in the beginning and 96.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:49,178 INFO L168 Benchmark]: TraceAbstraction took 239624.91 ms. Allocated memory was 140.0 MB in the beginning and 649.1 MB in the end (delta: 509.1 MB). Free memory was 96.2 MB in the beginning and 128.0 MB in the end (delta: -31.7 MB). Peak memory consumption was 477.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:49,184 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.24 ms. Allocated memory is still 140.0 MB. Free memory was 109.8 MB in the beginning and 109.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.61 ms. Allocated memory is still 140.0 MB. Free memory was 108.5 MB in the beginning and 106.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.49 ms. Allocated memory is still 140.0 MB. Free memory was 106.6 MB in the beginning and 105.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 289.52 ms. Allocated memory is still 140.0 MB. Free memory was 105.5 MB in the beginning and 96.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239624.91 ms. Allocated memory was 140.0 MB in the beginning and 649.1 MB in the end (delta: 509.1 MB). Free memory was 96.2 MB in the beginning and 128.0 MB in the end (delta: -31.7 MB). Peak memory consumption was 477.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was constructing difference of abstraction (180states) and FLOYD_HOARE automaton (currently 39 states, 92 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 128 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 239.5s OverallTime, 89 OverallIterations, 89 TraceHistogramMax, 129.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 179 SDtfs, 90 SDslu, 746 SDs, 0 SdLazy, 8434 SolverSat, 8097 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11963 GetRequests, 3916 SyntacticMatches, 0 SemanticMatches, 8046 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118123 ImplicationChecksByTransitivity, 216.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=88, 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, 88 MinimizatonAttempts, 88 StatesRemovedByMinimization, 88 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 107.2s InterpolantComputationTime, 8099 NumberOfCodeBlocks, 8099 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 8010 ConstructedInterpolants, 0 QuantifiedInterpolants, 2867580 SizeOfPredicates, 89 NumberOfNonLiveVariables, 24297 ConjunctsInSsa, 4272 ConjunctsInUnsatCore, 89 InterpolantComputations, 1 PerfectInterpolantSequences, 0/234960 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown