java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Octopussy.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:43:43,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:43:43,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:43:43,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:43:43,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:43:43,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:43:43,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:43:43,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:43:43,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:43:43,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:43:43,094 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:43:43,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:43:43,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:43:43,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:43:43,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:43:43,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:43:43,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:43:43,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:43:43,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:43:43,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:43:43,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:43:43,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:43:43,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:43:43,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:43:43,117 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:43:43,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:43:43,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:43:43,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:43:43,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:43:43,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:43:43,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:43:43,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:43:43,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:43:43,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:43:43,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:43:43,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:43:43,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:43:43,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:43:43,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:43:43,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:43:43,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:43:43,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:43:43,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:43:43,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:43:43,183 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:43:43,183 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:43:43,184 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Octopussy.bpl [2019-08-04 21:43:43,185 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Octopussy.bpl' [2019-08-04 21:43:43,217 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:43:43,218 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:43:43,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:43:43,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:43:43,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:43:43,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:43:43" (1/1) ... [2019-08-04 21:43:43,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:43:43" (1/1) ... [2019-08-04 21:43:43,249 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-04 21:43:43,250 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-04 21:43:43,250 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-04 21:43:43,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:43:43,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:43:43,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:43:43,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:43:43,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:43:43" (1/1) ... [2019-08-04 21:43:43,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:43:43" (1/1) ... [2019-08-04 21:43:43,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:43:43" (1/1) ... [2019-08-04 21:43:43,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:43:43" (1/1) ... [2019-08-04 21:43:43,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:43:43" (1/1) ... [2019-08-04 21:43:43,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:43:43" (1/1) ... [2019-08-04 21:43:43,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:43:43" (1/1) ... [2019-08-04 21:43:43,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:43:43,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:43:43,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:43:43,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:43:43,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:43:43" (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-04 21:43:43,345 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-04 21:43:43,345 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-04 21:43:43,345 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-04 21:43:43,554 INFO L275 CfgBuilder]: Using library mode [2019-08-04 21:43:43,554 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:43:43,555 INFO L202 PluginConnector]: Adding new model Octopussy.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:43:43 BoogieIcfgContainer [2019-08-04 21:43:43,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:43:43,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:43:43,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:43:43,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:43:43,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:43:43" (1/2) ... [2019-08-04 21:43:43,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed4384b and model type Octopussy.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:43:43, skipping insertion in model container [2019-08-04 21:43:43,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:43:43" (2/2) ... [2019-08-04 21:43:43,565 INFO L109 eAbstractionObserver]: Analyzing ICFG Octopussy.bpl [2019-08-04 21:43:43,575 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:43:43,584 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:43:43,601 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:43:43,624 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:43:43,625 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:43:43,625 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:43:43,625 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:43:43,625 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:43:43,625 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:43:43,626 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:43:43,626 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:43:43,626 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:43:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-04 21:43:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:43:43,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:43,651 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:43:43,653 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:43,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:43,658 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-08-04 21:43:43,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:43,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:43:43,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:43,775 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-04 21:43:43,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:43:43,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:43:43,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:43:43,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:43:43,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:43:43,797 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-04 21:43:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:43,845 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-04 21:43:43,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:43:43,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:43:43,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:43,858 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:43:43,858 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:43:43,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:43:43,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:43:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:43:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:43:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:43:43,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:43:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:43,889 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:43:43,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:43:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:43:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:43:43,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:43,891 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:43:43,891 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:43,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:43,892 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2019-08-04 21:43:43,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:43,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:43:43,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:44,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:44,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:43:44,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:43:44,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:43:44,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:43:44,047 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:43:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:44,135 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:43:44,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:43:44,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:43:44,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:44,136 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:43:44,136 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:43:44,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:43:44,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:43:44,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:43:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:43:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:43:44,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:43:44,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:44,141 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:43:44,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:43:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:43:44,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:43:44,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:44,143 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:43:44,143 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:44,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:44,143 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2019-08-04 21:43:44,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:44,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:43:44,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:44,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:44,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:43:44,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:43:44,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:43:44,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:43:44,263 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:43:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:44,305 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:43:44,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:43:44,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:43:44,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:44,311 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:43:44,311 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:43:44,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:43:44,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:43:44,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:43:44,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:43:44,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:43:44,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:43:44,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:44,315 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:43:44,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:43:44,315 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:43:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:43:44,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:44,316 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:43:44,316 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:44,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:44,317 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2019-08-04 21:43:44,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:44,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:43:44,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:44,430 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-04 21:43:44,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:44,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:43:44,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:43:44,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:43:44,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:43:44,432 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:43:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:44,453 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:43:44,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:43:44,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:43:44,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:44,454 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:43:44,454 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:43:44,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:43:44,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:43:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:43:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:43:44,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:43:44,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:43:44,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:44,458 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:43:44,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:43:44,458 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:43:44,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:43:44,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:44,458 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:43:44,459 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:44,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:44,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2019-08-04 21:43:44,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:44,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:43:44,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:44,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:44,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:43:44,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:43:44,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:43:44,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:43:44,685 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:43:44,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:44,715 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:43:44,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:43:44,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:43:44,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:44,716 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:43:44,717 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:43:44,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:43:44,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:43:44,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:43:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:43:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:43:44,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:43:44,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:44,720 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:43:44,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:43:44,720 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:43:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:43:44,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:44,720 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:43:44,721 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:44,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:44,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2019-08-04 21:43:44,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:44,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:43:44,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:45,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:45,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:43:45,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:43:45,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:43:45,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:43:45,032 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:43:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:45,058 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:43:45,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:43:45,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:43:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:45,059 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:43:45,059 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:43:45,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:43:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:43:45,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:43:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:43:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:43:45,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:43:45,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:45,064 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:43:45,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:43:45,065 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:43:45,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:43:45,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:45,065 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:43:45,066 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:45,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:45,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2019-08-04 21:43:45,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:45,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:43:45,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:45,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:45,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:43:45,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:43:45,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:43:45,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:43:45,273 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:43:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:45,361 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:43:45,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:43:45,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:43:45,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:45,362 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:43:45,362 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:43:45,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:43:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:43:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:43:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:43:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:43:45,365 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:43:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:45,366 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:43:45,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:43:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:43:45,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:43:45,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:45,366 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:43:45,367 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:45,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:45,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2019-08-04 21:43:45,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:45,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:43:45,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:45,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:45,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:43:45,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:43:45,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:43:45,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:43:45,504 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:43:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:45,536 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:43:45,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:43:45,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:43:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:45,538 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:43:45,538 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:43:45,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:43:45,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:43:45,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:43:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:43:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:43:45,541 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:43:45,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:45,541 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:43:45,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:43:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:43:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:43:45,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:45,542 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:43:45,543 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:45,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:45,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2019-08-04 21:43:45,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:45,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:43:45,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:45,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:45,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:43:45,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:43:45,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:43:45,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:43:45,921 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-04 21:43:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:45,964 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:43:45,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:43:45,964 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-04 21:43:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:45,965 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:43:45,965 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:43:45,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:43:45,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:43:45,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:43:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:43:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:43:45,968 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:43:45,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:45,969 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:43:45,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:43:45,969 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:43:45,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:43:45,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:45,969 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:43:45,970 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:45,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:45,970 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2019-08-04 21:43:45,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:45,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:43:45,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:46,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:46,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:43:46,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:43:46,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:43:46,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:43:46,358 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-04 21:43:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:46,389 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:43:46,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:43:46,390 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-04 21:43:46,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:46,391 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:43:46,391 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:43:46,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:43:46,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:43:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:43:46,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:43:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:43:46,394 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-04 21:43:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:46,395 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:43:46,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:43:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:43:46,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:43:46,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:46,396 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-04 21:43:46,396 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:46,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:46,396 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2019-08-04 21:43:46,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:46,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-04 21:43:46,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:46,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:46,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:43:46,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:43:46,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:43:46,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:43:46,608 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-04 21:43:46,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:46,653 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:43:46,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:43:46,653 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-04 21:43:46,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:46,654 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:43:46,654 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:43:46,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:43:46,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:43:46,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:43:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:43:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:43:46,658 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-04 21:43:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:46,659 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:43:46,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:43:46,659 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:43:46,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:43:46,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:46,660 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-04 21:43:46,660 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:46,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:46,661 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2019-08-04 21:43:46,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:46,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:43:46,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:46,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:46,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:43:46,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:43:46,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:43:46,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:43:46,949 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-04 21:43:47,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:47,006 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:43:47,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:43:47,007 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-04 21:43:47,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:47,008 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:43:47,008 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:43:47,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:43:47,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:43:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:43:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:43:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-04 21:43:47,012 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-04 21:43:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:47,012 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-04 21:43:47,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:43:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-04 21:43:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:43:47,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:47,013 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-04 21:43:47,013 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:47,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:47,014 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2019-08-04 21:43:47,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:47,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:43:47,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:47,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:47,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:43:47,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:43:47,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:43:47,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:43:47,253 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-04 21:43:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:47,308 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:43:47,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:43:47,309 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-04 21:43:47,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:47,310 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:43:47,310 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:43:47,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:43:47,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:43:47,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:43:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:43:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:43:47,314 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-04 21:43:47,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:47,314 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:43:47,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:43:47,314 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:43:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:43:47,315 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:47,315 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-04 21:43:47,315 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:47,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:47,316 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2019-08-04 21:43:47,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:47,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:43:47,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:47,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:47,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:43:47,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:43:47,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:43:47,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:43:47,526 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-04 21:43:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:47,556 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:43:47,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:43:47,557 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-04 21:43:47,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:47,558 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:43:47,558 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:43:47,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:43:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:43:47,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:43:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:43:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-04 21:43:47,562 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-04 21:43:47,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:47,562 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-04 21:43:47,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:43:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-04 21:43:47,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:43:47,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:47,563 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-04 21:43:47,563 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:47,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:47,564 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2019-08-04 21:43:47,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:47,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-04 21:43:47,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:47,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:47,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:43:47,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:43:47,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:43:47,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:43:47,791 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-04 21:43:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:47,820 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:43:47,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:43:47,821 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-04 21:43:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:47,822 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:43:47,822 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:43:47,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:43:47,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:43:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:43:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:43:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:43:47,826 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-04 21:43:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:47,826 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:43:47,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:43:47,827 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:43:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:43:47,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:47,827 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-04 21:43:47,828 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:47,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:47,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2019-08-04 21:43:47,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:47,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:43:47,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:48,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:48,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:43:48,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:43:48,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:43:48,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:43:48,085 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-04 21:43:48,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:48,117 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:43:48,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:43:48,123 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-04 21:43:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:48,124 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:43:48,124 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:43:48,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:43:48,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:43:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:43:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:43:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:43:48,127 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-04 21:43:48,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:48,128 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:43:48,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:43:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:43:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:43:48,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:48,129 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-04 21:43:48,129 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:48,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:48,130 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2019-08-04 21:43:48,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:48,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-04 21:43:48,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:48,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:48,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:43:48,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:43:48,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:43:48,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:43:48,607 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-04 21:43:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:48,652 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-04 21:43:48,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:43:48,652 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-04 21:43:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:48,653 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:43:48,653 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:43:48,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:43:48,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:43:48,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:43:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:43:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:43:48,657 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-04 21:43:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:48,657 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:43:48,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:43:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:43:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:43:48,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:48,658 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-04 21:43:48,658 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:48,658 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2019-08-04 21:43:48,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:48,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:43:48,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:49,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:49,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:43:49,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:43:49,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:43:49,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:43:49,279 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-04 21:43:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:49,318 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-04 21:43:49,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:43:49,318 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-04 21:43:49,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:49,319 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:43:49,319 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:43:49,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:43:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:43:49,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:43:49,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:43:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-04 21:43:49,323 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-04 21:43:49,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:49,323 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-04 21:43:49,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:43:49,323 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-04 21:43:49,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:43:49,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:49,324 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-04 21:43:49,324 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:49,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:49,325 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2019-08-04 21:43:49,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:49,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-04 21:43:49,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:49,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:49,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:43:49,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:43:49,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:43:49,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:43:49,767 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-04 21:43:49,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:49,796 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-04 21:43:49,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:43:49,799 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-04 21:43:49,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:49,800 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:43:49,800 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:43:49,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:43:49,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:43:49,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:43:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:43:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:43:49,804 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-04 21:43:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:49,804 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:43:49,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:43:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:43:49,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:43:49,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:49,805 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-04 21:43:49,806 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:49,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:49,806 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2019-08-04 21:43:49,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:49,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:43:49,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:50,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:50,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:43:50,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:43:50,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:43:50,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:43:50,116 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-04 21:43:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:50,143 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-04 21:43:50,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:43:50,144 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-04 21:43:50,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:50,144 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:43:50,144 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:43:50,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:43:50,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:43:50,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:43:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:43:50,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-04 21:43:50,149 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-04 21:43:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:50,149 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-04 21:43:50,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:43:50,149 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-04 21:43:50,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:43:50,150 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:50,150 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-04 21:43:50,150 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:50,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:50,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2019-08-04 21:43:50,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:50,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-04 21:43:50,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:50,476 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-04 21:43:50,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:50,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:43:50,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:43:50,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:43:50,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:43:50,479 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-04 21:43:50,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:50,511 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-04 21:43:50,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:43:50,512 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-04 21:43:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:50,512 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:43:50,513 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:43:50,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:43:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:43:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:43:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:43:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:43:50,516 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-04 21:43:50,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:50,516 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:43:50,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:43:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:43:50,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:43:50,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:50,517 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-04 21:43:50,518 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:50,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:50,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2019-08-04 21:43:50,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:50,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:43:50,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:50,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:50,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:43:50,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:43:50,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:43:50,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:43:50,817 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-04 21:43:50,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:50,901 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:43:50,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:43:50,904 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-04 21:43:50,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:50,904 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:43:50,905 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:43:50,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:43:50,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:43:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:43:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:43:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-04 21:43:50,908 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-04 21:43:50,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:50,909 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-04 21:43:50,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:43:50,909 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-04 21:43:50,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:43:50,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:50,910 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-04 21:43:50,910 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:50,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:50,910 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2019-08-04 21:43:50,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:50,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-04 21:43:50,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:51,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:51,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:43:51,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:43:51,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:43:51,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:43:51,289 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-04 21:43:51,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:51,401 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-04 21:43:51,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:43:51,401 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-04 21:43:51,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:51,402 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:43:51,402 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:43:51,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:43:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:43:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:43:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:43:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-04 21:43:51,406 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-04 21:43:51,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:51,407 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-04 21:43:51,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:43:51,407 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-04 21:43:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:43:51,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:51,408 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-04 21:43:51,408 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:51,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:51,408 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2019-08-04 21:43:51,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:51,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-04 21:43:51,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:51,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:51,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:43:51,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:43:51,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:43:51,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:43:51,707 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-04 21:43:51,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:51,770 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-04 21:43:51,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:43:51,770 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-04 21:43:51,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:51,771 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:43:51,771 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:43:51,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:43:51,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:43:51,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:43:51,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:43:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-04 21:43:51,775 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-04 21:43:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:51,775 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-04 21:43:51,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:43:51,776 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-04 21:43:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:43:51,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:51,776 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-04 21:43:51,777 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:51,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:51,777 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2019-08-04 21:43:51,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:51,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-04 21:43:51,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:52,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:52,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:43:52,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:43:52,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:43:52,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:43:52,590 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-04 21:43:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:52,641 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-04 21:43:52,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:43:52,641 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-04 21:43:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:52,642 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:43:52,642 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:43:52,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:43:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:43:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:43:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:43:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:43:52,647 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-04 21:43:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:52,647 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:43:52,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:43:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:43:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:43:52,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:52,648 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-04 21:43:52,649 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:52,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:52,649 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2019-08-04 21:43:52,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:52,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:43:52,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:53,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:53,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:43:53,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:43:53,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:43:53,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:43:53,200 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-04 21:43:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:53,249 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-04 21:43:53,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:43:53,250 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-04 21:43:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:53,251 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:43:53,251 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:43:53,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:43:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:43:53,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:43:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:43:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-04 21:43:53,256 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-04 21:43:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:53,257 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-04 21:43:53,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:43:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-04 21:43:53,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:43:53,258 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:53,258 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-04 21:43:53,258 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:53,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:53,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2019-08-04 21:43:53,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:53,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-04 21:43:53,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:54,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:54,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:43:54,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:43:54,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:43:54,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:43:54,468 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-04 21:43:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:54,559 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-04 21:43:54,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:43:54,559 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-04 21:43:54,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:54,560 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:43:54,560 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:43:54,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:43:54,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:43:54,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:43:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:43:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-04 21:43:54,563 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-04 21:43:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:54,563 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-04 21:43:54,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:43:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-04 21:43:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:43:54,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:54,564 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-04 21:43:54,564 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:54,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:54,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2019-08-04 21:43:54,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:54,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-04 21:43:54,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:54,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:54,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:43:54,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:43:54,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:43:54,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:43:54,995 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-04 21:43:55,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:55,079 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-04 21:43:55,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:43:55,080 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-04 21:43:55,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:55,080 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:43:55,080 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:43:55,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:43:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:43:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:43:55,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:43:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-04 21:43:55,085 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-04 21:43:55,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:55,085 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-04 21:43:55,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:43:55,085 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-04 21:43:55,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:43:55,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:55,086 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-04 21:43:55,086 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:55,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:55,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2019-08-04 21:43:55,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:55,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-04 21:43:55,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:55,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:55,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:43:55,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:43:55,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:43:55,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:43:55,472 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-04 21:43:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:55,515 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-04 21:43:55,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:43:55,515 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-04 21:43:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:55,516 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:43:55,516 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:43:55,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:43:55,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:43:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:43:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:43:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-04 21:43:55,520 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-04 21:43:55,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:55,520 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-04 21:43:55,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:43:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-04 21:43:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:43:55,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:55,521 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-04 21:43:55,521 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:55,522 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2019-08-04 21:43:55,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:55,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-04 21:43:55,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:56,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:56,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:43:56,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:43:56,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:43:56,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:43:56,019 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-04 21:43:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:56,142 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-04 21:43:56,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:43:56,142 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-04 21:43:56,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:56,143 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:43:56,143 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:43:56,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:43:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:43:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:43:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:43:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-04 21:43:56,147 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-04 21:43:56,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:56,147 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-04 21:43:56,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:43:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-04 21:43:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:43:56,148 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:56,149 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-04 21:43:56,149 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:56,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:56,149 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2019-08-04 21:43:56,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:56,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-04 21:43:56,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:57,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:57,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:43:57,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:43:57,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:43:57,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:43:57,155 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-04 21:43:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:57,203 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-04 21:43:57,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:43:57,203 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-04 21:43:57,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:57,204 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:43:57,204 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:43:57,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:43:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:43:57,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:43:57,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:43:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-04 21:43:57,207 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-04 21:43:57,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:57,208 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-04 21:43:57,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:43:57,208 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-04 21:43:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:43:57,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:57,208 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-04 21:43:57,208 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:57,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:57,209 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2019-08-04 21:43:57,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:57,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:43:57,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:57,784 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:57,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:57,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:43:57,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:43:57,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:43:57,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:43:57,786 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-04 21:43:57,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:57,829 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-04 21:43:57,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:43:57,829 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-04 21:43:57,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:57,830 INFO L225 Difference]: With dead ends: 36 [2019-08-04 21:43:57,830 INFO L226 Difference]: Without dead ends: 36 [2019-08-04 21:43:57,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:43:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-04 21:43:57,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-04 21:43:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:43:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-04 21:43:57,834 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-04 21:43:57,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:57,834 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-04 21:43:57,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:43:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-04 21:43:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:43:57,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:57,835 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-04 21:43:57,835 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:57,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:57,836 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2019-08-04 21:43:57,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:57,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-04 21:43:57,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:58,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:58,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:43:58,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:43:58,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:43:58,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:43:58,380 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-04 21:43:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:58,418 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-04 21:43:58,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:43:58,418 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-04 21:43:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:58,419 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:43:58,419 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:43:58,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:43:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:43:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:43:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:43:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-04 21:43:58,423 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-04 21:43:58,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:58,423 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-04 21:43:58,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:43:58,424 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-04 21:43:58,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:43:58,424 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:58,424 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-04 21:43:58,424 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:58,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:58,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2019-08-04 21:43:58,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:58,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-04 21:43:58,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:59,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:59,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:43:59,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:43:59,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:43:59,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:43:59,271 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-04 21:43:59,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:59,323 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-04 21:43:59,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:43:59,323 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-04 21:43:59,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:59,324 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:43:59,324 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:43:59,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:43:59,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:43:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:43:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:43:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-04 21:43:59,327 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-04 21:43:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:59,328 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-04 21:43:59,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:43:59,328 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-04 21:43:59,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:43:59,328 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:59,329 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-04 21:43:59,329 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:59,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:59,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2019-08-04 21:43:59,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:59,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-04 21:43:59,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:59,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:59,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:43:59,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:43:59,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:43:59,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:43:59,977 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-04 21:44:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:00,025 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-04 21:44:00,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:44:00,026 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-04 21:44:00,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:00,026 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:44:00,027 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:44:00,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:44:00,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:44:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:44:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:44:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-04 21:44:00,039 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-04 21:44:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:00,039 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-04 21:44:00,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:44:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-04 21:44:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:44:00,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:00,040 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-04 21:44:00,040 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:00,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:00,041 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2019-08-04 21:44:00,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:00,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:44:00,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:01,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:01,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:44:01,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:44:01,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:44:01,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:44:01,769 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-04 21:44:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:01,830 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-04 21:44:01,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:44:01,831 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-04 21:44:01,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:01,831 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:44:01,831 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:44:01,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:44:01,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:44:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:44:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:44:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-04 21:44:01,835 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-04 21:44:01,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:01,835 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-04 21:44:01,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:44:01,835 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-04 21:44:01,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:44:01,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:01,836 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-04 21:44:01,836 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:01,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:01,836 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2019-08-04 21:44:01,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:01,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-04 21:44:01,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:02,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:02,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:44:02,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:44:02,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:44:02,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:44:02,361 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-04 21:44:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:02,405 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-04 21:44:02,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:44:02,406 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-04 21:44:02,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:02,406 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:44:02,406 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:44:02,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:44:02,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:44:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:44:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:44:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:44:02,409 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-04 21:44:02,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:02,409 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:44:02,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:44:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:44:02,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:44:02,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:02,410 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-04 21:44:02,410 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:02,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:02,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2019-08-04 21:44:02,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:02,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:44:02,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:03,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:03,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:44:03,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:44:03,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:44:03,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:44:03,078 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-04 21:44:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:03,142 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-04 21:44:03,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:44:03,143 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-04 21:44:03,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:03,143 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:44:03,143 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:44:03,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:44:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:44:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:44:03,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:44:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-04 21:44:03,146 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-04 21:44:03,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:03,146 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-04 21:44:03,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:44:03,147 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-04 21:44:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:44:03,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:03,147 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-04 21:44:03,148 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:03,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:03,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2019-08-04 21:44:03,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:03,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-04 21:44:03,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:03,748 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:03,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:03,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:44:03,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:44:03,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:44:03,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:44:03,750 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-04 21:44:03,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:03,851 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-04 21:44:03,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:44:03,851 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-04 21:44:03,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:03,852 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:44:03,852 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:44:03,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:44:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:44:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:44:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:44:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-04 21:44:03,856 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-04 21:44:03,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:03,857 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-04 21:44:03,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:44:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-04 21:44:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:44:03,857 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:03,857 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-04 21:44:03,858 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:03,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:03,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2019-08-04 21:44:03,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:03,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-04 21:44:03,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:04,766 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:04,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:04,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:44:04,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:44:04,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:44:04,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:44:04,768 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-04 21:44:04,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:04,818 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-04 21:44:04,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:44:04,819 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-04 21:44:04,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:04,819 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:44:04,820 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:44:04,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:44:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:44:04,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-04 21:44:04,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:44:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-04 21:44:04,823 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-04 21:44:04,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:04,823 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-04 21:44:04,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:44:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-04 21:44:04,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-04 21:44:04,824 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:04,824 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-04 21:44:04,824 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:04,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:04,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2019-08-04 21:44:04,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:04,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-04 21:44:04,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:05,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:05,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:44:05,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:44:05,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:44:05,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:44:05,727 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-04 21:44:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:05,794 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-04 21:44:05,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:44:05,795 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-04 21:44:05,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:05,795 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:44:05,795 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:44:05,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:44:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:44:05,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:44:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:44:05,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-04 21:44:05,798 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-04 21:44:05,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:05,799 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-04 21:44:05,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:44:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-04 21:44:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:44:05,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:05,799 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-04 21:44:05,799 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:05,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:05,800 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2019-08-04 21:44:05,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:05,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-04 21:44:05,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:06,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:06,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:44:06,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:44:06,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:44:06,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:44:06,458 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-04 21:44:06,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:06,519 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-04 21:44:06,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:44:06,520 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-04 21:44:06,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:06,520 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:44:06,520 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:44:06,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:44:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:44:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:44:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:44:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-04 21:44:06,523 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-04 21:44:06,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:06,523 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-04 21:44:06,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:44:06,523 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-04 21:44:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:44:06,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:06,524 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-04 21:44:06,524 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:06,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:06,524 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2019-08-04 21:44:06,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:06,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:44:06,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:07,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:07,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:44:07,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:44:07,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:44:07,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:44:07,279 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-04 21:44:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:07,328 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-04 21:44:07,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:44:07,329 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-04 21:44:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:07,329 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:44:07,329 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:44:07,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:44:07,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:44:07,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:44:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:44:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-04 21:44:07,333 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-04 21:44:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:07,334 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-04 21:44:07,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:44:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-04 21:44:07,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:44:07,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:07,335 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-04 21:44:07,335 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:07,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:07,335 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2019-08-04 21:44:07,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:07,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-04 21:44:07,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:08,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:08,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:44:08,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:44:08,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:44:08,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:44:08,165 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-04 21:44:08,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:08,270 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-04 21:44:08,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:44:08,270 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-04 21:44:08,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:08,271 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:44:08,271 INFO L226 Difference]: Without dead ends: 48 [2019-08-04 21:44:08,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:44:08,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-04 21:44:08,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-04 21:44:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:44:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-04 21:44:08,274 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-04 21:44:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:08,274 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-04 21:44:08,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:44:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-04 21:44:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:44:08,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:08,275 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-04 21:44:08,275 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:08,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:08,276 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2019-08-04 21:44:08,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:08,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-04 21:44:08,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:09,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:09,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:44:09,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:44:09,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:44:09,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:44:09,601 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-04 21:44:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:09,673 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-04 21:44:09,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:44:09,674 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-04 21:44:09,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:09,674 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:44:09,675 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:44:09,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:44:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:44:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:44:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:44:09,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-04 21:44:09,677 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-04 21:44:09,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:09,677 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-04 21:44:09,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:44:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-04 21:44:09,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:44:09,678 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:09,678 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-04 21:44:09,678 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:09,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:09,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2019-08-04 21:44:09,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:09,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-04 21:44:09,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:10,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:10,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:10,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:44:10,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:44:10,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:44:10,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:44:10,647 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-04 21:44:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:10,951 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-04 21:44:10,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:44:10,952 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-04 21:44:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:10,953 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:44:10,953 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:44:10,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:44:10,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:44:10,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:44:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:44:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-04 21:44:10,955 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-04 21:44:10,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:10,955 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-04 21:44:10,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:44:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-04 21:44:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:44:10,956 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:10,956 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-04 21:44:10,957 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:10,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:10,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2019-08-04 21:44:10,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:10,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-04 21:44:10,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:12,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:12,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:44:12,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:44:12,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:44:12,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:44:12,116 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-04 21:44:12,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:12,177 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-04 21:44:12,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:44:12,177 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-04 21:44:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:12,178 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:44:12,178 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:44:12,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:44:12,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:44:12,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:44:12,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:44:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-04 21:44:12,181 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-04 21:44:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:12,181 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-04 21:44:12,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:44:12,181 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-04 21:44:12,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:44:12,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:12,182 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-04 21:44:12,182 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:12,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:12,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2019-08-04 21:44:12,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:12,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-04 21:44:12,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:13,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:13,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:44:13,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:44:13,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:44:13,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:44:13,041 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-04 21:44:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:13,098 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-04 21:44:13,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:44:13,099 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-04 21:44:13,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:13,100 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:44:13,100 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:44:13,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:44:13,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:44:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:44:13,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:44:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-04 21:44:13,103 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-04 21:44:13,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:13,103 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-04 21:44:13,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:44:13,103 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-04 21:44:13,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:44:13,104 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:13,104 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-04 21:44:13,104 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:13,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:13,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2019-08-04 21:44:13,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:13,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-04 21:44:13,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:14,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:14,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:44:14,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:44:14,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:44:14,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:44:14,007 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-04 21:44:14,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:14,072 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-04 21:44:14,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:44:14,072 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-04 21:44:14,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:14,073 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:44:14,073 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:44:14,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:44:14,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:44:14,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:44:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:44:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:44:14,077 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-04 21:44:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:14,077 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:44:14,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:44:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:44:14,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:44:14,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:14,078 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-04 21:44:14,078 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:14,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:14,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2019-08-04 21:44:14,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:14,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-04 21:44:14,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:15,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:15,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:44:15,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:44:15,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:44:15,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:44:15,218 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-04 21:44:15,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:15,281 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-04 21:44:15,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:44:15,281 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-04 21:44:15,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:15,282 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:44:15,282 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:44:15,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:44:15,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:44:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:44:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:44:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-04 21:44:15,286 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-04 21:44:15,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:15,286 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-04 21:44:15,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:44:15,286 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-04 21:44:15,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:44:15,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:15,287 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-04 21:44:15,287 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:15,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:15,288 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2019-08-04 21:44:15,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:15,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-04 21:44:15,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:16,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:16,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:44:16,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:44:16,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:44:16,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:44:16,276 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-04 21:44:16,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:16,358 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-04 21:44:16,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:44:16,358 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-04 21:44:16,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:16,359 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:44:16,360 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:44:16,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:44:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:44:16,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:44:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:44:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-04 21:44:16,362 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-04 21:44:16,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:16,363 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-04 21:44:16,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:44:16,363 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-04 21:44:16,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:44:16,364 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:16,364 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-04 21:44:16,364 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:16,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:16,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125254, now seen corresponding path program 51 times [2019-08-04 21:44:16,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:16,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-04 21:44:16,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:17,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:17,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:44:17,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:44:17,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:44:17,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:44:17,813 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-04 21:44:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:17,904 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-04 21:44:17,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:44:17,905 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-04 21:44:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:17,906 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:44:17,906 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:44:17,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:44:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:44:17,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:44:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:44:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-04 21:44:17,909 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-04 21:44:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:17,910 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-04 21:44:17,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:44:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-04 21:44:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:44:17,910 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:17,910 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-04 21:44:17,911 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:17,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:17,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107936, now seen corresponding path program 52 times [2019-08-04 21:44:17,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:17,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-04 21:44:17,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:18,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:18,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:44:18,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:44:18,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:44:18,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:44:18,985 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-04 21:44:19,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:19,064 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-04 21:44:19,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:44:19,064 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-04 21:44:19,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:19,065 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:44:19,065 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:44:19,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:44:19,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:44:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:44:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:44:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-04 21:44:19,069 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-04 21:44:19,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:19,070 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-04 21:44:19,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:44:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-04 21:44:19,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:44:19,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:19,070 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-04 21:44:19,071 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:19,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:19,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832710, now seen corresponding path program 53 times [2019-08-04 21:44:19,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:19,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-04 21:44:19,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:20,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:20,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:44:20,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:44:20,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:44:20,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:44:20,383 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-04 21:44:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:20,446 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-04 21:44:20,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:44:20,447 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-04 21:44:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:20,448 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:44:20,448 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:44:20,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:44:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:44:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:44:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:44:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-04 21:44:20,451 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-04 21:44:20,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:20,451 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-04 21:44:20,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:44:20,451 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-04 21:44:20,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:44:20,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:20,452 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-04 21:44:20,452 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:20,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:20,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895520, now seen corresponding path program 54 times [2019-08-04 21:44:20,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:20,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-04 21:44:20,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:21,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:21,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:44:21,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:44:21,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:44:21,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:44:21,562 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-04 21:44:21,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:21,640 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-04 21:44:21,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:44:21,640 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-04 21:44:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:21,641 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:44:21,641 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:44:21,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:44:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:44:21,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:44:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:44:21,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-04 21:44:21,644 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-04 21:44:21,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:21,644 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-04 21:44:21,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:44:21,645 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-04 21:44:21,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:44:21,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:21,645 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-04 21:44:21,645 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:21,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:21,645 INFO L82 PathProgramCache]: Analyzing trace with hash -836059322, now seen corresponding path program 55 times [2019-08-04 21:44:21,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:21,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-04 21:44:21,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:22,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:22,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:22,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:44:22,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:44:22,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:44:22,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:44:22,863 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-04 21:44:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:22,942 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-04 21:44:22,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:44:22,943 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-04 21:44:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:22,943 INFO L225 Difference]: With dead ends: 60 [2019-08-04 21:44:22,944 INFO L226 Difference]: Without dead ends: 60 [2019-08-04 21:44:22,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:44:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-04 21:44:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-04 21:44:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:44:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-04 21:44:22,947 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-04 21:44:22,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:22,947 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-04 21:44:22,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:44:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-04 21:44:22,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-04 21:44:22,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:22,948 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-04 21:44:22,948 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:22,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:22,948 INFO L82 PathProgramCache]: Analyzing trace with hash -148039072, now seen corresponding path program 56 times [2019-08-04 21:44:22,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:22,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-04 21:44:22,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:24,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:24,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:44:24,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:44:24,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:44:24,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:44:24,092 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-04 21:44:24,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:24,160 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-04 21:44:24,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:44:24,161 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-04 21:44:24,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:24,161 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:44:24,162 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:44:24,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:44:24,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:44:24,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:44:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:44:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-04 21:44:24,164 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-04 21:44:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:24,165 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-04 21:44:24,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:44:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-04 21:44:24,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:44:24,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:24,165 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-04 21:44:24,166 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:24,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:24,166 INFO L82 PathProgramCache]: Analyzing trace with hash -294247802, now seen corresponding path program 57 times [2019-08-04 21:44:24,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:24,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-04 21:44:24,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:25,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:25,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:44:25,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:44:25,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:44:25,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:44:25,618 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-04 21:44:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:25,685 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-04 21:44:25,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:44:25,686 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-04 21:44:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:25,686 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:44:25,687 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:44:25,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:44:25,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:44:25,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-04 21:44:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:44:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-04 21:44:25,690 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-04 21:44:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:25,690 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-04 21:44:25,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:44:25,690 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-04 21:44:25,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-04 21:44:25,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:25,691 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-04 21:44:25,691 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:25,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:25,691 INFO L82 PathProgramCache]: Analyzing trace with hash -531751136, now seen corresponding path program 58 times [2019-08-04 21:44:25,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:25,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-04 21:44:25,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:26,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:26,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:44:26,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:44:26,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:44:26,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:44:26,931 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-04 21:44:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:27,000 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-04 21:44:27,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:44:27,000 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-04 21:44:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:27,001 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:44:27,001 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:44:27,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:44:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:44:27,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:44:27,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:44:27,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-04 21:44:27,004 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-04 21:44:27,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:27,004 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-04 21:44:27,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:44:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-04 21:44:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:44:27,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:27,005 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-04 21:44:27,005 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:27,006 INFO L82 PathProgramCache]: Analyzing trace with hash 695580102, now seen corresponding path program 59 times [2019-08-04 21:44:27,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:27,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-04 21:44:27,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:28,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:28,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:44:28,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:44:28,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:44:28,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:44:28,498 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-04 21:44:28,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:28,585 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-04 21:44:28,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:44:28,585 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-04 21:44:28,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:28,586 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:44:28,586 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:44:28,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:44:28,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:44:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-04 21:44:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:44:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-04 21:44:28,589 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-04 21:44:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:28,589 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-04 21:44:28,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:44:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-04 21:44:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:44:28,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:28,590 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-04 21:44:28,590 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:28,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:28,591 INFO L82 PathProgramCache]: Analyzing trace with hash 88142816, now seen corresponding path program 60 times [2019-08-04 21:44:28,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:28,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-04 21:44:28,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:30,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:30,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:44:30,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:44:30,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:44:30,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:44:30,258 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-04 21:44:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:30,347 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-04 21:44:30,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:44:30,348 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-04 21:44:30,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:30,348 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:44:30,349 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:44:30,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:44:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:44:30,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:44:30,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:44:30,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-04 21:44:30,352 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-04 21:44:30,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:30,352 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-04 21:44:30,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:44:30,352 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-04 21:44:30,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:44:30,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:30,352 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-04 21:44:30,352 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:30,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:30,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543866, now seen corresponding path program 61 times [2019-08-04 21:44:30,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:30,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-04 21:44:30,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:31,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:31,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:44:31,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:44:31,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:44:31,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:44:31,765 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-04 21:44:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:31,893 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-04 21:44:31,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:44:31,894 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-04 21:44:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:31,895 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:44:31,895 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:44:31,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:44:31,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:44:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-04 21:44:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:44:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-04 21:44:31,897 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-04 21:44:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:31,898 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-04 21:44:31,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:44:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-04 21:44:31,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-04 21:44:31,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:31,899 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-04 21:44:31,899 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:31,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:31,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223456, now seen corresponding path program 62 times [2019-08-04 21:44:31,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:31,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-04 21:44:31,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:33,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:33,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:44:33,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:44:33,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:44:33,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:44:33,334 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-04 21:44:33,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:33,429 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-04 21:44:33,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:44:33,430 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-04 21:44:33,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:33,430 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:44:33,430 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:44:33,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:44:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:44:33,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:44:33,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:44:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-04 21:44:33,433 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-04 21:44:33,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:33,434 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-04 21:44:33,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:44:33,434 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-04 21:44:33,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:44:33,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:33,434 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-04 21:44:33,435 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:33,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:33,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774662, now seen corresponding path program 63 times [2019-08-04 21:44:33,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:33,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-04 21:44:33,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:35,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:35,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:44:35,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:44:35,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:44:35,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:44:35,116 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-04 21:44:35,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:35,193 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-04 21:44:35,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:44:35,194 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-04 21:44:35,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:35,195 INFO L225 Difference]: With dead ends: 68 [2019-08-04 21:44:35,195 INFO L226 Difference]: Without dead ends: 68 [2019-08-04 21:44:35,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:44:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-04 21:44:35,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-04 21:44:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-04 21:44:35,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-04 21:44:35,198 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-04 21:44:35,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:35,198 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-04 21:44:35,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:44:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-04 21:44:35,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-04 21:44:35,199 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:35,199 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-04 21:44:35,199 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:35,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:35,200 INFO L82 PathProgramCache]: Analyzing trace with hash -892596896, now seen corresponding path program 64 times [2019-08-04 21:44:35,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:35,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-04 21:44:35,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:37,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:37,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:44:37,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:44:37,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:44:37,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:44:37,194 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-04 21:44:37,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:37,290 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-04 21:44:37,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:44:37,290 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-04 21:44:37,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:37,291 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:44:37,291 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:44:37,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:44:37,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:44:37,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:44:37,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:44:37,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-04 21:44:37,294 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-04 21:44:37,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:37,294 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-04 21:44:37,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:44:37,294 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-04 21:44:37,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:44:37,295 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:37,295 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-04 21:44:37,295 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:37,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:37,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703866, now seen corresponding path program 65 times [2019-08-04 21:44:37,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:37,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-04 21:44:37,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:38,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:38,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:38,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:44:38,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:44:38,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:44:38,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:44:38,960 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-04 21:44:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:39,049 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-04 21:44:39,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:44:39,049 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-04 21:44:39,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:39,050 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:44:39,050 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:44:39,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:44:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:44:39,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-04 21:44:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:44:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-04 21:44:39,053 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-04 21:44:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:39,053 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-04 21:44:39,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:44:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-04 21:44:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-04 21:44:39,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:39,054 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-04 21:44:39,054 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:39,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:39,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718432, now seen corresponding path program 66 times [2019-08-04 21:44:39,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:39,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-04 21:44:39,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:40,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:40,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:44:40,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:44:40,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:44:40,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:44:40,798 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-04 21:44:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:40,888 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-04 21:44:40,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:44:40,888 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-04 21:44:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:40,889 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:44:40,889 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:44:40,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:44:40,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:44:40,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:44:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:44:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-04 21:44:40,892 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-04 21:44:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:40,892 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-04 21:44:40,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:44:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-04 21:44:40,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:44:40,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:40,893 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-04 21:44:40,893 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:40,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:40,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438138, now seen corresponding path program 67 times [2019-08-04 21:44:40,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:40,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-04 21:44:40,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:42,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:42,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:44:42,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:44:42,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:44:42,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:44:42,585 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-04 21:44:42,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:42,682 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-04 21:44:42,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:44:42,682 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-04 21:44:42,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:42,683 INFO L225 Difference]: With dead ends: 72 [2019-08-04 21:44:42,683 INFO L226 Difference]: Without dead ends: 72 [2019-08-04 21:44:42,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:44:42,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-04 21:44:42,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-04 21:44:42,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-04 21:44:42,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-04 21:44:42,686 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-04 21:44:42,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:42,686 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-04 21:44:42,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:44:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-04 21:44:42,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-04 21:44:42,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:42,687 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-04 21:44:42,687 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:42,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:42,687 INFO L82 PathProgramCache]: Analyzing trace with hash 976119520, now seen corresponding path program 68 times [2019-08-04 21:44:42,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:42,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-04 21:44:42,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:44,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:44,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:44:44,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:44:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:44:44,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:44:44,391 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-04 21:44:44,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:44,473 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-04 21:44:44,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:44:44,473 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-04 21:44:44,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:44,474 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:44:44,474 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:44:44,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:44:44,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:44:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:44:44,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:44:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-04 21:44:44,477 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-04 21:44:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:44,477 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-04 21:44:44,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:44:44,477 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-04 21:44:44,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:44:44,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:44,478 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-04 21:44:44,478 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:44,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:44,478 INFO L82 PathProgramCache]: Analyzing trace with hash 194930182, now seen corresponding path program 69 times [2019-08-04 21:44:44,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:44,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-04 21:44:44,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:46,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:46,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:44:46,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:44:46,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:44:46,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:44:46,728 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-04 21:44:46,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:46,822 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-04 21:44:46,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:44:46,823 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-04 21:44:46,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:46,824 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:44:46,824 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:44:46,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:44:46,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:44:46,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-04 21:44:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-04 21:44:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-04 21:44:46,827 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-04 21:44:46,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:46,828 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-04 21:44:46,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:44:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-04 21:44:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-04 21:44:46,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:46,828 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-04 21:44:46,829 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:46,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:46,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864480, now seen corresponding path program 70 times [2019-08-04 21:44:46,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:46,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-04 21:44:46,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:48,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:48,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:44:48,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:44:48,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:44:48,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:44:48,680 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-04 21:44:48,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:48,780 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-04 21:44:48,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:44:48,780 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-04 21:44:48,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:48,781 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:44:48,782 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:44:48,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:44:48,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:44:48,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:44:48,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:44:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-04 21:44:48,784 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-04 21:44:48,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:48,785 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-04 21:44:48,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:44:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-04 21:44:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:44:48,785 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:48,786 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-04 21:44:48,786 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:48,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:48,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779834, now seen corresponding path program 71 times [2019-08-04 21:44:48,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:48,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-04 21:44:48,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:51,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:51,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:44:51,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:44:51,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:44:51,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:44:51,376 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-04 21:44:51,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:51,464 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-04 21:44:51,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:44:51,464 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-04 21:44:51,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:51,465 INFO L225 Difference]: With dead ends: 76 [2019-08-04 21:44:51,466 INFO L226 Difference]: Without dead ends: 76 [2019-08-04 21:44:51,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:44:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-04 21:44:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-04 21:44:51,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-04 21:44:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-04 21:44:51,469 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-04 21:44:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:51,469 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-04 21:44:51,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:44:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-04 21:44:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-04 21:44:51,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:51,470 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-04 21:44:51,470 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:51,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:51,470 INFO L82 PathProgramCache]: Analyzing trace with hash 365428832, now seen corresponding path program 72 times [2019-08-04 21:44:51,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:51,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-04 21:44:51,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:53,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:53,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:44:53,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:44:53,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:44:53,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:44:53,506 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-04 21:44:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:53,617 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-04 21:44:53,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:44:53,618 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-04 21:44:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:53,618 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:44:53,619 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:44:53,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:44:53,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:44:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:44:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:44:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-04 21:44:53,622 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-04 21:44:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:53,622 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-04 21:44:53,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:44:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-04 21:44:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:44:53,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:53,623 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-04 21:44:53,623 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:53,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:53,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1556611962, now seen corresponding path program 73 times [2019-08-04 21:44:53,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:53,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-04 21:44:53,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:55,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:55,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:44:55,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:44:55,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:44:55,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:44:55,970 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-04 21:44:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:56,075 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-04 21:44:56,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:44:56,076 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-04 21:44:56,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:56,076 INFO L225 Difference]: With dead ends: 78 [2019-08-04 21:44:56,077 INFO L226 Difference]: Without dead ends: 78 [2019-08-04 21:44:56,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:44:56,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-04 21:44:56,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-04 21:44:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-04 21:44:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-04 21:44:56,079 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-04 21:44:56,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:56,080 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-04 21:44:56,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:44:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-04 21:44:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-04 21:44:56,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:56,081 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-04 21:44:56,081 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:56,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:56,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334432, now seen corresponding path program 74 times [2019-08-04 21:44:56,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:56,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-04 21:44:56,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:59,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:59,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:44:59,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:44:59,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:44:59,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:44:59,480 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-04 21:44:59,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:59,575 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-04 21:44:59,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:44:59,575 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-04 21:44:59,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:59,576 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:44:59,576 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:44:59,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:44:59,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:44:59,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:44:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:44:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-04 21:44:59,580 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-04 21:44:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:59,580 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-04 21:44:59,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:44:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-04 21:44:59,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:44:59,580 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:59,581 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-04 21:44:59,581 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:59,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:59,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600186, now seen corresponding path program 75 times [2019-08-04 21:44:59,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:59,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-04 21:44:59,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:02,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:02,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:02,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:45:02,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:45:02,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:45:02,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:45:02,089 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-04 21:45:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:02,196 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-04 21:45:02,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:45:02,196 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-04 21:45:02,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:02,197 INFO L225 Difference]: With dead ends: 80 [2019-08-04 21:45:02,197 INFO L226 Difference]: Without dead ends: 80 [2019-08-04 21:45:02,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:45:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-04 21:45:02,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-04 21:45:02,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-04 21:45:02,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-04 21:45:02,201 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-04 21:45:02,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:02,201 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-04 21:45:02,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:45:02,201 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-04 21:45:02,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-04 21:45:02,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:02,202 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-04 21:45:02,202 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:02,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:02,203 INFO L82 PathProgramCache]: Analyzing trace with hash -268903968, now seen corresponding path program 76 times [2019-08-04 21:45:02,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:02,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-04 21:45:02,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:04,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:04,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-04 21:45:04,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-04 21:45:04,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-04 21:45:04,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:45:04,280 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-04 21:45:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:04,404 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-04 21:45:04,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-04 21:45:04,405 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-04 21:45:04,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:04,406 INFO L225 Difference]: With dead ends: 81 [2019-08-04 21:45:04,406 INFO L226 Difference]: Without dead ends: 81 [2019-08-04 21:45:04,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:45:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-04 21:45:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-04 21:45:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:45:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-04 21:45:04,409 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-04 21:45:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:04,409 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-04 21:45:04,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-04 21:45:04,409 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-04 21:45:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:45:04,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:04,410 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-04 21:45:04,410 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:04,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:04,410 INFO L82 PathProgramCache]: Analyzing trace with hash 253907718, now seen corresponding path program 77 times [2019-08-04 21:45:04,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:04,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-04 21:45:04,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:06,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:06,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-04 21:45:06,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-04 21:45:06,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-04 21:45:06,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:45:06,812 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-04 21:45:07,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:07,209 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-04 21:45:07,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-04 21:45:07,210 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-04 21:45:07,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:07,211 INFO L225 Difference]: With dead ends: 82 [2019-08-04 21:45:07,211 INFO L226 Difference]: Without dead ends: 82 [2019-08-04 21:45:07,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:45:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-04 21:45:07,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-04 21:45:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-04 21:45:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-04 21:45:07,213 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-04 21:45:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:07,213 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-04 21:45:07,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-04 21:45:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-04 21:45:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-04 21:45:07,214 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:07,214 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-04 21:45:07,216 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:07,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:07,217 INFO L82 PathProgramCache]: Analyzing trace with hash -718799200, now seen corresponding path program 78 times [2019-08-04 21:45:07,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:07,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-04 21:45:07,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:09,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:09,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:09,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-04 21:45:09,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-04 21:45:09,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-04 21:45:09,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:45:09,403 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-04 21:45:09,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:09,526 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-04 21:45:09,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-04 21:45:09,534 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-04 21:45:09,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:09,535 INFO L225 Difference]: With dead ends: 83 [2019-08-04 21:45:09,535 INFO L226 Difference]: Without dead ends: 83 [2019-08-04 21:45:09,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:45:09,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-04 21:45:09,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-04 21:45:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-04 21:45:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-04 21:45:09,538 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-04 21:45:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:09,538 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-04 21:45:09,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-04 21:45:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-04 21:45:09,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-04 21:45:09,539 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:09,539 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-04 21:45:09,539 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:09,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:09,539 INFO L82 PathProgramCache]: Analyzing trace with hash -807942586, now seen corresponding path program 79 times [2019-08-04 21:45:09,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:09,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-04 21:45:09,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:12,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:12,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-04 21:45:12,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-04 21:45:12,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-04 21:45:12,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:45:12,124 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-04 21:45:12,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:12,254 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-04 21:45:12,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-04 21:45:12,255 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-04 21:45:12,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:12,256 INFO L225 Difference]: With dead ends: 84 [2019-08-04 21:45:12,256 INFO L226 Difference]: Without dead ends: 84 [2019-08-04 21:45:12,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:45:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-04 21:45:12,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-04 21:45:12,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-04 21:45:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-04 21:45:12,258 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-04 21:45:12,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:12,259 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-04 21:45:12,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-04 21:45:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-04 21:45:12,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-04 21:45:12,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:12,260 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-04 21:45:12,260 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:12,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:12,260 INFO L82 PathProgramCache]: Analyzing trace with hash 723579744, now seen corresponding path program 80 times [2019-08-04 21:45:12,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:12,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-04 21:45:12,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:16,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:16,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-04 21:45:16,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-04 21:45:16,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-04 21:45:16,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:45:16,843 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-04 21:45:16,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:16,947 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-04 21:45:16,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-04 21:45:16,947 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-04 21:45:16,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:16,948 INFO L225 Difference]: With dead ends: 85 [2019-08-04 21:45:16,948 INFO L226 Difference]: Without dead ends: 85 [2019-08-04 21:45:16,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:45:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-04 21:45:16,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-04 21:45:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-04 21:45:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-04 21:45:16,951 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-04 21:45:16,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:16,951 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-04 21:45:16,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-04 21:45:16,952 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-04 21:45:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-04 21:45:16,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:16,952 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-04 21:45:16,952 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:16,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:16,953 INFO L82 PathProgramCache]: Analyzing trace with hash 956131718, now seen corresponding path program 81 times [2019-08-04 21:45:16,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:16,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-04 21:45:16,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:19,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:19,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-04 21:45:19,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-04 21:45:19,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-04 21:45:19,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:45:19,266 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-04 21:45:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:19,526 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-04 21:45:19,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-04 21:45:19,526 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-04 21:45:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:19,527 INFO L225 Difference]: With dead ends: 86 [2019-08-04 21:45:19,527 INFO L226 Difference]: Without dead ends: 86 [2019-08-04 21:45:19,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:45:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-04 21:45:19,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-04 21:45:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-04 21:45:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-04 21:45:19,529 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-04 21:45:19,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:19,529 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-04 21:45:19,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-04 21:45:19,529 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-04 21:45:19,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-04 21:45:19,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:19,530 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-04 21:45:19,530 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:19,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:19,531 INFO L82 PathProgramCache]: Analyzing trace with hash -424691680, now seen corresponding path program 82 times [2019-08-04 21:45:19,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:19,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-04 21:45:19,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:22,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:22,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:22,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-04 21:45:22,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-04 21:45:22,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-04 21:45:22,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:45:22,385 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-04 21:45:22,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:22,497 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-04 21:45:22,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-04 21:45:22,498 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-04 21:45:22,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:22,499 INFO L225 Difference]: With dead ends: 87 [2019-08-04 21:45:22,499 INFO L226 Difference]: Without dead ends: 87 [2019-08-04 21:45:22,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:45:22,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-04 21:45:22,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-04 21:45:22,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-04 21:45:22,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-04 21:45:22,502 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-04 21:45:22,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:22,502 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-04 21:45:22,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-04 21:45:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-04 21:45:22,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-04 21:45:22,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:22,503 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-04 21:45:22,503 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:22,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:22,504 INFO L82 PathProgramCache]: Analyzing trace with hash -280544058, now seen corresponding path program 83 times [2019-08-04 21:45:22,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:22,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-04 21:45:22,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:25,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:25,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-04 21:45:25,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-04 21:45:25,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-04 21:45:25,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:45:25,014 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-04 21:45:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:25,198 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-04 21:45:25,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-04 21:45:25,199 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-04 21:45:25,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:25,199 INFO L225 Difference]: With dead ends: 88 [2019-08-04 21:45:25,200 INFO L226 Difference]: Without dead ends: 88 [2019-08-04 21:45:25,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:45:25,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-04 21:45:25,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-04 21:45:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-04 21:45:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-04 21:45:25,203 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-04 21:45:25,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:25,204 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-04 21:45:25,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-04 21:45:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-04 21:45:25,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-04 21:45:25,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:25,204 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-04 21:45:25,205 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:25,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:25,205 INFO L82 PathProgramCache]: Analyzing trace with hash -106935072, now seen corresponding path program 84 times [2019-08-04 21:45:25,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:25,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-04 21:45:25,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:27,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:27,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-04 21:45:27,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-04 21:45:27,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-04 21:45:27,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:45:27,967 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-04 21:45:28,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:28,086 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-04 21:45:28,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-04 21:45:28,087 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-04 21:45:28,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:28,088 INFO L225 Difference]: With dead ends: 89 [2019-08-04 21:45:28,088 INFO L226 Difference]: Without dead ends: 89 [2019-08-04 21:45:28,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:45:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-04 21:45:28,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-04 21:45:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-04 21:45:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-04 21:45:28,091 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-04 21:45:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:28,091 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-04 21:45:28,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-04 21:45:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-04 21:45:28,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-04 21:45:28,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:28,092 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-04 21:45:28,092 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:28,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:28,093 INFO L82 PathProgramCache]: Analyzing trace with hash 979976198, now seen corresponding path program 85 times [2019-08-04 21:45:28,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:28,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-04 21:45:28,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:30,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:30,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:30,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-04 21:45:30,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-04 21:45:30,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-04 21:45:30,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:45:30,723 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-04 21:45:30,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:30,917 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-04 21:45:30,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-04 21:45:30,918 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-04 21:45:30,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:30,919 INFO L225 Difference]: With dead ends: 90 [2019-08-04 21:45:30,919 INFO L226 Difference]: Without dead ends: 90 [2019-08-04 21:45:30,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:45:30,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-04 21:45:30,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-04 21:45:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-04 21:45:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-04 21:45:30,922 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-04 21:45:30,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:30,922 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-04 21:45:30,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-04 21:45:30,923 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-04 21:45:30,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-04 21:45:30,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:30,923 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-04 21:45:30,923 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:30,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:30,924 INFO L82 PathProgramCache]: Analyzing trace with hash 314487200, now seen corresponding path program 86 times [2019-08-04 21:45:30,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:30,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-04 21:45:30,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:33,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:33,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-04 21:45:33,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-04 21:45:33,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-04 21:45:33,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:45:33,878 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-04 21:45:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:34,001 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-04 21:45:34,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-04 21:45:34,002 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-04 21:45:34,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:34,002 INFO L225 Difference]: With dead ends: 91 [2019-08-04 21:45:34,003 INFO L226 Difference]: Without dead ends: 91 [2019-08-04 21:45:34,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:45:34,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-04 21:45:34,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-04 21:45:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-04 21:45:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-04 21:45:34,005 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-04 21:45:34,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:34,006 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-04 21:45:34,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-04 21:45:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-04 21:45:34,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-04 21:45:34,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:34,007 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-04 21:45:34,007 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:34,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:34,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164742, now seen corresponding path program 87 times [2019-08-04 21:45:34,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:34,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-04 21:45:34,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:37,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:37,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:37,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-04 21:45:37,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-04 21:45:37,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-04 21:45:37,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-04 21:45:37,030 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-04 21:45:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:37,144 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-04 21:45:37,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-04 21:45:37,144 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-04 21:45:37,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:37,145 INFO L225 Difference]: With dead ends: 92 [2019-08-04 21:45:37,145 INFO L226 Difference]: Without dead ends: 92 [2019-08-04 21:45:37,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-04 21:45:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-04 21:45:37,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-04 21:45:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-04 21:45:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-04 21:45:37,148 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-04 21:45:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:37,148 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-04 21:45:37,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-04 21:45:37,149 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-04 21:45:37,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-04 21:45:37,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:37,149 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-04 21:45:37,150 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:37,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:37,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364768, now seen corresponding path program 88 times [2019-08-04 21:45:37,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:37,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-04 21:45:37,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:39,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:39,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-04 21:45:39,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-04 21:45:39,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-04 21:45:39,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:45:39,828 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-04 21:45:39,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:39,957 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-04 21:45:39,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-04 21:45:39,957 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-04 21:45:39,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:39,958 INFO L225 Difference]: With dead ends: 93 [2019-08-04 21:45:39,958 INFO L226 Difference]: Without dead ends: 93 [2019-08-04 21:45:39,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:45:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-04 21:45:39,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-04 21:45:39,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-04 21:45:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-04 21:45:39,961 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-04 21:45:39,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:39,961 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-04 21:45:39,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-04 21:45:39,961 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-04 21:45:39,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-04 21:45:39,962 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:39,962 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-04 21:45:39,962 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:39,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:39,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663686, now seen corresponding path program 89 times [2019-08-04 21:45:39,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:39,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-04 21:45:39,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:43,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:43,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-04 21:45:43,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-04 21:45:43,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-04 21:45:43,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:45:43,020 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-04 21:45:44,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:44,211 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-04 21:45:44,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-04 21:45:44,211 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-04 21:45:44,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:44,211 INFO L225 Difference]: With dead ends: 94 [2019-08-04 21:45:44,212 INFO L226 Difference]: Without dead ends: 94 [2019-08-04 21:45:44,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:45:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-04 21:45:44,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-04 21:45:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-04 21:45:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-04 21:45:44,214 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-04 21:45:44,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:44,214 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-04 21:45:44,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-04 21:45:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-04 21:45:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-04 21:45:44,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:44,215 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-04 21:45:44,215 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:44,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:44,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930144, now seen corresponding path program 90 times [2019-08-04 21:45:44,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:44,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-04 21:45:44,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:47,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:47,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-04 21:45:47,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-04 21:45:47,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-04 21:45:47,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-04 21:45:47,397 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-04 21:45:47,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:47,512 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-04 21:45:47,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-04 21:45:47,513 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-04 21:45:47,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:47,514 INFO L225 Difference]: With dead ends: 95 [2019-08-04 21:45:47,514 INFO L226 Difference]: Without dead ends: 95 [2019-08-04 21:45:47,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-04 21:45:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-04 21:45:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-04 21:45:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-04 21:45:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-04 21:45:47,517 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-04 21:45:47,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:47,517 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-04 21:45:47,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-04 21:45:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-04 21:45:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-04 21:45:47,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:47,518 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-04 21:45:47,518 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:47,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:47,519 INFO L82 PathProgramCache]: Analyzing trace with hash 854092230, now seen corresponding path program 91 times [2019-08-04 21:45:47,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:47,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-04 21:45:47,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:50,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:50,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-04 21:45:50,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-04 21:45:50,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-04 21:45:50,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-04 21:45:50,511 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-04 21:45:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:50,637 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-04 21:45:50,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-04 21:45:50,637 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-04 21:45:50,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:50,638 INFO L225 Difference]: With dead ends: 96 [2019-08-04 21:45:50,638 INFO L226 Difference]: Without dead ends: 96 [2019-08-04 21:45:50,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-04 21:45:50,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-04 21:45:50,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-04 21:45:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-04 21:45:50,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-04 21:45:50,641 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-04 21:45:50,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:50,642 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-04 21:45:50,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-04 21:45:50,642 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-04 21:45:50,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-04 21:45:50,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:50,643 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-04 21:45:50,643 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:50,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:50,643 INFO L82 PathProgramCache]: Analyzing trace with hash 707051488, now seen corresponding path program 92 times [2019-08-04 21:45:50,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:50,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-04 21:45:50,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:53,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:53,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-04 21:45:53,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-04 21:45:53,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-04 21:45:53,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-04 21:45:53,892 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-04 21:45:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:54,030 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-04 21:45:54,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-04 21:45:54,031 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-04 21:45:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:54,032 INFO L225 Difference]: With dead ends: 97 [2019-08-04 21:45:54,032 INFO L226 Difference]: Without dead ends: 97 [2019-08-04 21:45:54,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-04 21:45:54,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-04 21:45:54,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-04 21:45:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-04 21:45:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-04 21:45:54,034 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-04 21:45:54,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:54,035 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-04 21:45:54,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-04 21:45:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-04 21:45:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-04 21:45:54,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:54,036 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-04 21:45:54,036 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:54,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:54,036 INFO L82 PathProgramCache]: Analyzing trace with hash 443755782, now seen corresponding path program 93 times [2019-08-04 21:45:54,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:54,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-04 21:45:54,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:57,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:57,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-04 21:45:57,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-04 21:45:57,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-04 21:45:57,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-04 21:45:57,510 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-04 21:45:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:57,638 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-04 21:45:57,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-04 21:45:57,638 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-04 21:45:57,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:57,639 INFO L225 Difference]: With dead ends: 98 [2019-08-04 21:45:57,639 INFO L226 Difference]: Without dead ends: 98 [2019-08-04 21:45:57,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-04 21:45:57,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-04 21:45:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-04 21:45:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-04 21:45:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-04 21:45:57,642 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-04 21:45:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:57,642 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-04 21:45:57,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-04 21:45:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-04 21:45:57,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-04 21:45:57,643 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:57,643 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-04 21:45:57,644 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:57,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:57,644 INFO L82 PathProgramCache]: Analyzing trace with hash 871523488, now seen corresponding path program 94 times [2019-08-04 21:45:57,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:57,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-04 21:45:57,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:01,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:01,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:01,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-04 21:46:01,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-04 21:46:01,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-04 21:46:01,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-04 21:46:01,271 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-04 21:46:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:01,411 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-04 21:46:01,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-04 21:46:01,412 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-04 21:46:01,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:01,412 INFO L225 Difference]: With dead ends: 99 [2019-08-04 21:46:01,413 INFO L226 Difference]: Without dead ends: 99 [2019-08-04 21:46:01,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-04 21:46:01,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-04 21:46:01,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-04 21:46:01,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-04 21:46:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-04 21:46:01,415 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-04 21:46:01,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:01,416 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-04 21:46:01,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-04 21:46:01,416 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-04 21:46:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-04 21:46:01,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:01,417 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-04 21:46:01,417 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:01,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:01,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420486, now seen corresponding path program 95 times [2019-08-04 21:46:01,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:01,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-04 21:46:01,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:04,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:04,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:04,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-04 21:46:04,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-04 21:46:04,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-04 21:46:04,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-04 21:46:04,813 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-04 21:46:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:04,963 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-04 21:46:04,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-04 21:46:04,963 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-04 21:46:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:04,964 INFO L225 Difference]: With dead ends: 100 [2019-08-04 21:46:04,964 INFO L226 Difference]: Without dead ends: 100 [2019-08-04 21:46:04,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-04 21:46:04,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-04 21:46:04,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-04 21:46:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-04 21:46:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-04 21:46:04,967 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-04 21:46:04,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:04,967 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-04 21:46:04,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-04 21:46:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-04 21:46:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-04 21:46:04,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:04,968 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-04 21:46:04,968 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:04,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:04,968 INFO L82 PathProgramCache]: Analyzing trace with hash 15325536, now seen corresponding path program 96 times [2019-08-04 21:46:04,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:04,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-04 21:46:04,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:08,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:08,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:08,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-04 21:46:08,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-04 21:46:08,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-04 21:46:08,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-04 21:46:08,534 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-04 21:46:08,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:08,684 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-04 21:46:08,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-04 21:46:08,684 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-04 21:46:08,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:08,685 INFO L225 Difference]: With dead ends: 101 [2019-08-04 21:46:08,685 INFO L226 Difference]: Without dead ends: 101 [2019-08-04 21:46:08,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-04 21:46:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-04 21:46:08,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-04 21:46:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-04 21:46:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-04 21:46:08,688 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-04 21:46:08,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:08,689 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-04 21:46:08,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-04 21:46:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-04 21:46:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-04 21:46:08,690 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:08,690 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-04 21:46:08,690 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:08,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:08,690 INFO L82 PathProgramCache]: Analyzing trace with hash 475087750, now seen corresponding path program 97 times [2019-08-04 21:46:08,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:08,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-04 21:46:08,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:12,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:12,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-04 21:46:12,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-04 21:46:12,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-04 21:46:12,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-04 21:46:12,063 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-04 21:46:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:12,425 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-04 21:46:12,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-04 21:46:12,426 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-04 21:46:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:12,427 INFO L225 Difference]: With dead ends: 102 [2019-08-04 21:46:12,427 INFO L226 Difference]: Without dead ends: 102 [2019-08-04 21:46:12,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-04 21:46:12,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-04 21:46:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-04 21:46:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-04 21:46:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-04 21:46:12,430 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-04 21:46:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:12,430 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-04 21:46:12,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-04 21:46:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-04 21:46:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-04 21:46:12,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:12,431 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-04 21:46:12,431 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:12,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814496, now seen corresponding path program 98 times [2019-08-04 21:46:12,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:12,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-04 21:46:12,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:15,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:15,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-04 21:46:15,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-04 21:46:15,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-04 21:46:15,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-04 21:46:15,740 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-04 21:46:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:15,891 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-04 21:46:15,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-04 21:46:15,892 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-04 21:46:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:15,893 INFO L225 Difference]: With dead ends: 103 [2019-08-04 21:46:15,893 INFO L226 Difference]: Without dead ends: 103 [2019-08-04 21:46:15,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-04 21:46:15,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-04 21:46:15,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-04 21:46:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-04 21:46:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-04 21:46:15,896 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-04 21:46:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:15,897 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-04 21:46:15,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-04 21:46:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-04 21:46:15,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-04 21:46:15,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:15,897 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-04 21:46:15,898 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:15,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:15,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670662, now seen corresponding path program 99 times [2019-08-04 21:46:15,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:15,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-04 21:46:15,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:19,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:19,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-04 21:46:19,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-04 21:46:19,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-04 21:46:19,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-04 21:46:19,612 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-08-04 21:46:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:19,769 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-04 21:46:19,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-04 21:46:19,769 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-04 21:46:19,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:19,770 INFO L225 Difference]: With dead ends: 104 [2019-08-04 21:46:19,770 INFO L226 Difference]: Without dead ends: 104 [2019-08-04 21:46:19,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-04 21:46:19,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-04 21:46:19,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-04 21:46:19,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-04 21:46:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-04 21:46:19,774 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-04 21:46:19,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:19,774 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-04 21:46:19,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-04 21:46:19,774 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-04 21:46:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-04 21:46:19,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:19,775 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-04 21:46:19,775 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:19,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:19,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080992, now seen corresponding path program 100 times [2019-08-04 21:46:19,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:19,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-04 21:46:19,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:23,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:23,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-04 21:46:23,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-04 21:46:23,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-04 21:46:23,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-04 21:46:23,436 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-08-04 21:46:23,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:23,587 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-04 21:46:23,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-04 21:46:23,588 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-08-04 21:46:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:23,589 INFO L225 Difference]: With dead ends: 105 [2019-08-04 21:46:23,589 INFO L226 Difference]: Without dead ends: 105 [2019-08-04 21:46:23,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-04 21:46:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-04 21:46:23,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-04 21:46:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-04 21:46:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-04 21:46:23,593 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-04 21:46:23,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:23,593 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-04 21:46:23,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-04 21:46:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-04 21:46:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-04 21:46:23,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:23,594 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-08-04 21:46:23,594 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:23,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:23,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833926, now seen corresponding path program 101 times [2019-08-04 21:46:23,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:23,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-04 21:46:23,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:27,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:27,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-04 21:46:27,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-04 21:46:27,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-04 21:46:27,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-04 21:46:27,240 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-08-04 21:46:27,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:27,492 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-04 21:46:27,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-04 21:46:27,492 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-08-04 21:46:27,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:27,493 INFO L225 Difference]: With dead ends: 106 [2019-08-04 21:46:27,493 INFO L226 Difference]: Without dead ends: 106 [2019-08-04 21:46:27,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-04 21:46:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-04 21:46:27,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-04 21:46:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-04 21:46:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-04 21:46:27,496 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-04 21:46:27,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:27,496 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-04 21:46:27,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-04 21:46:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-04 21:46:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-04 21:46:27,497 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:27,497 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-08-04 21:46:27,497 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:27,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:27,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076768, now seen corresponding path program 102 times [2019-08-04 21:46:27,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:27,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-04 21:46:27,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:31,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:31,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-04 21:46:31,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-04 21:46:31,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-04 21:46:31,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-04 21:46:31,309 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-08-04 21:46:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:31,500 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-04 21:46:31,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-04 21:46:31,501 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-08-04 21:46:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:31,502 INFO L225 Difference]: With dead ends: 107 [2019-08-04 21:46:31,502 INFO L226 Difference]: Without dead ends: 107 [2019-08-04 21:46:31,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-04 21:46:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-04 21:46:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-04 21:46:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-04 21:46:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-04 21:46:31,506 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-04 21:46:31,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:31,506 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-04 21:46:31,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-04 21:46:31,506 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-04 21:46:31,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-04 21:46:31,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:31,507 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-08-04 21:46:31,507 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:31,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:31,507 INFO L82 PathProgramCache]: Analyzing trace with hash 748670278, now seen corresponding path program 103 times [2019-08-04 21:46:31,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:31,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-04 21:46:31,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:35,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:35,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-04 21:46:35,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-04 21:46:35,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-04 21:46:35,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-04 21:46:35,707 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-08-04 21:46:35,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:35,874 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-04 21:46:35,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-04 21:46:35,874 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-08-04 21:46:35,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:35,875 INFO L225 Difference]: With dead ends: 108 [2019-08-04 21:46:35,875 INFO L226 Difference]: Without dead ends: 108 [2019-08-04 21:46:35,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-04 21:46:35,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-04 21:46:35,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-04 21:46:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-04 21:46:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-04 21:46:35,878 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-04 21:46:35,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:35,879 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-04 21:46:35,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-04 21:46:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-04 21:46:35,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-04 21:46:35,880 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:35,880 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-04 21:46:35,880 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:35,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:35,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938272, now seen corresponding path program 104 times [2019-08-04 21:46:35,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:35,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-04 21:46:35,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:40,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:40,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-04 21:46:40,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-04 21:46:40,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-04 21:46:40,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-04 21:46:40,223 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-04 21:46:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:40,418 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-04 21:46:40,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-04 21:46:40,419 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-04 21:46:40,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:40,419 INFO L225 Difference]: With dead ends: 109 [2019-08-04 21:46:40,419 INFO L226 Difference]: Without dead ends: 109 [2019-08-04 21:46:40,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-04 21:46:40,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-04 21:46:40,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-04 21:46:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-04 21:46:40,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-04 21:46:40,422 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-04 21:46:40,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:40,422 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-04 21:46:40,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-04 21:46:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-04 21:46:40,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-04 21:46:40,423 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:40,423 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-04 21:46:40,424 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:40,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:40,424 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492282, now seen corresponding path program 105 times [2019-08-04 21:46:40,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:40,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-04 21:46:40,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:44,566 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:44,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:44,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-04 21:46:44,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-04 21:46:44,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-04 21:46:44,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-04 21:46:44,568 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-08-04 21:46:44,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:44,726 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-04 21:46:44,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-04 21:46:44,726 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-04 21:46:44,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:44,727 INFO L225 Difference]: With dead ends: 110 [2019-08-04 21:46:44,727 INFO L226 Difference]: Without dead ends: 110 [2019-08-04 21:46:44,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-04 21:46:44,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-04 21:46:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-04 21:46:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-04 21:46:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-04 21:46:44,730 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-04 21:46:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:44,730 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-04 21:46:44,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-04 21:46:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-04 21:46:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-04 21:46:44,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:44,731 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-08-04 21:46:44,731 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:44,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:44,732 INFO L82 PathProgramCache]: Analyzing trace with hash -132755168, now seen corresponding path program 106 times [2019-08-04 21:46:44,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:44,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-04 21:46:44,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:48,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:48,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-04 21:46:48,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-04 21:46:48,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-04 21:46:48,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-04 21:46:48,886 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-08-04 21:46:49,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:49,073 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-04 21:46:49,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-04 21:46:49,074 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-08-04 21:46:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:49,074 INFO L225 Difference]: With dead ends: 111 [2019-08-04 21:46:49,074 INFO L226 Difference]: Without dead ends: 111 [2019-08-04 21:46:49,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-04 21:46:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-04 21:46:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-04 21:46:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-04 21:46:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-04 21:46:49,077 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-04 21:46:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:49,077 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-04 21:46:49,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-04 21:46:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-04 21:46:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-04 21:46:49,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:49,078 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-08-04 21:46:49,078 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:49,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:49,079 INFO L82 PathProgramCache]: Analyzing trace with hash 179553222, now seen corresponding path program 107 times [2019-08-04 21:46:49,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:49,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-04 21:46:49,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:53,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:53,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-04 21:46:53,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-04 21:46:53,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-04 21:46:53,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-04 21:46:53,387 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-08-04 21:46:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:53,560 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-04 21:46:53,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-04 21:46:53,560 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-08-04 21:46:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:53,561 INFO L225 Difference]: With dead ends: 112 [2019-08-04 21:46:53,561 INFO L226 Difference]: Without dead ends: 112 [2019-08-04 21:46:53,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-04 21:46:53,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-04 21:46:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-04 21:46:53,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-04 21:46:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-04 21:46:53,563 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-04 21:46:53,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:53,564 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-04 21:46:53,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-04 21:46:53,564 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-04 21:46:53,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-04 21:46:53,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:53,565 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-08-04 21:46:53,565 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:53,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:53,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178720, now seen corresponding path program 108 times [2019-08-04 21:46:53,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:53,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-04 21:46:53,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:57,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:57,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-04 21:46:57,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-04 21:46:57,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-04 21:46:57,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-04 21:46:57,680 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-08-04 21:46:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:57,846 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-04 21:46:57,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-04 21:46:57,847 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-08-04 21:46:57,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:57,848 INFO L225 Difference]: With dead ends: 113 [2019-08-04 21:46:57,848 INFO L226 Difference]: Without dead ends: 113 [2019-08-04 21:46:57,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-04 21:46:57,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-04 21:46:57,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-04 21:46:57,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-04 21:46:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-04 21:46:57,851 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-04 21:46:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:57,851 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-04 21:46:57,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-04 21:46:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-04 21:46:57,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-04 21:46:57,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:57,852 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-08-04 21:46:57,852 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:57,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:57,853 INFO L82 PathProgramCache]: Analyzing trace with hash 751830790, now seen corresponding path program 109 times [2019-08-04 21:46:57,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:57,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-04 21:46:57,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:02,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:02,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:02,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-04 21:47:02,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-04 21:47:02,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-04 21:47:02,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-04 21:47:02,075 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-08-04 21:47:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:02,282 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-04 21:47:02,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-04 21:47:02,282 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-08-04 21:47:02,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:02,283 INFO L225 Difference]: With dead ends: 114 [2019-08-04 21:47:02,283 INFO L226 Difference]: Without dead ends: 114 [2019-08-04 21:47:02,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-04 21:47:02,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-04 21:47:02,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-04 21:47:02,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-04 21:47:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-04 21:47:02,285 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-04 21:47:02,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:02,286 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-04 21:47:02,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-04 21:47:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-04 21:47:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-04 21:47:02,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:02,287 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-08-04 21:47:02,287 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:02,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:02,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914144, now seen corresponding path program 110 times [2019-08-04 21:47:02,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:02,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-04 21:47:02,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:06,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:06,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-04 21:47:06,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-04 21:47:06,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-04 21:47:06,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-04 21:47:06,674 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-08-04 21:47:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:06,842 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-04 21:47:06,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-04 21:47:06,843 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-08-04 21:47:06,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:06,843 INFO L225 Difference]: With dead ends: 115 [2019-08-04 21:47:06,843 INFO L226 Difference]: Without dead ends: 115 [2019-08-04 21:47:06,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-04 21:47:06,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-04 21:47:06,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-04 21:47:06,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-04 21:47:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-04 21:47:06,847 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-04 21:47:06,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:06,847 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-04 21:47:06,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-04 21:47:06,848 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-04 21:47:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-04 21:47:06,848 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:06,848 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-08-04 21:47:06,849 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:06,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:06,849 INFO L82 PathProgramCache]: Analyzing trace with hash 954759750, now seen corresponding path program 111 times [2019-08-04 21:47:06,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:06,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-04 21:47:06,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:11,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:11,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-04 21:47:11,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-04 21:47:11,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-04 21:47:11,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-04 21:47:11,539 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2019-08-04 21:47:11,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:11,735 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-04 21:47:11,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-04 21:47:11,735 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2019-08-04 21:47:11,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:11,736 INFO L225 Difference]: With dead ends: 116 [2019-08-04 21:47:11,736 INFO L226 Difference]: Without dead ends: 116 [2019-08-04 21:47:11,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-04 21:47:11,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-04 21:47:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-04 21:47:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-04 21:47:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-04 21:47:11,739 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-04 21:47:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:11,740 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-04 21:47:11,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-04 21:47:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-04 21:47:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-04 21:47:11,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:11,740 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-04 21:47:11,741 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:11,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:11,741 INFO L82 PathProgramCache]: Analyzing trace with hash -467222688, now seen corresponding path program 112 times [2019-08-04 21:47:11,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:11,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-04 21:47:11,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:16,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:16,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-04 21:47:16,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-04 21:47:16,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-04 21:47:16,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-04 21:47:16,366 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-04 21:47:16,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:16,591 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-04 21:47:16,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-04 21:47:16,591 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-04 21:47:16,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:16,592 INFO L225 Difference]: With dead ends: 117 [2019-08-04 21:47:16,592 INFO L226 Difference]: Without dead ends: 117 [2019-08-04 21:47:16,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-04 21:47:16,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-04 21:47:16,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-04 21:47:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-04 21:47:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-04 21:47:16,595 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-04 21:47:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:16,595 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-04 21:47:16,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-04 21:47:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-04 21:47:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-04 21:47:16,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:16,596 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2019-08-04 21:47:16,596 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:16,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:16,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005306, now seen corresponding path program 113 times [2019-08-04 21:47:16,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:16,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-04 21:47:16,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:21,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:21,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-04 21:47:21,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-04 21:47:21,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-04 21:47:21,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-04 21:47:21,262 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2019-08-04 21:47:21,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:21,434 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-04 21:47:21,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-04 21:47:21,434 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2019-08-04 21:47:21,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:21,435 INFO L225 Difference]: With dead ends: 118 [2019-08-04 21:47:21,435 INFO L226 Difference]: Without dead ends: 118 [2019-08-04 21:47:21,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-04 21:47:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-04 21:47:21,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-04 21:47:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-04 21:47:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-04 21:47:21,438 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-08-04 21:47:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:21,439 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-04 21:47:21,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-04 21:47:21,439 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-04 21:47:21,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-04 21:47:21,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:21,440 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2019-08-04 21:47:21,440 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:21,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:21,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439200, now seen corresponding path program 114 times [2019-08-04 21:47:21,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:21,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-04 21:47:21,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:26,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:26,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:26,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-04 21:47:26,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-04 21:47:26,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-04 21:47:26,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-04 21:47:26,084 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2019-08-04 21:47:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:26,260 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-04 21:47:26,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-04 21:47:26,261 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2019-08-04 21:47:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:26,261 INFO L225 Difference]: With dead ends: 119 [2019-08-04 21:47:26,261 INFO L226 Difference]: Without dead ends: 119 [2019-08-04 21:47:26,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-04 21:47:26,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-04 21:47:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-04 21:47:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-04 21:47:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-04 21:47:26,264 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-08-04 21:47:26,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:26,265 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-04 21:47:26,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-04 21:47:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-04 21:47:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-04 21:47:26,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:26,266 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2019-08-04 21:47:26,266 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:26,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:26,266 INFO L82 PathProgramCache]: Analyzing trace with hash 954069190, now seen corresponding path program 115 times [2019-08-04 21:47:26,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:26,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-04 21:47:26,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:31,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:31,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-04 21:47:31,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-04 21:47:31,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-04 21:47:31,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-04 21:47:31,146 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2019-08-04 21:47:31,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:31,368 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-04 21:47:31,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-04 21:47:31,369 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2019-08-04 21:47:31,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:31,370 INFO L225 Difference]: With dead ends: 120 [2019-08-04 21:47:31,370 INFO L226 Difference]: Without dead ends: 120 [2019-08-04 21:47:31,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-04 21:47:31,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-04 21:47:31,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-04 21:47:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-04 21:47:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-04 21:47:31,373 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-08-04 21:47:31,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:31,373 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-04 21:47:31,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-04 21:47:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-04 21:47:31,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-04 21:47:31,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:31,374 INFO L399 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2019-08-04 21:47:31,374 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:31,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:31,374 INFO L82 PathProgramCache]: Analyzing trace with hash -488630048, now seen corresponding path program 116 times [2019-08-04 21:47:31,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:31,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-04 21:47:31,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:36,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:36,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-08-04 21:47:36,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-08-04 21:47:36,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-08-04 21:47:36,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-04 21:47:36,272 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2019-08-04 21:47:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:36,511 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-04 21:47:36,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-04 21:47:36,512 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2019-08-04 21:47:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:36,513 INFO L225 Difference]: With dead ends: 121 [2019-08-04 21:47:36,513 INFO L226 Difference]: Without dead ends: 121 [2019-08-04 21:47:36,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-04 21:47:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-04 21:47:36,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-04 21:47:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-04 21:47:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-04 21:47:36,515 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2019-08-04 21:47:36,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:36,516 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-04 21:47:36,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-08-04 21:47:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-04 21:47:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-04 21:47:36,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:36,517 INFO L399 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2019-08-04 21:47:36,517 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:36,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:36,517 INFO L82 PathProgramCache]: Analyzing trace with hash 2032333830, now seen corresponding path program 117 times [2019-08-04 21:47:36,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:36,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-04 21:47:36,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:41,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:41,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:41,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-08-04 21:47:41,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-08-04 21:47:41,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-08-04 21:47:41,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-04 21:47:41,533 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2019-08-04 21:47:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:41,729 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-04 21:47:41,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-08-04 21:47:41,730 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2019-08-04 21:47:41,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:41,731 INFO L225 Difference]: With dead ends: 122 [2019-08-04 21:47:41,731 INFO L226 Difference]: Without dead ends: 122 [2019-08-04 21:47:41,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-04 21:47:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-04 21:47:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-04 21:47:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-04 21:47:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-04 21:47:41,733 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2019-08-04 21:47:41,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:41,733 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-04 21:47:41,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-08-04 21:47:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-04 21:47:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-04 21:47:41,734 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:41,734 INFO L399 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2019-08-04 21:47:41,734 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:41,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:41,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1422164576, now seen corresponding path program 118 times [2019-08-04 21:47:41,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:41,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-04 21:47:41,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-04 21:47:43,191 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-04 21:47:43,191 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:47:43,195 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:47:43,195 INFO L202 PluginConnector]: Adding new model Octopussy.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:47:43 BoogieIcfgContainer [2019-08-04 21:47:43,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:47:43,198 INFO L168 Benchmark]: Toolchain (without parser) took 239978.99 ms. Allocated memory was 139.5 MB in the beginning and 712.0 MB in the end (delta: 572.5 MB). Free memory was 109.1 MB in the beginning and 560.2 MB in the end (delta: -451.1 MB). Peak memory consumption was 121.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:47:43,198 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:47:43,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.51 ms. Allocated memory is still 139.5 MB. Free memory was 109.1 MB in the beginning and 107.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:47:43,199 INFO L168 Benchmark]: Boogie Preprocessor took 21.73 ms. Allocated memory is still 139.5 MB. Free memory was 107.0 MB in the beginning and 106.1 MB in the end (delta: 891.7 kB). Peak memory consumption was 891.7 kB. Max. memory is 7.1 GB. [2019-08-04 21:47:43,200 INFO L168 Benchmark]: RCFGBuilder took 280.90 ms. Allocated memory is still 139.5 MB. Free memory was 106.1 MB in the beginning and 97.5 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:47:43,200 INFO L168 Benchmark]: TraceAbstraction took 239638.13 ms. Allocated memory was 139.5 MB in the beginning and 712.0 MB in the end (delta: 572.5 MB). Free memory was 97.1 MB in the beginning and 560.2 MB in the end (delta: -463.1 MB). Peak memory consumption was 109.4 MB. Max. memory is 7.1 GB. [2019-08-04 21:47:43,203 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.51 ms. Allocated memory is still 139.5 MB. Free memory was 109.1 MB in the beginning and 107.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.73 ms. Allocated memory is still 139.5 MB. Free memory was 107.0 MB in the beginning and 106.1 MB in the end (delta: 891.7 kB). Peak memory consumption was 891.7 kB. Max. memory is 7.1 GB. * RCFGBuilder took 280.90 ms. Allocated memory is still 139.5 MB. Free memory was 106.1 MB in the beginning and 97.5 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239638.13 ms. Allocated memory was 139.5 MB in the beginning and 712.0 MB in the end (delta: 572.5 MB). Free memory was 97.1 MB in the beginning and 560.2 MB in the end (delta: -463.1 MB). Peak memory consumption was 109.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 118,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 239.5s OverallTime, 119 OverallIterations, 118 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 356 SDtfs, 2 SDslu, 1980 SDs, 0 SdLazy, 9119 SolverSat, 216 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7139 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7021 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 219.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 118 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 221.5s InterpolantComputationTime, 7257 NumberOfCodeBlocks, 7257 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 7139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1692179 SizeOfPredicates, 118 NumberOfNonLiveVariables, 28674 ConjunctsInSsa, 7139 ConjunctsInUnsatCore, 118 InterpolantComputations, 1 PerfectInterpolantSequences, 0/273819 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown